Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
From MaRDI portal
Publication:2165238
DOI10.1007/978-3-031-06653-5_12zbMath1499.68223OpenAlexW4285176701MaRDI QIDQ2165238
Raymond Devillers, Ronny Tredup
Publication date: 19 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_12
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri net synthesis
- A survey of Petri net methods for controlled discrete event systems
- Over-approximative Petri net synthesis for restricted subclasses of nets
- Bounded choice-free Petri net synthesis: algorithmic issues
- Distributing finite automata through Petri net synthesis
- The synthesis of Petri nets from path-automatic specifications
- The synthesis problem of Petri nets
- The complexity of synthesizing \textsf{nop}-equipped Boolean Petri nets from \(g\)-bounded inputs
- Synthesis of (choice-free) reset nets
- Analysis and synthesis of weighted marked graph Petri nets
- Process Mining
- A Bound on Solutions of Linear Integer Equalities and Inequalities
- Logic Synthesis for Asynchronous Controllers and Interfaces
- Target-oriented Petri Net Synthesis
- The Complexity of Synthesis of b-Bounded Petri Nets
- Polynomial algorithms for the synthesis of bounded nets
- A New Property of Choice-Free Petri Net Systems
- On Petri Nets with Hierarchical Special Arcs
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets
This page was built for publication: Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues