On deciding some equivalences for concurrent processes

DOI10.1051/ITA/1994280100511MaRDI QIDQ4362275zbMATH OpenOpenAlexFDO

Authors Dung T. Huynh, Lu Tian

Publication date 28 October 1997

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92469

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A note on the complexity of deciding bisimilarity of normed unary processes
• A short proof of the decidability of bisimulation for normed BPA- processes
• A Theory of Communicating Sequential Processes
• Actions speak louder than words: proving bisimilarity for context-free processes
• Bisimulation through probabilistic testing
• CCS expressions, finite state processes, and three problems of equivalence
• Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
• Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
• Graphes canoniques de graphes algébriques
• scientific article; zbMATH DE number 4035115 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 149518 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Nondeterministic Space is Closed under Complementation
• On deciding trace equivalences for processes
• On tape-bounded complexity classes and multihead finite automata
• Readies and Failures in the Algebra of Communicating Processes
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• Refusal testing
• Specification-oriented semantics for communicating processes
• Structured operational semantics and bisimulation as a congruence
• Testing equivalences for processes
• The inclusion problem for simple languages
• The method of forced enumeration for nondeterministic automata
• The parallel complexity of coarsest set partition problems
• The polynomial-time hierarchy
• Three Partition Refinement Algorithms
• Undecidable equivalences for basic process algebra

Cited in

(2)

• Decidability results in automata and process theory
• Deciding bisimulation and trace equivalences for systems with many identical processes

This page was built for publication: On deciding some equivalences for concurrent processes

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