Searching for "Petri Nets With Persistence." – sorted by Relevance.
9 documents found, showing 1 through 9.
-
Flat counter automata almost everywhere
- … bounded counter machines, lossy vector addition systems with states, reversible Petri nets, persistent…
- Cited by 3 (1 self) – Add To MetaCart
-
Completeness Results for Single-Path Petri Nets
- … was under review. 1 Abstract We define a new subclass of persistent Petri nets called single-path Petri…
- Cited by 3 (0 self) – Add To MetaCart
-
Token Ring Arbiters: An Exercise in Asynchronous Logic Design with Petri Nets
- … net is safe if all reachable markings in the net are safe. A Petri net is persistent with respect to a…
- Cited by 7 (5 self) – Add To MetaCart
-
Decidability Issues for Petri Nets - a survey
- … reference is given). A Petri net (N; M 0 ) is: ffl persistent if for any two different transitions t 1…
- Cited by 62 (5 self) – Add To MetaCart
-
Decidability Issues for Petri Nets
- …. Persistence The persistence problem (to decide if a given Petri net is persistent) was shown to be decidable…
- Cited by 12 (0 self) – Add To MetaCart
-
Graphical descriptions of security protocols
- …. Alternatively one could relate the traditional SPL runs, obtained from Petri nets with persistence (where…
- Cited by 1 (0 self) – Add To MetaCart
-
A Petri net approach to fault detection and diagnosis in distributed systems
- … and transitions of Petri nets. Persistent faults, spontaneous faults occurrence and reabsorption are also…
- Cited by 5 (4 self) – Add To MetaCart
-
Fault Detection in Telecommunication Networks Based on a Petri Net Representation of Alarm
- … and transitions of Petri nets. Persistent faults, spontaneous faults occurrence and reabsorption are also…
- Cited by 2 (1 self) – Add To MetaCart
-
Checking Signal Transition Graph Implementability by Symbolic BDD Traversal
- …. This is guaranteed by boundedness of the underlying Petri net. APN (STG) is called k-bounded if for every reachable…
- Add To MetaCart
Showing 1 through 9.
