Conformance Relations for Labeled Event Structures
We propose a theoretical framework for testing concurrent systems from true concurrency models like Petri nets or networks of automata. The underlying model of computation of such formalisms are labeled event structures, which allow to represent concurrency explicitly. The activity of testing relies on the definition of a conformance relation that depends on the observable behaviors on the system under test, which is given for sequential systems by ioco type relations. However, these relations are not capable of capturing and exploiting concurrency of non sequential behavior. We study different conformance relations for labeled event structures, relying on different notions of observation, and investigate their properties and connections.
KeywordsPartial Order Event Structure Concurrent System Concurrent Event Conformance Testing
Unable to display preview. Download preview PDF.
- 1.Milner, R.: Communication and concurrency. PHI Series in computer science. Prentice Hall (1989)Google Scholar
- 2.Hoare, T.: Communicating Sequential Processes. Prentice-Hall (1985)Google Scholar
- 3.ITU-TS: Recommendation Z.100: Specification and Description Language (2002)Google Scholar
- 4.Brinksma, E., Scollo, G., Steenbergen, C.: Lotos specifications, their implementations and their tests. In: Linn, R.J., Uyar, M.U. (eds.) Conformance testing methodologies and architectures for OSI protocols, pp. 468–479. IEEE Computer Society Press (1995)Google Scholar
- 7.Brinksma, E.: A theory for the derivation of tests. In: Protocol Specification Testing and Verification VIII, pp. 63–74. North-Holland (1988)Google Scholar
- 9.Langerak, R.: A testing theory for LOTOS using deadlock detection. In: Protocol Specification, Testing and Verification IX, pp. 87–98. North-Holland (1990)Google Scholar
- 16.Winskel, G.: Event Structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)Google Scholar
- 19.Balaguer, S., Chatain, T., Haar, S.: A concurrency-preserving translation from time Petri nets to networks of timed automata. In: International Symposium on Temporal Representation and Reasoning, pp. 77–84. IEEE Computer Society Press (2010)Google Scholar