scientific article; zbMATH DE number 762060
From MaRDI portal
Publication:4835904
Recommendations
- On reachability graphs of Petri nets
- A note on the reachability set of Petri nets
- Reachability determination in acyclic Petri nets by cell enumeration approach
- On the reachability and reversibility problems in a class of Petri nets
- Remarks on the Reachability Graphs of Petri Nets
- Structuring acyclic Petri nets for reachability analysis and control
- On persistent reachability in Petri nets
- Reachability in Petri nets with inhibitor arcs
- On reachability in autonomous continuous Petri net systems
- A sufficient condition for reachability in a general Petri net
Cited in
(18)- Normal Petri nets
- Reachability in live and safe free-choice Petri nets is NP-complete
- A structure to decide reachability in Petri nets
- On persistent reachability in Petri nets
- On complexity of reachability of transition restricted Petri nets
- Anti-alignments in conformance checking -- the dark side of process models
- Petri nets with simple circuits
- scientific article; zbMATH DE number 4215383 (Why is no real title available?)
- Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
- scientific article; zbMATH DE number 1232238 (Why is no real title available?)
- scientific article; zbMATH DE number 6845563 (Why is no real title available?)
- Analyzing Reachability for Some Petri Nets With Fast Growing Markings
- On the reachability and reversibility problems in a class of Petri nets
- Structuring acyclic Petri nets for reachability analysis and control
- Generalized Alignment-Based Trace Clustering of Process Behavior
- Reachability determination in acyclic Petri nets by cell enumeration approach
- Reachability in cyclic extended free-choice systems
- A sufficient condition for reachability in a general Petri net
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835904)
