Alphabet-based synchronisation is exponentially cheaper

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2421 LNCS, Issue , 2002, Pages 161-176

  Valmari, Antti ^a   Kervinen, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL COMPOSITION; PARALLEL COMPOSITION OPERATORS; PREORDER RELATION; VERIFICATION PROBLEMS;

SEQUENTIAL MACHINES; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

SPECIFICATIONS;

EID: 84874678723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (16)

1. Bolognesi, T. & Brinksma, E.: "Introduction to the ISO Specification Language LOTOS". Computer Networks and ISDN Systems 14, 1987, pp. 25-59.
2. Helovuo, J. & Valmari, A.: "Checking for CFFD-Preorder with Tester Processes". Proc. TACAS'2000, 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science 1785, Springer-Verlag 2000, pp. 283-298.
3. Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall 1985, 256 p. 161
4. Hopcroft, J. E., Motwani, R. & Ullman, J. D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001, 521 p. 170
5. Jategaonkar, L. & Meyer, A. R.: "Deciding True Concurrency Equivalences on Finite Safe Nets". Theoretical Computer Science 154 (1), 1996, pp. 107-143.
6. Kanellakis, P. & Smolka, S.: "CCS Expressions, Finite State Processes, and Three Problems of Equivalence". Information and Computation 86 (1), Academic Press 1990, pp. 43-68.
7. Laroussinie, F. & Schnoebelen, P.: "The State Explosion Problem from Trace to Bisimulation Equivalence". Proc. FoSSaCS'2000, 3rd International Conference on Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science 1784, Springer-Verlag 2000, pp. 192-207.
8. Meyer, A. L. & Stockmeyer, L. J.: "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Time". Proc. 13th Annual Symposium on Switching and Automata Theory, IEEE 1972, pp. 125-129.
9. Meyer, A. L. & Stockmeyer, L. J.: "Word Problems - This Time with Interleaving". Information and Computation 115 (2), 1994, pp. 293-311.
10. Milner, R.: Communication and Concurrency. Prentice Hall 1989.
11. Rabinovich, A.: "Complexity of Equivalence Problems for Concurrent Systems of Finite Agents". Information and Computation 139 (2), Academic Press 1997, pp. 111-129.
12. Roscoe, A. W.: The Theory and Practice of Concurrency. Prentice-Hall 1998, 565 p. 161
13. Shukla, S. K., Hunt III, H. B., Rosenkrantz, D. J. & Stearns, R. E.: "On the Complexity of Relational Problems for Finite State Processes". Proc. ICALP'96, 23rd International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science 1099, Springer-Verlag, 1996, pp. 466-477.
14. Sistla, A. P. & Clarke, E. M.: "The Complexity of Propositional Linear Temporal Logics". Journal of the ACP 32 (3), 1985, pp. 733-749.
15. Valmari, A.: "Failure-based Equivalences Are Faster Than Many Believe". Proc. STRICT'95, Structures in Concurrency Theory, Workshops in Computing, Springer-Verlag 1995, pp. 326-340.
16. Valmari, A. & Tienari, M.: "Compositional Failure-Based Semantic Models for Basic LOTOS". Formal Aspects of Computing 7, 1995, pp. 440-468.