Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach

DOI10.1007/978-3-662-60651-3_7zbMath1464.68237arXiv1911.00474OpenAlexW2998051948MaRDI QIDQ2032916

Thomas Hujsa, Raymond Devillers, Evgeny Erofeev

Publication date: 14 June 2021

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

zbMATH Keywords

synthesiscycleslabelled transition systemgeometric interpretationtheory of regionscyclic wordsmarked graphweighted Petri netcircular solvability

Mathematics Subject Classification ID

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

Related Items (3)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

This page was built for publication: Synthesis of weighted marked graphs from constrained labelled transition systems: a geometric approach