Analysis and synthesis of weighted marked graph Petri nets

DOI10.1007/978-3-319-91268-4_2MaRDI QIDQ2280177zbMATH OpenOpenAlexFDO

Authors Raymond Devillers, Thomas Hujsa

Publication date 18 December 2019

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

zbMATH Keywords

analysisevent graphmarked graphsynthesisweighted Petri net

Mathematics Subject Classification ID

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

Recommendations

• Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
• 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
• Sufficient conditions for the marked graph realisability of labelled transition systems

Cited in

(9)

• Quantitative analysis of continuous weighted marked graphs
• Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• Synthesis of (choice-free) reset nets
• Synthesis of inhibitor-reset Petri nets: algorithmic and complexity issues
• Parameterized complexity of synthesizing \(b\)-bounded \((m,n)\)-T-systems
• Target-oriented Petri net synthesis
• Analysis and synthesis of weighted marked graph Petri nets: exact and approximate methods
• On the reversibility of circular conservative Petri nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2280177)