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.
Reachability in Timed Counter Systems
SANGNIER A
2009-01-01
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
