Reachability in Timed Counter Systems

Authors:
Florent Bouchy;Alain Finkel;Arnaud Sangnier
Affiliations:
LSV, ENS Cachan, CNRS, 61 avenue du Président Wilson, 94230 Cachan, France;LSV, ENS Cachan, CNRS, 61 avenue du Président Wilson, 94230 Cachan, France;LSV, ENS Cachan, CNRS, 61 avenue du Président Wilson, 94230 Cachan, France and EDF R&D, 61 avenue du Préésident Wilson, 94230 Cachan, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 18
Cited 1

A theory of timed automata

Theoretical Computer Science
Untiming timed languages

Information Processing Letters
Characterization of the expressive power of silent transitions in timed automata

Fundamenta Informaticae
Reversal-Bounded Multicounter Machines and Their Decision Problems

Journal of the ACM (JACM)
From timed Petri nets to timed LOTOS

Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Binary Reachability Analysis of Discrete Pushdown Timed Automata

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Real-Time System Verification using P/T Nets

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Computation: finite and infinite machines

Computation: finite and infinite machines
FAST: acceleration from theory to practice

International Journal on Software Tools for Technology Transfer (STTT)
About Fast and TReX Accelerations

Electronic Notes in Theoretical Computer Science (ENTCS)
Parallel program schemata

Journal of Computer and System Sciences
Flat acceleration in symbolic model checking

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis

Recursive timed automata

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce Timed Counter Systems, a new class of systems mixing clocks and counters. Such systems have an infinite state space, and their reachability problems are generally undecidable. By abstracting clock values with a Region Graph, we show the Counter Reachability Problem to be decidable for three subclasses: Timed VASS, Bounded Timed Counter Systems, and Reversal-Bounded Timed Counter Systems.