Trace nets and process automata

DOI10.1007/BF01186645zbMath0831.68067MaRDI QIDQ1902303

Philippe Darondeau, Eric Badouel

Publication date: 13 February 1996

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Petri Netstrace nets

Mathematics Subject Classification ID

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

Related Items

The synthesis of Petri nets from path-automatic specifications, Stratified petri nets, Synthesis of nets with inhibitor arcs, On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets, Unnamed Item, On the parameterized complexity of the synthesis of Boolean nets with restricted place environments, Identification of Petri nets from knowledge of their language, The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs, Structural non-interference in elementary and trace nets, Process discovery and Petri nets, Tile formats for located and mobile systems., Fault model identification and synthesis in Petri nets, The Complexity of Synthesis of b-Bounded Petri Nets

Cites Work

• A calculus of communicating systems
• Elementary transition systems
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item