scientific article; zbMATH DE number 6774207

DOI10.4230/LIPIcs.CONCUR.2015.128zbMath1374.68319MaRDI QIDQ5357699

Eike Best, Raymond Devillers

Publication date: 12 September 2017

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

persistencePetri netslabelled transition systemssystem synthesischoice-freeness

Mathematics Subject Classification ID

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

Related Items (8)

Factorisation of transition systems ⋮ Parameterized Complexity of Synthesizing b-Bounded (m, n)-T-Systems ⋮ Characterisation of the state spaces of marked graph Petri nets ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Characterising Petri Net Solvable Binary Words ⋮ The Power of Prime Cycles ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Conditions for Petri Net Solvable Binary Words

This page was built for publication: