CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452MaRDI QIDQ5897487zbMATH OpenOpenAlexFDO

Authors Jos C. M. Baeten, Mario Bravetti

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

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

Recommendations

• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• Axiomatizations for probabilistic finite-state behaviors
• Foundations of Software Science and Computational Structures
• A Generic Process Algebra
• Nonaxiomatisability of equivalences over finite state processes

Cited in

(13)

• Branching bisimulation congruence for probabilistic systems
• A ground-complete axiomatisation of finite-state processes in a generic process algebra
• On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
• A basic parallel process as a parallel pushdown automaton
• Duplication of constants in process algebra
• A Generic Process Algebra
• scientific article; zbMATH DE number 177531 (Why is no real title available?)
• Algebraic meta-theory of processes with data
• Axiomatizing maximal progress and discrete time
• Product line process theory
• A Context-Free Process as a Pushdown Automaton
• scientific article; zbMATH DE number 7080198 (Why is no real title available?)
• Extensions of standard weak bisimulation machinery: finite-state general processes, refinable actions, maximal-progress and time

This page was built for publication: CONCUR 2005 – Concurrency Theory

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