Analysis and synthesis of weighted marked graph Petri nets

DOI10.1007/978-3-319-91268-4_2zbMath1427.68191OpenAlexW2799576071MaRDI QIDQ2280177

Thomas Hujsa, Raymond Devillers

Publication date: 18 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-319-91268-4_2

zbMATH Keywords

synthesisevent graphanalysismarked graphweighted Petri net

Mathematics Subject Classification ID

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

Related Items (5)

Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Target-oriented Petri Net Synthesis ⋮ Synthesis of (choice-free) reset nets

This page was built for publication: Analysis and synthesis of weighted marked graph Petri nets