Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond

DOI10.1007/978-3-662-63079-2_4zbMath1464.68236arXiv1910.14387OpenAlexW3151970875MaRDI QIDQ2032839

Raymond Devillers, Thomas Hujsa, Evgeny Erofeev

Publication date: 14 June 2021

Full work available at URL: https://arxiv.org/abs/1910.14387

zbMATH Keywords

synthesiscyclepolynomial-time algorithmlabelled transition systemParikh vectorcyclic wordweighted Petri netchoice-free netcircular solvabilityP-vectorT-vectorweak synthesisweighted marked graph

Mathematics Subject Classification ID

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

Related Items (1)

Synthesis of Petri nets with restricted place-environments: classical and parameterized

Cites Work

• Unnamed Item
• Characterisation of the state spaces of marked graph Petri nets
• Structure theory of equal conflict systems
• A new polynomial-time algorithm for linear programming
• A sufficient condition for the liveness of weighted event graphs
• A decidability theorem for a class of vector-addition systems
• The synthesis problem for elementary net systems is NP-complete
• Sufficient conditions for the marked graph realisability of labelled transition systems
• Factorisation of transition systems
• On liveness and deadlockability in subclasses of weighted Petri nets
• Bounded choice-free Petri net synthesis: algorithmic issues
• Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach
• Synthesis and reengineering of persistent systems
• Analysis and synthesis of weighted marked graph Petri nets
• Factorisation of Petri net solvable transition systems
• Generating all minimal Petri net unsolvable binary words
• Synthesis of structurally restricted \(b\)-bounded Petri nets: complexity results
• Marked directed graphs
• Simultaneous Petri Net Synthesis
• On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets
• Free Choice Petri Nets
• Polynomial algorithms for the synthesis of bounded nets
• On the Reversibility of Well-Behaved Weighted Choice-Free Systems
• Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods
• Conditions for Petri Net Solvable Binary Words

This page was built for publication: Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond