On deciding readiness and failure equivalences for processes

DOI10.1006/INCO.1995.1039zbMATH Open0826.68049OpenAlexW1996319313MaRDI QIDQ1892874FDOQ1892874

Authors: Dung T. Huynh, Lu Tian 

Publication date: 6 July 1995

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

Full work available at URL: https://doi.org/10.1006/inco.1995.1039

Recommendations

• On deciding trace equivalences for processes
• Undecidable equivalences for basic process algebra
• CCS expressions, finite state processes, and three problems of equivalence

zbMATH Keywords

Greibach normal formcomplexity of deciding readinessfailure equivalencesnormed context-free grammars

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Grammars and rewriting systems (68Q42)

Cited In (7)

• On the computational complexity of bisimulation, redux
• On the axiomatizability of priority. II
• Undecidable equivalences for basic process algebra
• Infinite results
• CCS expressions, finite state processes, and three problems of equivalence
• Undecidable equivalences for basic parallel processes
• Basic process algebra with deadlocking states

This page was built for publication: On deciding readiness and failure equivalences for processes

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