Proving Event Ordering Properties for Information Systems

  • Marc Frappier
  • Régine Laleau
Conference paper

DOI: 10.1007/3-540-44880-2_25

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2651)
Cite this paper as:
Frappier M., Laleau R. (2003) Proving Event Ordering Properties for Information Systems. In: Bert D., Bowen J.P., King S., Waldén M. (eds) ZB 2003: Formal Specification and Development in Z and B. ZB 2003. Lecture Notes in Computer Science, vol 2651. Springer, Berlin, Heidelberg

Abstract

This paper presents an approach to prove event ordering properties for B specifications of information systems. The properties are expressed using the EB3 notation, where input event ordering properties are defined using a process algebra similar to CSP and output events are specified by recursive functions on the input traces associated to the process expression. By proving that the EB3 specification is refined by the B specification, using the B theory of refinement, we ensure that both specifications accept and refuse exactly the same event traces. The proof relies on an extended labeled transition system, generated using the operational semantics of the process algebra, in order to deal with unbounded systems. The gluing invariant is generated from the EB3 recursive functions.

Keywords

EB3 process algebra trace-based specifications refinement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Marc Frappier
    • 1
  • Régine Laleau
    • 2
  1. 1.Département de mathématiques et d’informatiqueUniversité de SherbrookeSherbrookeCanada
  2. 2.Laboratoire CEDRIC, Institut d’Informatique d’EntrepriseConservatoire National des Arts et MétiersÉvry CedexFrance

Personalised recommendations