Weak confluence and -inertness

DOI10.1016/S0304-3975(99)00084-5MaRDI QIDQ1575263zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 557977 (Why is no real title available?)
• scientific article; zbMATH DE number 821282 (Why is no real title available?)
• A calculus of communicating systems
• 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)