Abstract
This paper describes an on-the-fly technique for computing the CFFD-preorder relation on two labelled transition systems (LTSs). CFFD is a process-algebraic semantic model for comparing processes. It is a modification of the CSP model. LTSs are used as a representation of processes. The presented technique is based on transforming the specification process into a special tester process. The tester is then composed in parallel with the processes of the implementation. Violations against the specification are detected as illegal states, deadlocks and livelocks during the computation of the composition. Tester processes are an extension of Brinksma’s canonical testers. Using a tester process can be a substantially faster method of computing CFFD-preorder than the previously used method of comparing acceptance graphs.
Chapter PDF
Similar content being viewed by others
Keywords
- Parallel Composition
- Visible Action
- Label Transition System
- Communicate Sequential Process
- Deadlock State
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
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. 284
Ed Brinksma. A theory for the derivation of tests. In Protocol Specification, Testing and Verification VIII, pages 63–74. North-Holland, 1989. 284, 291
Rance Cleaveland and Matthew Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5(1):1–20, 1993. 284
M. Hennessy. Acceptance trees. Journal of the ACM 32(4), pages 896–928, 1985. 290
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. 283, 285
Gerard J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1990. 291, 296
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. 284
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. 288
Guy Leduc. On the Role of Implementation Relations in the Design of Distrubuted Systems using LOTOS. PhD thesis, Université de Liège, July 1990. 283
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems-Specification. Springer-Verlag, 1992. 284
R. Milner. Communication and Concurrency. Prentice-Hall, 1989. 283
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. 287
A. W. Roscoe. Model-checking CSP. In A Classical Mind: Essays in Honour of C. A. R. Hoare, pages 353–378. Prentice-Hall, 1994. 284, 285
A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall, 1998. 283, 284, 285
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. 287
A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, volume 1491, pages 429–528, 1998. 284, 291
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. 285, 296
Antti Valmari and Martti Tienari. An improved failures equivalence for finite-state 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. 283, 285, 290, 293
Antti Valmari and Martti Tienari. Compositional failure-based semantic models for Basic LOTOS. Formal Aspects of Computing, 7:440–468, 1995. 283, 285, 287, 288
Valmari, A. On-the-fly verification with stubborn sets. In Proc. of the 1993 Workshop on Computer-Aided Verification, 1993. 291, 296
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Helovuo, J., Valmari, A. (2000). Checking for CFFD-Preorder with Tester Processes. In: Graf, S., Schwartzbach, M. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2000. Lecture Notes in Computer Science, vol 1785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46419-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-46419-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67282-1
Online ISBN: 978-3-540-46419-8
eBook Packages: Springer Book Archive