Sciweavers

9 search results - page 1 / 2
» Continuous Petri Nets: Expressive Power and Decidability Iss...
Sort
View
ATVA
2007
Springer
153views Hardware» more  ATVA 2007»
13 years 8 months ago
Continuous Petri Nets: Expressive Power and Decidability Issues
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models. The expected...
Laura Recalde, Serge Haddad, Manuel Silva
IANDC
2008
87views more  IANDC 2008»
13 years 2 months ago
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
Patricia Bouyer, Serge Haddad, Pierre-Alain Reynie...
FUIN
2007
108views more  FUIN 2007»
13 years 2 months ago
An Axiomatization of the Token Game Based on Petri Algebras
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
Eric Badouel, Jules Chenou, Goulven Guillou
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 2 months ago
Decision Problems for Petri Nets with Names
We prove several decidability and undecidability results for -PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of...
Fernando Rosa Velardo, David de Frutos-Escrig
FORMATS
2006
Springer
13 years 6 months ago
On the Computational Power of Timed Differentiable Petri Nets
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...
Serge Haddad, Laura Recalde, Manuel Silva