Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
From MaRDI portal
Publication:3400552
DOI10.3233/FI-2009-147zbMath1217.68147OpenAlexW1649397713MaRDI QIDQ3400552
Sebastian Mauser, Robin Bergenthum, Robert Lorenz, Jörg Desel
Publication date: 5 February 2010
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2009-147
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Discovering Block-Structured Process Models from Event Logs - A Constructive Approach ⋮ Discovering unseen behaviour from event logs ⋮ Aggregating Causal Runs into Workflow Nets ⋮ Discovering Block-Structured Process Models from Incomplete Event Logs ⋮ Discovering Object-centric Petri Nets
This page was built for publication: Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages