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.

[1]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[2]  Rom Langerak A Testing Theory for LOTOS using Deadlock Detection , 1989, PSTV.

[3]  Jan Tretmans,et al.  Test Generation with Inputs, Outputs and Repetitive Quiescence , 1996, Softw. Concepts Tools.

[4]  Richard J. Linn,et al.  Conformance testing methodologies and architectures for OSI protocols , 1995 .

[5]  Iain Phillips,et al.  Refusal Testing , 1986, Theoretical Computer Science.

[6]  Marisa Venturini Zilli Mathematical Models for the Semantics of Parallelism , 1987, Lecture Notes in Computer Science.

[7]  Giuseppe Scollo,et al.  Lotos specifications, their implementations and their tests , 1995 .

[8]  Alexandre Petrenko,et al.  Testing of Software and Communicating Systems , 2007, Lecture Notes in Computer Science.

[9]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[10]  Grzegorz Rozenberg,et al.  Advances in Petri Nets 1985 , 1985, Lecture Notes in Computer Science.

[11]  Roberto Segala,et al.  Quiescence, Fairness, Testing, and the Notion of Implementation , 1997, Inf. Comput..

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  Rocco De Nicola,et al.  Testing Equivalences for Event Structures , 1986, Mathematical Models for the Semantics of Parallelism.

[14]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[15]  Gregor von Bochmann,et al.  Testing Systems Specified as Partial Order Input/Output Automata , 2008, TestCom/FATES.

[16]  Itu-T Specification and Description Language (SDL) , 1999 .

[17]  Claude Jard,et al.  Testing Input/Output Partial Order Automata , 2007, TestCom/FATES.

[18]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[19]  Thomas Chatain,et al.  A concurrency-preserving translation from time Petri nets to networks of timed automata , 2010, 2010 17th International Symposium on Temporal Representation and Reasoning.

[20]  Glynn Winskel,et al.  Relationships Between Models of Concurrency , 1993, REX School/Symposium.

[21]  Glynn Winskel,et al.  Relationships between Models of Concurency , 1993 .

[22]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[23]  C. A. R. Hoare,et al.  Notes on Communicating Sequential Systems , 1986 .

[24]  Rocco De Nicola,et al.  Extensional equivalences for transition systems , 1987, Acta Informatica.