T(O)RMC: A Tool for (omega)-Regular Model Checking

Within the context of the verification of infinite-statesystems, "(ω)-Regular model checking" is the name ofa family of techniques in which states are represented by words,sets of states by finite automata on these objects, and transitionsby finite automata operating on pairs of state encodings, i.e.finite-state transducers. If the states are encoded by finitewords, then sets of (pairs of) states can be represented byfinite-word automata. This setting can be used to represent variousclasses of infinite-state systems, [17], including parametricsystems, FIFO-queue systems, and systems manipulating integervariables (those defined in Presburger arithmetic). When the statesare encoded by infinite words, sets of (pairs of) states arerepresented by deterministic weak Buchi automata. This settingis mainly used to represent systems involving both integer and realvariables [4,6], such as linear hybrid systems with a constantderivative.

[1]  Pierre Wolper,et al.  Verifying Systems with Infinite but Regular State Spaces , 1998, CAV.

[2]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[3]  Pierre Wolper,et al.  An effective decision procedure for linear arithmetic over the integers and reals , 2005, TOCL.

[4]  Pierre Wolper,et al.  Iterating Transducers in the Large (Extended Abstract) , 2003, CAV.

[5]  Bernd Becker,et al.  LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals , 2007, CAV.

[6]  Jérôme Leroux,et al.  FAST Extended Release , 2006, CAV.

[7]  Pierre Wolper,et al.  Handling Liveness Properties in (omega-)Regular Model Checking , 2004, INFINITY.

[8]  Mariëlle Stoelinga,et al.  Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k , 2001, International Journal on Software Tools for Technology Transfer.

[9]  Frédéric Herbreteau,et al.  The Power of Hybrid Acceleration , 2006, CAV.

[10]  Alain Finkel,et al.  How to Compose Presburger-Accelerations: Applications to Broadcast Protocols , 2002, FSTTCS.

[11]  Mahesh Viswanathan,et al.  LEVER: A Tool for Learning Based Verification , 2006, International Conference on Computer Aided Verification.

[12]  Pierre Wolper,et al.  Omega-Regular Model Checking , 2004, TACAS.

[13]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[14]  Manindra Agrawal,et al.  FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science , 2002, Lecture Notes in Computer Science.

[15]  Pierre Wolper,et al.  Computing Convex Hulls by Automata Iteration , 2008, CIAA.