LoLA: a low level analyser

  • Authors:
  • Karsten Schmidt

  • Affiliations:
  • Humboldt-Universität zu Berlin

  • Venue:
  • ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

With LoLA, we put recently developed state space oriented algorithms to other tool developers disposal. Providing a simple interface was a major design goal such that it is as easy as possible to integrate LoLA into tools of different application domains. LoLA supports place/transition nets. Implemented verification techniques cover standard properties (liveness, reversibility, boundedness, reachability, dead transitions, deadlocks, home states) as well as satisfiability of state predicates and CTL model checking. For satisfiability, both exhaustive search and heuristically goal oriented system execution are supported. For state space reduction, LoLA features symmetries, stubborn sets, and coverability graphs.