LTSA is a verification tool for concurrent systems. It mechanically checks that the specification of a concurrent system satisfies the properties required of its behaviour. In addition, LTSA supports specification animation to facilitate interactive exploration of system behaviour.

Note: LTSA is available for download here.


A system in LTSA is modelled as a set of interacting finite state machines. The properties required of the system are also modelled as state machines. LTSA performs compositional reachability analysis to exhaustively search for violations of the desired properties. More formally, each component of a specification is described as a Labelled Transition System (LTS), which contains all the states a component may reach and all the transitions it may perform. However, explicit description of an LTS in terms of its states, set of action labels and transition relation is cumbersome for other than small systems. Consequently, LTSA supports a process algebra notation (FSP) for concise description of component behaviour. The tool allows the LTS corresponding to a FSP specification to be viewed graphically.

Recent Forum Posts

{"module":"feed\/FeedModule","params":{"src":"http:\/\/ltsa.wikidot.com\/feed\/forum\/posts.xml","limit":"8","module_body":"**%%linked_title%%** (%%custom pubDate%%)"}}
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-Share Alike 2.5 License.