Linked e-resources
Details
Table of Contents
Keynotes
Topics in Region Theory and Synthesis Problems
Flat Petri Nets
Application of Concurrency to System Design
Cost and Quality in Crowdsourcing Workflows
Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design
A Turn-Based Approach for Qualitative Time Concurrent Games
Games
Canonical Representations for Direct Generation of Strategies in High-level Petri Games
Automatic Synthesis of Transiently Correct Network Updates via Petri Games
Verification
Computing Parameterized Invariants of Parameterized Petri Nets
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets
Skeleton Abstraction for Universal Temporal Properties
Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets
Model Checking of Synchronized Domain-Specific Multi-Formalism Models Using High-Level Petri Nets
Synthesis and Mining
Edge and event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
Synthesis of (Choice-Free) Reset Nets
Synthesis of Petri Nets with restricted place-environments: classical and parameterized
Discovering Stochastic Process Models By Reduction and Abstraction
Reachability and Partial Order
Efficient Algorithms for Three Reachability Problems in Safe Petri Nets
A Lazy Query Scheme for Reachability Analysis in Petri nets
Abstraction-based Incremental Inductive Coverability for Petri nets
Firing Partial Orders in a Petri Net
Semantics
Deterministic concurrent systems
Deciphering the Co-car Anomaly of Circular Traffic Queues using Petri Nets
Tools
Cortado
An Interactive Tool for Data-Driven Process Discovery and Modeling
PROVED: A Tool for Graph Representation and Analysis of Uncertain Event Data.
Topics in Region Theory and Synthesis Problems
Flat Petri Nets
Application of Concurrency to System Design
Cost and Quality in Crowdsourcing Workflows
Timed Petri Nets with Reset for Pipelined Synchronous Circuit Design
A Turn-Based Approach for Qualitative Time Concurrent Games
Games
Canonical Representations for Direct Generation of Strategies in High-level Petri Games
Automatic Synthesis of Transiently Correct Network Updates via Petri Games
Verification
Computing Parameterized Invariants of Parameterized Petri Nets
On the Combination of Polyhedral Abstraction and SMT-based Model Checking for Petri nets
Skeleton Abstraction for Universal Temporal Properties
Reduction Using Induced Subnets To Systematically Prove Properties For Free-Choice Nets
Model Checking of Synchronized Domain-Specific Multi-Formalism Models Using High-Level Petri Nets
Synthesis and Mining
Edge and event and state removal: the complexity of some basic techniques that make transition systems Petri net implementable
Synthesis of (Choice-Free) Reset Nets
Synthesis of Petri Nets with restricted place-environments: classical and parameterized
Discovering Stochastic Process Models By Reduction and Abstraction
Reachability and Partial Order
Efficient Algorithms for Three Reachability Problems in Safe Petri Nets
A Lazy Query Scheme for Reachability Analysis in Petri nets
Abstraction-based Incremental Inductive Coverability for Petri nets
Firing Partial Orders in a Petri Net
Semantics
Deterministic concurrent systems
Deciphering the Co-car Anomaly of Circular Traffic Queues using Petri Nets
Tools
Cortado
An Interactive Tool for Data-Driven Process Discovery and Modeling
PROVED: A Tool for Graph Representation and Analysis of Uncertain Event Data.