Synthesis of Petri nets from finite partial languages
From MaRDI portal
Recommendations
Cited in
(34)- Discovering workflow nets using integer linear programming
- Over-approximative Petri net synthesis for restricted subclasses of nets
- The synthesis of Petri nets from path-automatic specifications
- The synthesis problem of Petri nets
- Discovering process models with long-term dependencies while providing guarantees and handling infrequent behavior
- Transformation of Petri nets into context-dependent fusion grammars
- Fault model identification and synthesis in Petri nets
- Identification of Petri nets from knowledge of their language
- MSO logic and the partial order semantics of place/transition-nets
- Petri Net Synthesis for Restricted Classes of Nets
- Modular synthesis of timed circuits using partial orders on LPNs
- Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
- Partial Order Semantics of Types of Nets
- Towards Synthesis of Petri Nets from Scenarios
- Construction of Process Models from Example Runs
- Unifying Petri Net Semantics with Token Flows
- Oclets – Scenario-Based Modeling with Petri Nets
- Comparison of different algorithms to synthesize a Petri net from a partial language
- scientific article; zbMATH DE number 4024816 (Why is no real title available?)
- Projection approaches to process mining using region-based techniques
- On the Analysis of Petri Nets and their Synthesis from Process Languages
- scientific article; zbMATH DE number 1836392 (Why is no real title available?)
- Aggregating causal runs into workflow nets
- Models from scenarios
- Discovering object-centric Petri nets
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- Automated repair of process models with non-local constraints using state-based region theory
- Automated repair of process models using non-local constraints
- Modular synthesis of Petri nets from regular languages
- Hasse diagram generators and Petri nets
- Hasse Diagram Generators and Petri Nets
- Finding Complex Process-Structures by Exploiting the Token-Game
- Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns
- Strategies for minimising the synthesised ENL-systems
This page was built for publication: Synthesis of Petri nets from finite partial languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602749)
