Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation

DOI10.1016/j.nahs.2008.09.016zbMath1163.93358OpenAlexW2086725365MaRDI QIDQ1026394

Adib Allahham, Hassane Alla

Publication date: 24 June 2009

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nahs.2008.09.016

zbMATH Keywords

reachability analysis\(T\)-time Petri netpost and pre-initialized stopwatch Petri netspreemption-resume behaviorstopwatch automata

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Attainable sets, reachability (93B03)

Uses Software

• PHAVer
• HyTech

Cites Work

• Unnamed Item
• The algorithmic analysis of hybrid systems
• Reachability problems and abstract state spaces for time Petri nets with stopwatches
• A theory of timed automata
• Discrete, Continuous, and Hybrid Petri Nets
• State space computation and analysis of Time Petri Nets
• Hybrid Systems: Computation and Control
• Applications and Theory of Petri Nets 2004

This page was built for publication: Post and pre-initialized stopwatch Petri nets: formal semantics and state space computation