Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis

Lakshmi, Vasanta K and Acharya, Aravind and Komondoor, Raghavan (2014) Checking Liveness Properties of Presburger Counter Systems Using Reachability Analysis. In: 19th International Symposium on Formal Methods (FM), MAY 12-16, 2014, Natl Univ Singapore, Singapore, SINGAPORE, pp. 335-350.

PDF fm_for_met_8442_335_2014.pdf - Published Version Restricted to Registered users only Download (377kB) | Request a copy

Abstract

Counter systems are a well-known and powerful modeling notation for specifying infinite-state systems. In this paper we target the problem of checking liveness properties in counter systems. We propose two semi decision techniques towards this, both of which return a formula that encodes the set of reachable states of the system that satisfy a given liveness property. A novel aspect of our techniques is that they use reachability analysis techniques, which are well studied in the literature, as black boxes, and are hence able to compute precise answers on a much wider class of systems than previous approaches for the same problem. Secondly, they compute their results by iterative expansion or contraction, and hence permit an approximate solution to be obtained at any point. We state the formal properties of our techniques, and also provide experimental results using standard benchmarks to show the usefulness of our approaches. Finally, we sketch an extension of our liveness checking approach to check general CTL properties.

Item Type:	Conference Proceedings
Series.:	Lecture Notes in Computer Science
Publisher:	SPRINGER-VERLAG BERLIN
Additional Information:	Copy right for this article belongs to the SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	19 Nov 2014 04:34
Last Modified:	19 Nov 2014 04:34
URI:	http://eprints.iisc.ac.in/id/eprint/50292

Actions (login required)

View Item