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

DOI10.1017/S0960129508007111zbMATH Open1158.68028OpenAlexW2134200739MaRDI QIDQ3545273FDOQ3545273

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

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”

zbMATH Keywords

transition systemsoperational semantics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (11)

• Title not available (Why is that?)
• Probabilistic software product lines
• Title not available (Why is that?)
• CONCUR 2005 – Concurrency Theory
• On recursive operations over logic LTS
• Encoding safety in \(\mathrm{CLL}_R\)
• Team equivalences for finite-state machines with silent moves
• Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)
• Relating Session Types and Behavioural Contracts: The Asynchronous Case
• A predicate transformer for choreographies. Computing preconditions in choreographic programming
• Exploring Type-Level Bisimilarity towards More Expressive Multiparty Session Types

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)