Hiding resources that can fail: An axiomatic perspective

DOI10.1016/S0020-0190(01)00212-5zbMath1003.68089OpenAlexW1976699413MaRDI QIDQ1607106

Rance Cleaveland, Scott A. Smolka, Anna Philippou, Oleg Sokolsky, Insup Lee

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00212-5

zbMATH Keywords

bisimulationPACSRPACSR-lite

Mathematics Subject Classification ID

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 (1)

Hiding resources that can fail: An axiomatic perspective

Cites Work

• Unnamed Item
• A calculus of communicating systems
• A complete axiomatisation for observational congruence of finite-state behaviours
• Processes with probabilities, priority and time
• A complete axiomatization of finite-state ACSR processes
• Hiding resources that can fail: An axiomatic perspective
• Axiomatizing probabilistic processes: ACP with generative probabilities

This page was built for publication: Hiding resources that can fail: An axiomatic perspective