Liveness, fairness, and recurrence in Petri nets

Information Processing Letters

Volumn 70, Issue 6, 1999, Pages 269-274

  Kindler, Ekkart ^a   Van der Aalst, Wil ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; PROGRAMMING THEORY;

CONCURRENCY; WORKFLOW PROCESS;

PETRI NETS;

EID: 0033617729     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00074-5     Document Type: Article

References (15)

1. W. van der Aalst, The application of Petri nets to workflow management, J. Circuits Systems Comput. 8 (1) (1998) 21-66.
2. W. van der Aalst, E. Kindler, J. Desel, Beyond asymmetric choice: A note on some extensions, Petri Net Newslett. 55 (1998) 3-13.
3. PC. Attie, N. Francez, O. Grumberg, Fairness and hyperfairness in multi-party interactions, Distrib. Comput. 6 (1993) 245-254.
4. K.R. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distrib. Comput. 2 (1988) 226-241.
5. B. Alpern, F.B. Schneider, Defining liveness, Inform. Process. Lett. 21 (1985) 181-185.
6. E. Best, Fairness and conspiracies, Inform. Process. Lett. 18 (1984) 215-220; Erratum, Inform. Process. Lett. 19 (1984) 162.
7. E. Best, Structure theory of Petri nets: The free choice hiatus, in: W. Brauer, W. Reisig, G. Rozenberg (Eds.), Petri Nets: Central Models and Their Properties, Lecture Notes in Computer Sci. 254, Springer, Berlin, 1987, pp. 168-205.
8. E. Best, M.W. Shields, Some equivalence results for free choice nets and simple nets, and on the periodicity of live free choice nets, in: G. Ausiello, M. Protasi (Eds.), Proc. CAAP '83, Lecture Notes in Computer Sci. 159, Springer, Berlin, 1983, pp. 141-154.
9. H. Carstensen, Fairness criteria that guarantee infinite firing of transitions, Technical Report IFI-HH-M-109/83, Fachbereich Informatik, Universität Hamburg, July 1983.
10. H. Carstensen, Fairneß bei nebenläufigen systemen, Technical Report FBI-HH-B-126/87, Fachbereich Informatik, Universität Hamburg, February 1987.
11. J. Desel, J. Esparza, Free Choice Petri Nets, Cambridge University Press, Cambridge, 1995.
12. L. Lamport, Proving the correctness of multiprocess programs, IEEE Trans. Software Engineering SE-3 (2) (1977) 125-143.
13. L. Lamport, Fairness and hyperfairness, SRC Research Report 152, Digital, Systems Research Center, March 1998.
14. A. Pnueli, L. Zuck, Verification of multiprocess probabilistic protocols, Distrib. Comput. 1 (1986) 53-72.
15. P.S. Thiagarajan, K. Voss, A fresh look at free choice nets, Inform. and Control 61 (2) (1984) 85-113.