A ground-complete axiomatisation of finite-state processes in a generic process algebra

DOI10.1017/S0960129508007111zbMath1158.68028OpenAlexW2134200739MaRDI QIDQ3545273

Mario Bravetti, Jos C. M. Baeten

Publication date: 10 December 2008

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129508007111

zbMATH Keywords

operational semanticstransition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (8)

Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types ⋮ Unnamed Item ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ A predicate transformer for choreographies. Computing preconditions in choreographic programming ⋮ Team equivalences for finite-state machines with silent moves ⋮ On recursive operations over logic LTS ⋮ Encoding safety in \(\mathrm{CLL}_R\) ⋮ Probabilistic software product lines

Cites Work

• Unnamed Item
• Algebra of communicating processes with abstraction
• A complete axiomatisation for observational congruence of finite-state behaviours
• Notes on the methodology of CCS and CSP
• Process algebra with propositional signals
• Process algebra for synchronous communication
• A Theory of Communicating Sequential Processes
• Branching time and abstraction in bisimulation semantics
• Embedding untimed into timed process algebra: the case for explicit termination
• A Generic Process Algebra
• Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement

This page was built for publication: A ground-complete axiomatisation of finite-state processes in a generic process algebra