On deciding readiness and failure equivalences for processes

DOI10.1006/inco.1995.1039zbMath0826.68049OpenAlexW1996319313MaRDI QIDQ1892874

Dung T. Huynh, L. 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

zbMATH Keywords

Greibach normal formcomplexity of deciding readinessfailure equivalencesnormed context-free grammars

Mathematics Subject Classification ID

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

Related Items

Undecidable equivalences for basic parallel processes, Infinite results, On the axiomatizability of priority. II, On the computational complexity of bisimulation, redux, Basic process algebra with deadlocking states