Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 28, Number 1, 1994
Page(s) 51 - 71
DOI https://doi.org/10.1051/ita/1994280100511
Published online 01 February 2017
  1. 1. C. ALVAREZ, J. L. BALCÁZAR, J. GABARRÓ and M. SANTHA, Parallel Complexity in the Design and Analysis of Concurrent Systems, Lecture Notes in Computer Science, 1991, 505, pp. 288-303. [MR: 1121745]
  2. 2. J. C. M. BAETEN, J. A. BERGSTRA and J. W. KLOP, Decidability of Bisimulation Equivalence for Process Generating Context-Free Languages, Lecture Notes in Computer Science, 1987, 259, pp. 94-113. [MR: 910305] [Zbl: 0635.68014]
  3. 3. J. C. M. BAETEN, J. A. BERGSTRA and J. M. KLOP, Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator, Computer Journal, 1987, 30, pp. 498-506. [MR: 920065] [Zbl: 0627.68016]
  4. 4. S. D. BROOKES, C. A. R. HOARE and A. W. ROSCOE, A Theory of Communicating Sequential Processes, J. Assoc. Comput. Mach., 1984, 31, pp. 560-599. [MR: 819158] [Zbl: 0628.68025]
  5. 5. B. BLOOM, S. ISTRAIL and A. R. MEYER, Bisimulation Can't Be Traced, Proc. of the 15th ACM Symp. on Principles of Programming Languages, 1988, pp. 229-239.
  6. 6. J. A. BERGSTRA, J. W. KLOP and E. R. OLDEROG, Readies and Failures in the Algebra of Communicating Processes, SIAM J. on Computing, 1988, 17, pp. 1134-1177. [MR: 972666] [Zbl: 0677.68089]
  7. 7. D. CAUCAL, Graphes Canoniques de Graphes Algébriques, Theoretical Informatics and Application, 1990, 24, pp. 339-352. [EuDML: 92362] [MR: 1079719] [Zbl: 0701.68082]
  8. 8. S. CHO and D. T. HUYNH, The Parallel Complexity of Coarset Set Partition Problems, Information Processing Letters, 1992, 42, pp. 89-94. [MR: 1170873] [Zbl: 0780.68056]
  9. 9. J. ENGELFRIET, Determinacy → (Observation Equivalence = Trace Equivalence), Theoretical Computer Science, 1985, 36, pp. 21-25. [MR: 792638] [Zbl: 0571.68018]
  10. 10. E. P. FRIEDMAN, The Inclusion Problem for Simple Languages, Theoretical Computer Science, 1976, 1, pp. 297-316. [MR: 405936] [Zbl: 0349.68032]
  11. 11. M. R. GARY and D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979. [MR: 519066] [Zbl: 0411.68039]
  12. 12. R. J. VAN GLABBEEK, The Linear Time - Branching Time Spectrum, Lecture Notes in Computer Science, 1990, 458, pp. 278-297.
  13. 13. J. F. GROOTE, A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes, Technical Report CS-R9151, CWI, 1991, to appear in Information Processing Letters. [MR: 1168773] [Zbl: 0779.68029]
  14. 14. J. F. GROOTE and H. HÜTTEL, Undecidable Equivalences for Basic Process Algebra, Technical Report CS-R9137, CWI, 1991. [Zbl: 0834.68069]
  15. 15. J. F. GROOTE and F. W. VAANDRAGER, 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: 0752.68053]
  16. 16. M. A. HARRISON, Introduction to Formal Language Theory, Addison-Wesley, 1978. [MR: 526397] [Zbl: 0411.68058]
  17. 17. H. HÜTTEL and C. STIRLING, Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes, Proc. 6th Annual Symp. on Logic in Computer Science, 1991, pp. 376-386. [Zbl: 0904.68129]
  18. 18. D. T. HUYNH and L. TIAN, 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. 19. D. T. HUYNH and L. TIAN, On Deciding Trace Equivalences for Processes, Technical Report UTDCS-4-91, University of Texas at Dallas, 1991, to appear in Information Sciences. [MR: 1228797] [Zbl: 0783.68043]
  20. 20. D. T. HUYNH and L. TIAN, On Some Equivalence Relations for Probabilistic Processes, Fundamenta Informaticae, 1992, 17, pp. 211-234. [MR: 1208589] [Zbl: 0766.68099]
  21. 21. D. T. HUYNH and L. TIAN, 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: 0801.68058]
  22. 22. D. T. HUYNH and L. TIAN, A Note on Complexity of Deciding Bisimilarity of Normed Unary Processes, Technical Report UTDCS-2-92, University of Texas at Dallas, 1992. [Zbl: 0809.68066]
  23. 23. J. E. HOPCROFT and J. D. ULLMAN, Formal Languages and Their Relation to Automata, Addison-Wesley Publishing Co., 1969. [MR: 237243] [Zbl: 0196.01701]
  24. 24. J. E. HOPCROFT and J. D. ULLMAN, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing Co., 1979. [MR: 645539] [Zbl: 0426.68001]
  25. 25. N. IMMERMAN, Nondeterministic Space is Closed under Complement, SIAM J. on Computing, 1988, 17, pp. 935-938. [MR: 961049] [Zbl: 0668.68056]
  26. 26. K. G. LARSEN and A. SKOU, Bisimulation through Probabilistic Testing, Information and Computation, 1991, 94, pp. 1-28. [MR: 1123153] [Zbl: 0756.68035]
  27. 27. P. C. KANELLAKIS and S. A. SMOLKA, CCS Expressions, Finite State Processes and Three Problems of Equivalence, Information and Computation, 1990, 86, pp. 43-68. [MR: 1049267] [Zbl: 0705.68063]
  28. 28. R. MILNER, Communication and Concurrency, Prentice-Hall, 1989. [Zbl: 0683.68008]
  29. 29. R. DE NICOLA and M. C. B. HENNESSY, Testing Equivalences for Processes, Theoretical Computer Science, 1984, 34, pp.83-133. [MR: 774041] [Zbl: 0985.68518]
  30. 30. E. R. OLDEROG and C. A. R. HOARE, Specification-Oriented Semantics for Communicating Processes, Acta Informatica, 1986, 23, pp. 9-66. [MR: 845623] [Zbl: 0569.68019]
  31. 31. D. PARK, Concurrency and Automata on Infinite Sequences, Lecture Notes in Computer Science, 1981, 104, pp. 168-183. [Zbl: 0457.68049]
  32. 32. I. C. C. PHILLIPS, Refusal Testing, Theoretical Computer Science, 1987, 50, pp. 241-284. [MR: 911076] [Zbl: 0626.68011]
  33. 33. R. PAIGE and R. E. TARJAN, Three Partition Refinement Algorithm, SIAM J. on Computing, 1987, 16, pp. 937-989. [MR: 917035] [Zbl: 0654.68072]
  34. 34. W. S. ROUNDS and S. D. BROOKS, Possible Futures, Acceptances, Refusals and Communicating Processes, Proc. 22-nd Annual Symp. on Foundations of Computer science, 1981, pp. 140-149.
  35. 35. L. J. STOCKMEYER, The Polynomial Time Hierarchy, 1977, 3, pp. 1-22. [MR: 438810] [Zbl: 0353.02024]
  36. 36. I. H. SUDBOROUGH, On Tape-Bounded Complexity Classes and Multi-Head Finite Automata, Comput. Syst. Sci., 1975, 10, pp.62-76. [MR: 363832] [Zbl: 0299.68031]
  37. 37. R. SZELEPCSÉNYI, The Method of Forced Enumeration for Nondeterministic Automata, Acta Information, 1988, 29, pp. 279-284. [MR: 975334] [Zbl: 0638.68046]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.