Weak confluence and -inertness

DOI10.1016/S0304-3975(99)00084-5zbMATH Open0944.68137OpenAlexW2079671561MaRDI QIDQ1575263FDOQ1575263

Authors: 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

transition systemsconfluenceweak bisimulationbranching bisimulationinertness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of communicating systems
• Title not available (Why is that?)
• Confluence for process verification

Cited In (5)

• 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
• Computer Aided Verification
• Cartesian difference categories

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

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