On deciding some equivalences for concurrent processes
From MaRDI portal
Publication:4362275
DOI10.1051/ita/1994280100511zbMath1004.68521OpenAlexW1564519684MaRDI QIDQ4362275
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refusal testing
- CCS expressions, finite state processes, and three problems of equivalence
- Specification-oriented semantics for communicating processes
- Determinacy \(\to\) (observation equivalence \(=\) trace equivalence)
- The method of forced enumeration for nondeterministic automata
- Bisimulation through probabilistic testing
- The parallel complexity of coarsest set partition problems
- A short proof of the decidability of bisimulation for normed BPA- processes
- Structured operational semantics and bisimulation as a congruence
- On tape-bounded complexity classes and multihead finite automata
- The inclusion problem for simple languages
- The polynomial-time hierarchy
- On deciding trace equivalences for processes
- Deciding bisimilarity of normed context-free processes is in \(\Sigma_ 2^ p\)
- A note on the complexity of deciding bisimilarity of normed unary processes
- Undecidable equivalences for basic process algebra
- Testing equivalences for processes
- Graphes canoniques de graphes algébriques
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
- A Theory of Communicating Sequential Processes
- Three Partition Refinement Algorithms
- Nondeterministic Space is Closed under Complementation
- Readies and Failures in the Algebra of Communicating Processes
- Actions speak louder than words: proving bisimilarity for context-free processes
