The equivalence in the DCP model

DOI10.1016/S0304-3975(06)80006-XzbMath0737.68031OpenAlexW4210467904MaRDI QIDQ1177152

Reine Fournier, Gregor von Bochmann

Publication date: 26 June 1992

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(06)80006-x

zbMATH Keywords

partial orderCSPCCSalgebraic theories of processesDCPdeadlock in DCPequivalence on processeslabelled transitions systems

Mathematics Subject Classification ID

Partial orders, general (06A06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (1)

On the operational semantics of nondeterminism and divergence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• Extensional equivalences for transition systems
• A calculus of communicating systems
• A calculus of total correctness for communicating processes
• Testing equivalences for processes
• A lattice-theoretical fixpoint theorem and its applications
• CIRCAL and the representation of communication, concurrency, and time
• Automated Analysis of Discrete Communication Behavior
• A Theory of Communicating Sequential Processes
• Algebraic laws for nondeterminism and concurrency
• Acceptance trees
• Communicating sequential processes

This page was built for publication: The equivalence in the DCP model