Proving correctness of distributed algorithms using high-level Petri nets-a case study
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A temporal proof methodology for reactive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- How distributed algorithms play the token gamePublished by Springer Nature ,1997
- Message passing mutexPublished by Springer Nature ,1995
- The Temporal Logic of Reactive and Concurrent SystemsPublished by Springer Nature ,1992
- Appraising fairness in languages for distributed programmingDistributed Computing, 1988
- RechensystemePublished by Springer Nature ,1987
- FairnessPublished by Springer Nature ,1986
- Defining livenessInformation Processing Letters, 1985
- Formal verification of parallel programsCommunications of the ACM, 1976
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967