LTSMIN: distributed and symbolic reachability

  • Authors:
  • Stefan Blom;Jaco van de Pol;Michael Weber

  • Affiliations:
  • Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands;Formal Methods and Tools, University of Twente, The Netherlands

  • Venue:
  • CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In model checking, analysis algorithms are applied to large graphs (state spaces), which model the behavior of (computer) systems These models are typically generated from specifications in high-level languages The LTSmin toolset provides means to generate state spaces from high-level specifications, to check safety properties on-the-fly, to store the resulting labelled transition systems (LTSs) in compressed format, and to minimize them with respect to (branching) bisimulation.