Advertisement

LoLA A Low Level Analyser

  • Karsten Schmidt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1825)

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.

Keywords

Model Check Home State Reachability Graph Coverability Graph State Space Exploration 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Finkel. A minimal coverability graph for Petri nets. Proc. 11th International Conference on Application and Theory of Petri nets, pages 1–21, 1990.Google Scholar
  2. 2.
    R. Gerth, R. Kuiper, D. Peled, and W. Penczek. A partial order approach to branching time logic model checking. 3rd Israel Symp. on the Theory of Computing and Systems, IEEE 1995, pages 130–140, 1995.Google Scholar
  3. 3.
    R. M. Karp and R. E. Miller. Parallel programm schemata. Journ. Computer and System Sciences 4, pages 147–195, 1969.MathSciNetGoogle Scholar
  4. 4.
    K. Schmidt. Symmetries of Petri nets. Informatik-Bericht 33, Humboldt-Universität zu Berlin, 1994.Google Scholar
  5. 5.
    K. Schmidt. How to calculate symmetries of Petri nets. Acta Informatica 36, pages 545–590, 2000.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    K. Schmidt. Integrating low level symmetries into reachability analysis. Proc. 6th International Conference Tools and Algorithms for the Construction and Analysis of Systems, LNCS 1785, pages 315–330, 2000.CrossRefGoogle Scholar
  7. 7.
    K. Schmidt. Stubborn sets for model checking the EF/AG fragment of CTL. to appear in Fundamenta Informaticae, 2000.Google Scholar
  8. 8.
    K. Schmidt. Stubborn sets for standard properties. 20th International Conference on Application and Theory of Petri nets, LNCS 1639, pages 46–65, 1999.Google Scholar
  9. 9.
    A. Valmari. Error detection by reduced reachability graph generation. Proc. 9th European Workshop on Application and Theory of Petri Nets, 1988.Google Scholar
  10. 10.
    A. Valmari. State of the art report: Stubborn sets. Petri net Newsletter 46, pages 6–14, 1994.Google Scholar
  11. 11.
    B. Vergauwen and J. Lewi. A linear local model checking algorithm for ctl. Proc. CONCUR, LNCS 715, pages 447–461, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Karsten Schmidt
    • 1
  1. 1.Humboldt-Universität zu BerlinBerlin

Personalised recommendations