Weak confluence and \(\tau\)-inertness

DOI10.1016/S0304-3975(99)00084-5zbMath0944.68137OpenAlexW2079671561MaRDI QIDQ1575263

N. Delaunay

Publication date: 21 August 2000

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00084-5

zbMATH Keywords

confluencetransition systemsweak bisimulationbranching bisimulationinertness

Mathematics Subject Classification ID

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

Related Items (4)

Cartesian difference categories ⋮ Sequential and distributed on-the-fly computation of weak tau-confluence ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Recursive equations in higher-order process calculi

Cites Work

• Confluence for process verification
• A calculus of communicating systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak confluence and \(\tau\)-inertness