k-bounded Petri net synthesis from modal transition systems

DOI10.4230/LIPICS.CONCUR.2017.6MaRDI QIDQ5111618zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

synthesismodal transition systembounded Petri net

Mathematics Subject Classification ID

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

Recommendations

• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Bounded Petri net synthesis from modal transition systems is undecidable
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of bounded choice-free Petri nets
• Simultaneous Petri Net Synthesis

Cites work

• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• 20 years of modal and mixed specifications.
• A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
• Bounded Petri net synthesis from modal transition systems is undecidable
• Continuous separation of game languages
• Distributing finite automata through Petri net synthesis
• MoTraS: a tool for modal transition systems and their extensions
• New Region-Based Algorithms for Deriving Bounded Petri Nets
• On characterising distributability
• Partial (set) 2-structures. I: Basic notions and the representation problems
• Petri net distributability
• Petri net synthesis
• Results on the propositional \(\mu\)-calculus
• The synthesis problem for elementary net systems is NP-complete

Cited in

(7)

• scientific article; zbMATH DE number 6719540 (Why is no real title available?)
• The Complexity of Synthesis of b-Bounded Petri Nets
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets
• 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

Describes a project that uses

Uses Software

• APT
• Motras

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)