A Logical Process Calculus

DOI10.1016/S1571-0661(05)80362-7zbMath1270.68210MaRDI QIDQ2842601

Gerald Lüttgen, Ranee Cleaveland

Publication date: 15 August 2013

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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (4)

Conjunction on processes: Full abstraction via ready-tree semantics ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ A semantic framework for open processes ⋮ On recursive operations over logic LTS

Cites Work

• Modal logics for communicating systems
• The expressive power of implicit specifications
• Trace, failure and testing equivalences for communicating processes
• A fixpoint approach to finite delay and fairness
• Characteristic formulae for processes with divergence
• Testing equivalences for processes
• Compositional failure-based semantic models for basic LOTOS
• A logic for the description of non-deterministic programs and their properties
• Algebraic laws for nondeterminism and concurrency
• Three logics for branching bisimulation
• Divergence and fair testing
• 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: A Logical Process Calculus