VLTS Benchmark Suite
The VLTS acronym stands for ”Very Large Transition Systems”. The VLTS benchmark suite is a collection of Labelled Transition Systems (hereafter called benchmarks). Each Labelled Transition System is a directed, connected graph, whose vertices are called states and whose edges are called transitions. There is one distinguished vertex called the initial state. Each transition is labelled by a character string called action or label. There is one distinguished label noted ”i” that is used for so-called invisible transitions (also known as hidden transitions or tau-transitions). The VLTS benchmarks have been obtained from various case studies about the modelling of communication protocols and concurrent systems. Many of these case studies correspond to real life, industrial systems.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Ranzato, Francesco; Tapparo, Francesco: An efficient simulation algorithm based on abstract interpretation (2010)
- Barnat, Jiri; Chaloupka, Jakub; Van De Pol, Jaco: Improved distributed algorithms for SCC decomposition. (2008)
- Ranzato, Francesco; Tapparo, Francesco: Generalizing the Paige-Tarjan algorithm by abstract interpretation (2008)
- Groote, Jan Friso; van Ham, Frank: Interactive visualization of large state spaces (2006)
- Bergamini, Damien; Descoubes, Nicolas; Joubert, Christophe; Mateescu, Radu: BISIMULATOR: A modular tool for on-the-fly equivalence checking (2005)