MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Liveness, Fairness, and Recurrence in Petri Nets

Download:
Download as a PDF
by Ekkart Kindler
http://tmitwww.tm.tue.nl/staff/wvdaalst/Publications/p83.pdf
Add To MetaCart

Abstract:

In Petri net theory, a transition is called live if from every reachable marking there starts a computation in which the transition occurs. Another important property of a transition is the recurrent

Citations

555 Petri Net Theory and the Modeling of Systems – Peterson - 1981
228 Proving the correctness of multiprocess programs – Lamport - 1977
79 Free Choice Petri Nets – Desel, Esparza - 1995
37 Structure theory of petri nets: The free choice hiatus. In: Brauer et al – Best - 1987
29 De liveness – Alpern, Schneider - 1985
19 Nissim Francez, and Shmuel Katz. Appraising fairness in languages for distributed programming – Apt - 1988
15 De ning liveness – Alpern, Schneider - 1985
14 The Application of Petri Nets to Work Management – Aalst - 1998
11 Fairness and Conspiracies – Best - 1984
9 Fairness and hyperfairness – Lamport - 1998
8 A Fresh Look at Free Choice Nets – Thiagarajan, Voss - 1984
7 Some equivalence results for free choice nets and simple nets, and on the periodicity of live free choice nets – Best, Shields - 1987
5 Nissim Francez, and Orna Grumberg. Fairness and hyperfairness in multi-party interactions – Attie - 1993
4 The Application of Petri Nets to Work ow Management – Aalst - 1998
2 Fairness and conspiracies. Information Processing Letters – Best - 1984
1 Jorg Desel. Beyond asymmetric choice: A note on some extensions – Aalst, Kindler
View or Download | Add to My Collection | Correct Errors