k-bounded Petri net synthesis from modal transition systems
From MaRDI portal
Publication:5111618
DOI10.4230/LIPICS.CONCUR.2017.6zbMATH Open1442.68151OpenAlexW2759275744MaRDI QIDQ5111618FDOQ5111618
Authors: Uli Schlachter, Harro Wimmel 
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7780/pdf/LIPIcs-CONCUR-2017-6.pdf/
Recommendations
Cites Work
- MoTraS: a tool for modal transition systems and their extensions
- Results on the propositional \(\mu\)-calculus
- 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
- 20 years of modal and mixed specifications.
- On characterising distributability
- Petri net synthesis
- The synthesis problem for elementary net systems is NP-complete
- Distributing finite automata through Petri net synthesis
- Petri net distributability
- Bounded Petri net synthesis from modal transition systems is undecidable
- Continuous separation of game languages
Cited In (7)
- Title not available (Why is that?)
- The Complexity of 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
- Bounded Petri net synthesis from modal transition systems is undecidable
- Hardness Results for the Synthesis of b-bounded Petri Nets
- A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
Uses Software
This page was built for publication: \(k\)-bounded Petri net synthesis from modal transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111618)
