Decidability results in first-order hybrid Petri nets

DOI10.1023/A:1008383031624zbMath0971.93051OpenAlexW2065733181MaRDI QIDQ5930251

Carla Seatzu, Fabio Balduzzi, Angela Di Febbraro, Alessandro Giua

Publication date: 16 October 2001

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008383031624

zbMATH Keywords

reachabilityhybrid Petri netsdecidability propertieshybrid automatatimed automata

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) Attainable sets, reachability (93B03) Applications of computability and recursion theory (03D80)

Related Items

Continuous Petri Nets: Expressive Power and Decidability Issues, A linear characterization of the switching dynamic behavior of timed continuous Petri nets with structural conflicts, Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets, First-order hybrid Petri nets. An application to distributed manufacturing systems, Parametric multisingular hybrid Petri nets: formal definitions and analysis techniques