Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration

DOI10.1016/j.entcs.2008.04.053zbMath1286.68348OpenAlexW2107198667MaRDI QIDQ5415608

Taolue Chen, Jian Lu

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.04.053

zbMATH Keywords

process algebradivergencebisimulationconcurrencyprefix iterationaxiomtization

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete inference system for a class of regular behaviours
• A complete equational axiomatization for prefix iteration
• Nonaxiomatisability of equivalences over finite state processes
• Axiomatizing prefix iteration with silent steps
• Axiomatising divergence
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration