Petri Net Synthesis for Restricted Classes of Nets
From MaRDI portal
Publication:2822652
DOI10.1007/978-3-319-39086-4_6zbMath1346.68140OpenAlexW2477047858MaRDI QIDQ2822652
Publication date: 4 October 2016
Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-39086-4_6
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri net synthesis
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Partial (set) 2-structures. II: State spaces of concurrent systems
- Distributing finite automata through Petri net synthesis
- State space axioms for T-systems
- Identification of Petri nets from knowledge of their language
- Petri Net Distributability
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Process Discovery Using Integer Linear Programming
- Logic Synthesis for Asynchronous Controllers and Interfaces
- New Region-Based Algorithms for Deriving Bounded Petri Nets
- Proof Tree Preserving Interpolation
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
This page was built for publication: Petri Net Synthesis for Restricted Classes of Nets