Deriving Petri nets from finite transition systems

DOI10.1109/12.707587zbMath1392.68291OpenAlexW2143997593WikidataQ56892931 ScholiaQ56892931MaRDI QIDQ4571475

A. V. Yakovlev, Luciano Lavagno, Jordi Cortadella, Michael Kishinevsky

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/125784

Mathematics Subject Classification ID

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

Related Items (16)

Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues ⋮ Discovering Block-Structured Process Models from Event Logs - A Constructive Approach ⋮ Automated Repair of Process Models Using Non-local Constraints ⋮ On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets ⋮ Generation of synchronizing state machines from a transition system: a region-based approach ⋮ A Symbolic Algorithm for the Synthesis of Bounded Petri Nets ⋮ Process Discovery Using Integer Linear Programming ⋮ Real time identification of discrete event systems using Petri nets ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ A structural approach for the analysis of Petri Nets by reduced unfoldings ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ Discovering Object-centric Petri Nets ⋮ Fault model identification and synthesis in Petri nets ⋮ Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory ⋮ Analysis of safeness in a Petri net-based specification of the control part of cyber-physical systems ⋮ Synthesis of Petri nets with restricted place-environments: classical and parameterized

This page was built for publication: Deriving Petri nets from finite transition systems