Model-checking CTL* over flat Presburger counter systems

Download Edit this record How to cite View on PhilPapers
This paper concerns model-checking of fragments and extensions of CTL* on infinite-state Presburger counter systems, where the states are vectors of integers and the transitions are determined by means of relations definable within Presburger arithmetic. In general, reachability properties of counter systems are undecidable, but we have identified a natural class of admissible counter systems (ACS) for which we show that the quantification over paths in CTL* can be simulated by quantification over tuples of natural numbers, eventually allowing translation of the whole Presburger-CTL* into Presburger arithmetic, thereby enabling effective model checking. We provide evidence that our results are close to optimal with respect to the class of counter systems described above.
PhilPapers/Archive ID
Upload history
Archival date: 2018-04-20
View other versions
Added to PP index

Total views
133 ( #47,020 of 72,515 )

Recent downloads (6 months)
10 ( #60,297 of 72,515 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.