Axiomatising divergence

DOI10.1016/j.ic.2005.05.007zbMath1110.68086OpenAlexW2914292476MaRDI QIDQ2581532

Markus Lohrey, Holger Hermanns, Pedro R. D'Argenio

Publication date: 10 January 2006

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.05.007

zbMATH Keywords

Process algebraDivergenceAxiomatisation

Mathematics Subject Classification ID

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

Related Items

A Semantics for Every GSPN ⋮ Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof ⋮ Theory of interaction ⋮ Reactive bisimulation semantics for a process algebra with timeouts ⋮ Unnamed Item ⋮ Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration ⋮ Non-deterministic structures of computation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting nondeterministic computations ⋮ Canonical Solutions to Recursive Equations and Completeness of Equational Axiomatisations. ⋮ The Value-Passing Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• A complete inference system for a class of regular behaviours
• A complete axiomatisation for observational congruence of finite-state behaviours
• A Theory of Communicating Sequential Processes
• Process Algebra
• Termination, deadlock, and divergence
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Axiomatising divergence