Checking for CFFD-preorder with tester processes

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

Volumn 1785 LNCS, Issue , 2000, Pages 283-298

  Helovuo, Juhana ^a   Valmari, Antti ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; SPECIFICATIONS;

ALGEBRAIC SEMANTIC; CSP MODEL; LABELLED TRANSITION SYSTEMS; ON THE FLIES; PREORDER RELATION; PREORDERS; SPECIFICATION PROCESS;

COMPUTATION THEORY;

EID: 84863891859     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46419-0_20     Document Type: Conference Paper

References (20)

1. E. Brinksma, G. Scollo, and C. Steenbergen. LOTOS specifications, their implementations and their tests. Protocol Specification, Testing and Verification VI, IFIP 1987, pages 349-360, 1987.
2. Ed Brinksma. A theory for the derivation of tests. In Protocol Specification, Testing and Verification VIII, pages 63-74. North-Holland, 1989.
3. Rance Cleaveland and Matthew Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5(1):1-20, 1993.
4. M. Hennessy. Acceptance trees. Journal of the ACM 32(4), pages 896-928, 1985.
5. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
6. Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990.
7. Roope Kaivola and Antti Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In CONCUR '92: Third International Conference on Concurrency Theory, Volume 630 of Lecture Notes in Computer Science, pages 207-221. Springer-Verlag.
8. Paris C. Kanellakis and Scott A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, May 1990.
9. Guy Leduc. On the Role of Implementation Relations in the Design of Distrubuted Systems using LOTOS. PhD thesis, Université de Liège, July 1990.
10. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems-Specificati on. Springer-Verlag, 1992.
11. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
12. Ernst-Rüdiger Olderog. TCSP: Theory of communicating sequential processes. In Petri Nets: Applications an Relationships to Other Models of Concurrency, Volume 255 of Lecture Notes in Computer Science, pages 441-465. Springer-Verlag, July 1986.
13. A. W. Roscoe. Model-checking CSP. In A Classical Mind: Essays in Honour of C. A. R. Hoare, pages 353-378. Prentice-Hall, 1994.
14. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998.
15. A. Valmari. Compositionality in state space verification methods. In Application and Theory of Petri Nets 1996, 17th International Conference, volume 1091, pages 29-56, 1996. (Pubitemid 126085898)
16. A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, volume 1491, pages 429-528, 1998.
17. Antti Valmari, Jukka Kemppainen, Matthew Clegg, and Mikko Levanto. Putting advanced reachability analysis techniques together: the "ARA," tool. In FME'93: Industrial-Strength Formal Methods, pages 597-616. Formal Methods Europe, Springer-Verlag, April 1993. Lecture Notes in Computer Science 670.
18. Antti Valmari and Martti Tienari. An improved failures equivalence for finitestate systems with a reduction algorithm. In Proceedings of the IFIP WG 6.1 Eleventh International Symposium on Protocol Specification, Testing and Verification, Stockholm, Sweden, pages 3-18. North-Holland, 1991.
19. Antti Valmari and Martti Tienari. Compositional failure-based semantic models for Basic LOTOS. Formal Aspects of Computing, 7:440-468, 1995.
20. Valmari, A. On-the-fly verification with stubborn sets. In Proc. of the 1993 Workshop on Computer-Aided Verification, 1993.