Tampere Verification Tool (TVT) is a collection of programs for automated verification of concurrent and reactive systems. TVT has its roots in process algebras and explicit state space exploration, but in addition to actions, our formalism allows use of state-based information in the form of truth-valued state propositions. Furthermore, it contains three types of state proposition-like notions to support on-the-fly verification, and one state proposition to exploit partially defined processes. TVT supports compositional state space construction, stubborn sets and visual verification.
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Groote, Jan Friso; Jansen, David N.; Keiren, Jeroen J.A.; Wijs, Anton J.: An $\mathcal O(m\log n)$ algorithm for computing stuttering equivalence and branching bisimulation (2017)
- Virtanen, Heikki; Hansen, Henri; Valmari, Antti; Nieminen, Juha; Erkkilä, Timo: Tampere verification tool (2004)