A state-based approach to communicating processes

DOI10.1007/BF01788563zbMath0659.68046MaRDI QIDQ1112600

Mark B. Josephs

Publication date: 1988

Published in: Distributed Computing (Search for Journal in Brave)

zbMATH Keywords

simulationrefinementstate-transition systemsCommunicating processesfailures model

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (14)

Verifying data refinements using a model checker ⋮ On using data abstractions for model checking refinements ⋮ Incompleteness of relational simulations in the blocking paradigm ⋮ External and internal choice with event groups in Event-B ⋮ On hierarchically developing reactive systems ⋮ Of wlp and CSP ⋮ Simulation refinement for concurrency verification ⋮ Model transformations across views ⋮ Modelling Divergence in Relational Concurrent Refinement ⋮ Refinement and state machine abstraction ⋮ Relational concurrent refinement. III: Traces, partial relations and automata ⋮ Action systems, unbounded nondeterminism, and infinite traces ⋮ Model checking action system refinements ⋮ Relational concurrent refinement. II: Internal operations and outputs

Cites Work

• Specification-oriented semantics for communicating processes
• A calculus of communicating systems
• A Theory of Communicating Sequential Processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A state-based approach to communicating processes