Formal Aspects of Computing

, Volume 10, Issue 4, pp 381–404 | Cite as

The SH-Verification Tool — Abstraction-Based Verification of Co-operating Systems

  • P. Ochsenschläger
  • J. Repp
  • R. Rieke
  • U. Nitsche
Original Paper

Abstract.

The sh-verification tool comprises computing abstractions of finite-state behaviour representations as well as automata and temporal logic based verification approaches. To be suitable for the verification of so called co-operating systems, a modified type of satisfaction relation (approximate satisfaction) is considered. Regarding abstraction, alphabetic language homomorphisms are used to compute abstract behaviours. To avoid loss of important information when moving to the abstract level, abstracting homomorphisms have to satisfy a certain property called simplicity on the concrete (i.e. not abstracted) behaviour. The well known state space explosion problem is tackled by a compositional method combined with a partial order method.

Keywords: Simple language homomorphisms; Asynchronous product automata; Approximate satisfaction of safety and liveness properties; Model checking; Verification tools 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© BCS 1998

Authors and Affiliations

  • P. Ochsenschläger
    • 1
  • J. Repp
    • 1
  • R. Rieke
    • 1
  • U. Nitsche
    • 2
  1. 1.GMD — German National Research Centre for Computer Science, Institute for Telecooperation Technology, Darmstadt, GermanyDE
  2. 2.Department of Electronics and Computer Science, University of Southampton, Southampton, UKGB

Personalised recommendations