منابع مشابه
Reachability in Timed Counter Systems
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 S...
متن کاملRelating Reachability Problems in Timed and Counter Automata
We establish a relationship between reachability problems in timed automata and spacebounded counter automata. We show that reachability in timed automata with three or more clocks is logarithmic-space inter-reducible with reachability in space-bounded counter automata with two counters. We moreover show the logarithmic-space equivalence of reachability in two-clock timed automata and space-bou...
متن کاملReachability Analysis on Timed Graph Transformation Systems
In recent years, software increasingly exhibits self-* properties like selfoptimization or self-healing. Such properties require reconfiguration at runtime in order to react to changing environments or detected defects. A reconfiguration might add or delete components as well as it might change the communication topology of the system. Considering communication protocols between an arbitrary nu...
متن کاملReachability in Parametric Counter Automata
Counter automata are a fundamental class of infinite-state systems. They consist of a finite set of control locations, transitions between them and a finite set of counters over the positive integers. At each transition, a counter can be tested for zero or incremented by some
متن کاملThe Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
This paper introduces the model of priced timed pushdown systems as an extension of discrete-timed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a priced timed pushdown system and a target set of configurations, determine the minimal possible cost of any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.05.038