scientific article; zbMATH DE number 1305001
From MaRDI portal
Publication:4251924
zbMath0940.68097MaRDI QIDQ4251924
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
The synthesis of Petri nets from path-automatic specifications ⋮ Discovering workflow nets using integer linear programming ⋮ Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior ⋮ Finding Complex Process-Structures by Exploiting the Token-Game ⋮ Process Discovery Using Integer Linear Programming ⋮ Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns ⋮ Process Model Discovery: A Method Based on Transition System Decomposition ⋮ On the Petri net realization of context-free graphs ⋮ Regions of Petri nets with a/sync connections ⋮ Applying regions ⋮ Petri Net Synthesis for Restricted Classes of Nets ⋮ Hasse Diagram Generators and Petri Nets ⋮ On the Analysis of Petri Nets and their Synthesis from Process Languages
