@article{ITA_1994__28_1_51_0,
author = {Huynh, Dung T. and Tian, Lu},
title = {On deciding some equivalences for concurrent processes},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
pages = {51--71},
year = {1994},
publisher = {EDP Sciences},
volume = {28},
number = {1},
mrnumber = {1271126},
zbl = {1004.68521},
language = {en},
url = {https://www.numdam.org/item/ITA_1994__28_1_51_0/}
}
TY - JOUR AU - Huynh, Dung T. AU - Tian, Lu TI - On deciding some equivalences for concurrent processes JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1994 SP - 51 EP - 71 VL - 28 IS - 1 PB - EDP Sciences UR - https://www.numdam.org/item/ITA_1994__28_1_51_0/ LA - en ID - ITA_1994__28_1_51_0 ER -
%0 Journal Article %A Huynh, Dung T. %A Tian, Lu %T On deciding some equivalences for concurrent processes %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1994 %P 51-71 %V 28 %N 1 %I EDP Sciences %U https://www.numdam.org/item/ITA_1994__28_1_51_0/ %G en %F ITA_1994__28_1_51_0
Huynh, Dung T.; Tian, Lu. On deciding some equivalences for concurrent processes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 1, pp. 51-71. https://www.numdam.org/item/ITA_1994__28_1_51_0/
1. , , and , Parallel Complexity in the Design and Analysis of Concurrent Systems, Lecture Notes in Computer Science, 1991, 505, pp. 288-303. | MR
2. , and , Decidability of Bisimulation Equivalence for Process Generating Context-Free Languages, Lecture Notes in Computer Science, 1987, 259, pp. 94-113. | Zbl | MR
3. , and , Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator, Computer Journal, 1987, 30, pp. 498-506. | Zbl | MR
4. , and , A Theory of Communicating Sequential Processes, J. Assoc. Comput. Mach., 1984, 31, pp. 560-599. | Zbl | MR
5. , and , Bisimulation Can't Be Traced, Proc. of the 15th ACM Symp. on Principles of Programming Languages, 1988, pp. 229-239.
6. , and , Readies and Failures in the Algebra of Communicating Processes, SIAM J. on Computing, 1988, 17, pp. 1134-1177. | Zbl | MR
7. , Graphes Canoniques de Graphes Algébriques, Theoretical Informatics and Application, 1990, 24, pp. 339-352. | Zbl | MR | Numdam
8. and , The Parallel Complexity of Coarset Set Partition Problems, Information Processing Letters, 1992, 42, pp. 89-94. | Zbl | MR
9. , Determinacy → (Observation Equivalence = Trace Equivalence), Theoretical Computer Science, 1985, 36, pp. 21-25. | Zbl | MR
10. , The Inclusion Problem for Simple Languages, Theoretical Computer Science, 1976, 1, pp. 297-316. | Zbl | MR
11. and , Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979. | Zbl | MR
12. , The Linear Time - Branching Time Spectrum, Lecture Notes in Computer Science, 1990, 458, pp. 278-297.
13. , A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes, Technical Report CS-R9151, CWI, 1991, to appear in Information Processing Letters. | Zbl | MR
14. and , Undecidable Equivalences for Basic Process Algebra, Technical Report CS-R9137, CWI, 1991.
15. and , Structured Operational Semantics and Bisimulation as a Congruence, Lecture Notes in Computer Science, 1989, 372, pp. 423-438 (to appear in Information and Computation). | Zbl
16. , Introduction to Formal Language Theory, Addison-Wesley, 1978. | Zbl | MR
17. and , Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes, Proc. 6th Annual Symp. on Logic in Computer Science, 1991, pp. 376-386.
18. and , Complexity of Deciding Readiness and Failure Equivalences for Processes, Proc. of the 3rd IEEE Symp. on Parallel and Distributed Processing, 1991, pp. 738-745.
19. and , On Deciding Trace Equivalences for Processes, Technical Report UTDCS-4-91, University of Texas at Dallas, 1991, to appear in Information Sciences. | Zbl | MR
20. and , On Some Equivalence Relations for Probabilistic Processes, Fundamenta Informaticae, 1992, 17, pp. 211-234. | Zbl | MR
21. and , Deciding Bisimilarity of Normed Context-Free Processes Is in ∑P2. Technical Report UTDCS-1-92, University of Texas at Dallas, 1992, to appear in Theoretical Computer Science. | Zbl
22. and , A Note on Complexity of Deciding Bisimilarity of Normed Unary Processes, Technical Report UTDCS-2-92, University of Texas at Dallas, 1992.
23. and , Formal Languages and Their Relation to Automata, Addison-Wesley Publishing Co., 1969. | Zbl | MR
24. and , Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Co., 1979. | Zbl | MR
25. , Nondeterministic Space is Closed under Complement, SIAM J. on Computing, 1988, 17, pp. 935-938. | Zbl | MR
26. and , Bisimulation through Probabilistic Testing, Information and Computation, 1991, 94, pp. 1-28. | Zbl | MR
27. and , CCS Expressions, Finite State Processes and Three Problems of Equivalence, Information and Computation, 1990, 86, pp. 43-68. | Zbl | MR
28. , Communication and Concurrency, Prentice-Hall, 1989. | Zbl
29. and , Testing Equivalences for Processes, Theoretical Computer Science, 1984, 34, pp.83-133. | Zbl | MR
30. and , Specification-Oriented Semantics for Communicating Processes, Acta Informatica, 1986, 23, pp. 9-66. | Zbl | MR
31. , Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science, 1981, 104, pp. 168-183. | Zbl
32. , Refusal Testing, Theoretical Computer Science, 1987, 50, pp. 241-284. | Zbl | MR
33. and , Three Partition Refinement Algorithm, SIAM J. on Computing, 1987, 16, pp. 937-989. | Zbl | MR
34. and , Possible Futures, Acceptances, Refusals and Communicating Processes, Proc. 22-nd Annual Symp. on Foundations of Computer science, 1981, pp. 140-149.
35. , The Polynomial Time Hierarchy, 1977, 3, pp. 1-22. | Zbl | MR
36. , On Tape-Bounded Complexity Classes and Multi-Head Finite Automata, Comput. Syst. Sci., 1975, 10, pp.62-76. | Zbl | MR
37. , The Method of Forced Enumeration for Nondeterministic Automata, Acta Information, 1988, 29, pp. 279-284. | Zbl | MR
