Difference between revisions of "Main Page"
Radu iosif (Talk | contribs) |
Radu iosif (Talk | contribs) |
||
| Line 1: | Line 1: | ||
'''Numerical Transition Systems Repository''' | '''Numerical Transition Systems Repository''' | ||
| + | |||
| + | Numerical Transition Systems (a.k.a. Counter Systems, Counter Automata or Counter Machines) are simple models of computation involving infinite (or very large) data domains, such as naturals, integers, rationals or real numbers. Despite their apparent simplicity, NTS can, in theory, model any real-life computer system, ranging from hardware circuits to programs. As a consequence, an important number of tools have emerged, addressing verification problems, such as reachability or termination, and deploying various techniques (widening, predicate abstraction, acceleration, etc.). The aim of NTS is to focus the verification community on a common general format (nts-lib) for describing NTS, and to build a open library of benchmarks that will be contributed to by tool developers. | ||
Revision as of 15:16, 31 January 2013
Numerical Transition Systems Repository
Numerical Transition Systems (a.k.a. Counter Systems, Counter Automata or Counter Machines) are simple models of computation involving infinite (or very large) data domains, such as naturals, integers, rationals or real numbers. Despite their apparent simplicity, NTS can, in theory, model any real-life computer system, ranging from hardware circuits to programs. As a consequence, an important number of tools have emerged, addressing verification problems, such as reachability or termination, and deploying various techniques (widening, predicate abstraction, acceleration, etc.). The aim of NTS is to focus the verification community on a common general format (nts-lib) for describing NTS, and to build a open library of benchmarks that will be contributed to by tool developers.
