A state-based approach to communicating processes
type: Item
instance of: scholarly article
title: A state-based approach to communicating processes
zbMATH Open document ID: 0659.68046
DOI: 10.1007/BF01788563
author: Mark B. Josephs
published in: Distributed Computing
publication date: 1988-01-01T00:00:00Z
review text: Communicating processes, which may exhibit nondeterministic behaviour, are specified as state-transition systems. Equivalence and refinement relations are defined in terms of the failures model of processes. Downward and upward simulation are considered as proof methods for refinement. Various operators on processes are defined and their refinement rules established.
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 4078785
zbMATH Keywords: Communicating processes
zbMATH Keywords: state-transition systems
zbMATH Keywords: refinement
zbMATH Keywords: failures model
zbMATH Keywords: simulation
MaRDI profile type: Publication
cites work: A Theory of Communicating Sequential Processes
cites work: Q3777424
cites work: Q3707340
cites work: A calculus of communicating systems
cites work: Q3750113
cites work: Specification-oriented semantics for communicating processes
cites work: Q3907077
Recommended article: Q3123380
Recommended article: A Theory of Communicating Sequential Processes
Recommended article: Communicating State Transition Systems for Fine-Grained Concurrent Resources
Recommended article: Q3700806
Recommended article: Specification-oriented semantics for communicating processes
Recommended article: Communicating Sequential Processes
Recommended article: Q3777424
description: scientific article; zbMATH DE number 4078785