Modular State Level Analysis of Distributed Systems Techniques and Tool Support

  • Authors:
  • Peter Buchholz;Peter Kemper

  • Affiliations:
  • -;-

  • Venue:
  • TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
  • Year:
  • 1999

Quantified Score

Hi-index 0.02

Visualization

Abstract

Techniques from different areas are combined to analyze parallel and distributed software within a common framework. They include bisimulation equivalences known from process algebras, Kronecker representations of labelled (stochastic) transitions systems known from performance analysis using Markov chains, and ordered natural decision diagrams (ONDDs) as a generalization of ordered binary decision diagrams famous in hardware verification as well as for the analysis of Boolean functions in general. The employed analysis tools are all part of a toolbox built on the abstract Petri net notation (APNN), a model interchange format using Petri nets. In this context we experience a cross fertilization of different research fields within a Petri net context. We exercise Lamport's mutual exclusion algorithm to discuss the strengths and limitations of the presented approach.