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


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.

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received March 1997 / Accepted in revised form July 1998

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Ochsenschläger, P., Repp, J., Rieke, R. et al. The SH-Verification Tool — Abstraction-Based Verification of Co-operating Systems. Form Aspects Comput 10, 381–404 (1998).

Download citation

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