k-Bounded Petri Net Synthesis from Modal Transition Systems.
From MaRDI portal
Publication:5111618
DOI10.4230/LIPIcs.CONCUR.2017.6zbMath1442.68151OpenAlexW2759275744MaRDI QIDQ5111618
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7780/pdf/LIPIcs-CONCUR-2017-6.pdf/
Related Items (4)
Hardness Results for the Synthesis of b-bounded Petri Nets ⋮ Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ The Complexity of Synthesis of b-Bounded Petri Nets
Uses Software
Cites Work
- Results on the propositional \(\mu\)-calculus
- Petri net synthesis
- Partial (set) 2-structures. I: Basic notions and the representation problems
- The synthesis problem for elementary net systems is NP-complete
- Distributing finite automata through Petri net synthesis
- On Characterising Distributability
- Petri Net Distributability
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
- MoTraS: A Tool for Modal Transition Systems and Their Extensions
- New Region-Based Algorithms for Deriving Bounded Petri Nets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: k-Bounded Petri Net Synthesis from Modal Transition Systems.