Formal Aspects of Computing

, Volume 6, Issue 6, pp 676–695

Automatizing Parametric Reasoning on Distributed Concurrent Systems

  • Paola Inverardi
  • Corrado Priami
  • Daniel Yankelevich
Formal Aspects of Computing

DOI: 10.1007/BF03259392

Cite this article as:
Inverardi, P., Priami, C. & Yankelevich, D. Form Asp Comp (1994) 6: 676. doi:10.1007/BF03259392

Abstract

There can be different views of a concurrent distributed system, depending on who observes it. The final user may just want to know how the system behaves in terms of its possible sequences of actions, while the designer may want to know what are the sequential components of a system or how are they distributed in space. In other words, there is not a widely accepted single semantic model for concurrent systems. This paper describes a parametric verification tool for process description languages. It performs a symbolic execution of processes at different levels of abstraction and verifies deadlock and reachability properties. The tool also provides facilities to check behavioural equivalences. In addition to the classical interleaving semantics, truly concurrent approaches based on the notion of causality and locality are considered. This allows us to compare the expressive power of different models within the same environment. In this respect, we have verified many of the examples given in the literature using our tool.

Keywords

Concurrent systemsSpecificationVerification

Copyright information

© BCS 1994

Authors and Affiliations

  • Paola Inverardi
    • 1
  • Corrado Priami
    • 2
  • Daniel Yankelevich
    • 3
  1. 1.I.E.I. - C.N.R.PisaItaly
  2. 2.Dipartimento di InformaticaUniversita di PisaPisaItaly
  3. 3.Department of Computer ScienceNC State UniversityRaleighUSA