Sciweavers

101 search results - page 6 / 21
» On Reachability in Autonomous Continuous Petri Net Systems
Sort
View
RP
2010
Springer
150views Control Systems» more  RP 2010»
14 years 9 months ago
Rewriting Systems for Reachability in Vector Addition Systems with Pairs
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...
Paulin Jacobé de Naurois, Virgile Mogbil
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
15 years 5 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...
DEDS
1998
152views more  DEDS 1998»
14 years 11 months ago
Timed Petri Nets in Hybrid Systems: Stability and Supervisory Control
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
Xenofon D. Koutsoukos, Kevin X. He, Michael D. Lem...
BIRTHDAY
2003
Springer
15 years 4 months ago
Petri Net Analysis Using Invariant Generation
Abstract. Petri nets have been widely used to model and analyze concurrent systems. Their wide-spread use in this domain is, on one hand, facilitated by their simplicity and expres...
Sriram Sankaranarayanan, Henny Sipma, Zohar Manna
FUIN
2007
123views more  FUIN 2007»
14 years 11 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc