CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES

DOI10.1142/S0129054110007222zbMath1200.68164OpenAlexW2035930260MaRDI QIDQ3552522

Serge Haddad, Manuel Silva, Laura Recalde

Publication date: 22 April 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007222

zbMATH Keywords

dynamical systemsreachabilitylivenessPetri netsdecidabilityexpressiveness

Mathematics Subject Classification ID

Related Items (8)

Individuals, populations and fluid approximations: a Petri net based perspective ⋮ Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy ⋮ Timing and liveness in continuous Petri nets ⋮ Unnamed Item ⋮ Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets ⋮ Finding cut-offs in leaderless rendez-vous protocols is easy ⋮ On fluidization of discrete event models: Observation and control of continuous Petri nets ⋮ Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques

Uses Software

• DYNAMO

Cites Work

• Universal computation and other capabilities of hybrid and continuous dynamical systems
• What's decidable about hybrid automata?
• A theory of timed automata
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Unnamed Item

This page was built for publication: CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES