Skip to main content
Log in

Automatic verification for a class of distributed systems

  • Original articles
  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary.

The paper presents a new analysis method for a class of concurrent systems which are formed of several interacting components with the same structure. The model for these systems is composed of a control process and a set of homogeneous user processes. The control and user processes are modeled by finite labeled state transition systems which interact by means of enabling functions and triggering mechanisms. Based on this structure, an analysis method is presented which allows system properties, derived by reachability analysis for a finite number of user processes, to be generalized to an arbitrary number of user processes. A procedure for the automatic verification of properties such as mutual exclusion and absence of deadlocks is presented and is then used to provide for the first time a fully automated verification of the Lamport's fast mutual exclusion algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: October 1998/Accepted January 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manduchi, G., Moro, M. Automatic verification for a class of distributed systems. Distrib Comput 13, 127–143 (2000). https://doi.org/10.1007/PL00008915

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00008915

Navigation