Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
From MaRDI portal
Publication:5212019
DOI10.3233/FI-2019-1837zbMATH Open1436.68210OpenAlexW2979960897MaRDI QIDQ5212019FDOQ5212019
Authors: Raymond Devillers, Thomas Hujsa 
Publication date: 24 January 2020
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2019-1837
Recommendations
- Analysis and synthesis of weighted marked graph Petri nets
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- Characterisation of the state spaces of marked graph Petri nets
- Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
Cited In (11)
- Target-oriented Petri net synthesis
- Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
- Quantitative analysis of continuous weighted marked graphs
- On the parameterized complexity of synthesizing Boolean Petri nets with restricted dependency
- Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
- On the parameterized complexity of the synthesis of Boolean nets with restricted place environments
- Parameterized complexity and approximability of coverability problems in weighted Petri nets
- Analysis and synthesis of weighted marked graph Petri nets
- Synthesis of Petri nets with restricted place-environments: classical and parameterized
- Characterisation of the state spaces of marked graph Petri nets
- Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues
This page was built for publication: Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212019)
