Mechanizing the verification of real-time discrete systems

https://doi.org/10.1016/0165-6074(89)90127-0Get rights and content

Abstract

This paper shows that constraint logic programming languages (such as CLP (R)) provide a useful computational logic for modelling, simulating and verifying real-time discrete event processes. The designer's knowledge about discrete processes can be represented in a fashion that stays close to the mathematical definition of the processes, and can be used to semi-automate verification of (possibly infinite state) systems.

References (29)

  • M. Abadi et al.

    Nonclausal temporal deduction

  • A. Bernstein et al.

    Proving real-time properties of programs with temporal logic

  • R.S. Boyer et al.

    A computational logic handbook

  • K.P. Brand et al.

    Principles and engineering of process control with Petri nets

    IEEE Transactions on Automatic Control

    (1988)
  • J. Hoofman

    A compositional proof-system for an OCCAM-like real-time language

  • J. Jaffar et al.

    Constraint logic programming

  • F. Jahanian et al.

    Safety analysis of timing properties in real-time systems

    IEEE Transactions on Software Engineering

    (1986)
  • F. Jahanian et al.

    A method for verifying properties of modechart specifications

  • R. Koymans et al.

    Real-time programming and asynchronous message passing

  • R. Koymans et al.

    Compositional Semantics for Real-time Distributed Computing

  • I. Lee et al.

    Timed acceptances: a model of time dependent processes

  • N.G. Leveson et al.

    Safety analysis using Petrinets

    IEEE Transactions on Software Engineering

    (1987)
  • G.H. MacEwen et al.

    Expressing requirements for distributed real-time systems

  • Cited by (0)

    This work is supported by the Natural Sciences and Engineering Research Council of Canada.

    View full text