Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods

DOI10.3233/FI-2019-1837zbMath1436.68210OpenAlexW2979960897MaRDI QIDQ5212019

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

zbMATH Keywords

synthesisapproximationpersistenceevent graphanalysistheory of regionsmarked graphweighted Petri net

Mathematics Subject Classification ID

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

Related Items (6)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Unnamed Item ⋮ On the parameterized complexity of the synthesis of Boolean nets with restricted place environments ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

This page was built for publication: Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods