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

DOI10.1017/S0960129508007111MaRDI QIDQ3545273zbMATH OpenOpenAlexFDO

Authors 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

transition systemsoperational semantics

Mathematics Subject Classification ID

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

Recommendations

• CONCUR 2005 – Concurrency Theory
• A Generic Process Algebra
• scientific article; zbMATH DE number 3894457
• Axiomatizations for probabilistic finite-state behaviors
• On “Axiomatising Finite Concurrent Processes”

Cites work

• scientific article; zbMATH DE number 4039251 (Why is no real title available?)
• A Generic Process Algebra
• A Theory of Communicating Sequential Processes
• A complete axiomatisation for observational congruence of finite-state behaviours
• Algebra of communicating processes with abstraction
• Branching time and abstraction in bisimulation semantics
• Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
• Embedding untimed into timed process algebra: the case for explicit termination
• Notes on the methodology of CCS and CSP
• Process algebra for synchronous communication
• Process algebra with propositional signals

Cited in

(11)

• Probabilistic software product lines
• scientific article; zbMATH DE number 177531 (Why is no real title available?)
• Exploring type-level bisimilarity towards more expressive multiparty session types
• Axiomatizing maximal progress and discrete time
• Encoding safety in \(\mathrm{CLL}_R\)
• CONCUR 2005 – Concurrency Theory
• On recursive operations over logic LTS
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
• Team equivalences for finite-state machines with silent moves
• Relating Session Types and Behavioural Contracts: The Asynchronous Case
• A predicate transformer for choreographies. Computing preconditions in choreographic programming

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545273)