Trace nets and process automata

DOI10.1007/BF01186645MaRDI QIDQ1902303zbMATH OpenFDO

Authors Eric Badouel, Philippe Darondeau

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)

Recommendations

• A trace semantics for Petri nets
• A trace semantics for Petri Nets
• Publication:4263304
• On trace-expressible behaviour of Petri nets
• Semi-traces and processes of Petri nets

Cites work

• scientific article; zbMATH DE number 3856434 (Why is no real title available?)
• scientific article; zbMATH DE number 4074504 (Why is no real title available?)
• scientific article; zbMATH DE number 177838 (Why is no real title available?)
• scientific article; zbMATH DE number 554482 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A calculus of communicating systems
• Elementary transition systems
• PETRI NETS AND STEP TRANSITION SYSTEMS

Cited in

(18)

• The Complexity of Synthesis of b-Bounded Petri Nets
• scientific article; zbMATH DE number 1512617 (Why is no real title available?)
• The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
• Fault model identification and synthesis in Petri nets
• Stratified petri nets
• Trace nets and conflict-free computations
• Identification of Petri nets from knowledge of their language
• On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
• Tile formats for located and mobile systems.
• On trace-expressible behaviour of Petri nets
• Synthesis of nets with inhibitor arcs
• On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
• Structural non-interference in elementary and trace nets
• scientific article; zbMATH DE number 4092788 (Why is no real title available?)
• On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
• The synthesis of Petri nets from path-automatic specifications
• Learning sunspot classification
• Process discovery and Petri nets

This page was built for publication: Trace nets and process automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902303)