The expressive power of time Petri nets

DOI10.1016/j.tcs.2012.12.005zbMath1259.68141OpenAlexW2006988532MaRDI QIDQ1944773

Serge Haddad, Olivier H. Roux, Béatrice Bérard, Franck Cassez, Didier Lime

Publication date: 27 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.005

zbMATH Keywords

timed automatatime Petri netsexpressivenesslanguage equivalencebisimilarity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Interpreted synchronous extension of time Petri nets. Definition, semantics and formal analysis, Delay-dependent partial order reduction technique for real time systems, Waiting nets, Waiting Nets: State Classes and Taxonomy, Backward symbolic optimal reachability in weighted timed automata, Decidable Classes of Unbounded Petri Nets with Time and Urgency, Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*, Timed Petri nets with reset for pipelined synchronous circuit design