Trapping mutual exclusion in the box calculus

DOI10.1016/0304-3975(95)00119-0zbMath0872.68133OpenAlexW2069672317WikidataQ127807765 ScholiaQ127807765MaRDI QIDQ672869

Javier Esparza, Glenn Bruns

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00119-0

zbMATH Keywords

verificationprocess algebrabox calculusmutual exclusion algorithmsPetri net semanticstranslation of parallel programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Mutex needs fairness ⋮ Modelling mutual exclusion in a process algebra with time-outs ⋮ Unnamed Item ⋮ The Mutex Paradigm of Concurrency ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions

Cites Work

• Automated analysis of mutual exclusion algorithms using CCS
• A distributed operational semantics of CCS based on condition/event systems
• Local model checking in the modal mu-calculus
• Structure matrices for Petri nets and their applications
• Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
• Advances in Petri nets 1992
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trapping mutual exclusion in the box calculus