Petri Net Synthesis for Restricted Classes of Nets
From MaRDI portal
Publication:2822652
DOI10.1007/978-3-319-39086-4_6zbMATH Open1346.68140OpenAlexW2477047858MaRDI QIDQ2822652FDOQ2822652
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
Recommendations
- Petri net synthesis
- scientific article
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Over-approximative Petri net synthesis for restricted subclasses of nets
- scientific article; zbMATH DE number 512821
- The synthesis problem of Petri nets
- Synthesis of Petri nets from finite partial languages
- Synthesis of bounded choice-free Petri nets
- Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
Cites Work
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Proof Tree Preserving Interpolation
- Title not available (Why is that?)
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- New Region-Based Algorithms for Deriving Bounded Petri Nets
- Partial (set) 2-structures. I: Basic notions and the representation problems
- Partial (set) 2-structures. II: State spaces of concurrent systems
- State space axioms for T-systems
- Title not available (Why is that?)
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
- Petri net synthesis
- Process Discovery Using Integer Linear Programming
- Title not available (Why is that?)
- Identification of Petri nets from knowledge of their language
- Distributing finite automata through Petri net synthesis
- Petri Net Distributability
Cited In (12)
- Title not available (Why is that?)
- Presynthesis of bounded choice-free or fork-attribution nets
- Reduction and synthesis of live and bounded free choice Petri nets
- Synthesis of a Class of Deadlock-Free Petri Nets
- Synthesis of Petri nets from finite partial languages
- The synthesis problem of Petri nets
- Over-approximative Petri net synthesis for restricted subclasses of nets
- Comparison of different algorithms to synthesize a Petri net from a partial language
- Target-oriented Petri Net Synthesis
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- Stratified petri nets
- Simultaneous Petri Net Synthesis
Uses Software
This page was built for publication: Petri Net Synthesis for Restricted Classes of Nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2822652)