Skip to main content

Conformance Relations for Labeled Event Structures

  • Conference paper
Tests and Proofs (TAP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7305))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  5. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  6. Abramsky, S.: Observation equivalence as a testing equivalence. Theoretical Computer Science 53, 225–241 (1987)

    Article  MathSciNet  MATH  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 

  8. Phillips, I.: Refusal testing. Theoretical Computer Science 50, 241–284 (1987)

    Article  MathSciNet  MATH  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 

  10. Segala, R.: Quiescence, fairness, testing, and the notion of implementation. Information and Computation 138(2), 194–210 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Tretmans, J.: Test generation with inputs, outputs and repetitive quiescence. Software - Concepts and Tools 17(3), 103–120 (1996)

    MATH  Google Scholar 

  12. De Nicola, R.: Extensional equivalences for transition systems. Acta Informatica 24(2), 211–237 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  13. von Bochmann, G., Haar, S., Jard, C., Jourdan, G.-V.: Testing Systems Specified as Partial Order Input/Output Automata. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom/FATES 2008. LNCS, vol. 5047, pp. 169–183. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Haar, S., Jard, C., Jourdan, G.-V.: Testing Input/Output Partial Order Automata. In: Petrenko, A., Veanes, M., Tretmans, J., Grieskamp, W. (eds.) TestCom/FATES 2007. LNCS, vol. 4581, pp. 171–185. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 85–108 (1981)

    Article  MathSciNet  MATH  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 

  17. Nielsen, M., Sassone, V., Winskel, G.: Relationships Between Models of Concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol. 803, pp. 425–476. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  18. Aceto, L., De Nicola, R., Fantechi, A.: Testing Equivalences for Event Structures. In: Venturini Zilli, M. (ed.) Mathematical Models for the Semantics of Parallelism. LNCS, vol. 280, pp. 1–20. Springer, Heidelberg (1987)

    Chapter  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ponce de León, H., Haar, S., Longuet, D. (2012). Conformance Relations for Labeled Event Structures. In: Brucker, A.D., Julliand, J. (eds) Tests and Proofs. TAP 2012. Lecture Notes in Computer Science, vol 7305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30473-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30473-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30472-9

  • Online ISBN: 978-3-642-30473-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics