Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
From MaRDI portal
Publication:3400552
Recommendations
- Synthesis of Petri nets from finite partial languages
- scientific article; zbMATH DE number 4098730
- scientific article; zbMATH DE number 4024803
- scientific article; zbMATH DE number 1305001
- On an infinite hierarchy of Petri net languages
- Comparison of different algorithms to synthesize a Petri net from a partial language
- Modular synthesis of Petri nets from regular languages
- scientific article; zbMATH DE number 4074503
- On the Analysis of Petri Nets and their Synthesis from Process Languages
- The synthesis of Petri nets from path-automatic specifications
Cited in
(12)
- Aggregating causal runs into workflow nets
- Discovering object-centric Petri nets
- Models from scenarios
- Modular synthesis of Petri nets from regular languages
- Discovering block-structured process models from event logs -- a constructive approach
- \(\omega\)-process languages for place/transition nets.
- Synthesis of Petri nets from finite partial languages
- Hasse diagram generators and Petri nets
- Discovering Block-Structured Process Models from Incomplete Event Logs
- Comparison of different algorithms to synthesize a Petri net from a partial language
- Hasse Diagram Generators and Petri Nets
- Discovering unseen behaviour from event logs
This page was built for publication: Synthesis of Petri Nets from Term Based Representations of Infinite Partial Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400552)