Continuous Petri Nets: Expressive Power and Decidability Issues

DOI10.1007/978-3-540-75596-8_26zbMath1141.68514OpenAlexW2168135204MaRDI QIDQ3510807

Serge Haddad, Laura Recalde, Manuel Silva

Publication date: 3 July 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_26

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Dense-choice counter machines revisited

Cites Work

• On the Computational Power of Timed Differentiable Petri Nets
• On Reachability in Autonomous Continuous Petri Net Systems
• Applications and Theory of Petri Nets 2005
• Decidability results in first-order hybrid Petri nets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous Petri Nets: Expressive Power and Decidability Issues