The synthesis of Petri nets from path-automatic specifications

DOI10.1016/j.ic.2004.04.004zbMath1101.68691OpenAlexW2089759096MaRDI QIDQ1882929

Eric Badouel, Philippe Darondeau

Publication date: 1 October 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.04.004

zbMATH Keywords

Petri netsSynthesisSpecificationsAutomatic graphsModal transitions

Mathematics Subject Classification ID

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

Related Items

Stratified petri nets, Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues, Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems, Identification of Petri nets from knowledge of their language, Liveness and boundedness analysis of Petri net synthesis, On the Petri net realization of context-free graphs, Partial Order Semantics of Types of Nets, Hasse Diagram Generators and Petri Nets, Synthesis of Nets with Step Firing Policies

Uses Software

• ALGOL 60

Cites Work

• Partial (set) 2-structures. I: Basic notions and the representation problems
• Partial (set) 2-structures. II: State spaces of concurrent systems
• Rational equivalence relations
• Distributing finite automata through Petri net synthesis
• Trace nets and process automata
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Bounded Algol-Like Languages
• Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
• On the Petri net realization of context-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item