Results 1  10
of
28,355
InfiniteState Energy Games
"... Abstract—Energy games are a wellstudied class of 2player turnbased games on a finite graph where transitions are labeled with integer vectors which represent changes in a multidimensional resource (the energy). One player tries to keep the cumulative changes nonnegative in every component while ..."
Abstract
 Add to MetaCart
while the other tries to frustrate this. We consider generalized energy games played on infinite game graphs induced by pushdown automata (modelling recursion) or their subclass of onecounter automata. Our main result is that energy games are decidable in the case where the game graph is induced by a
Verification of Infinitestate Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder nonregular ..."
Abstract
 Add to MetaCart
ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Wellstructured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over onecounter processes 12 12 Deciding rstorder non
Symbolic Algorithms for InfiniteState Games
, 2001
"... A procedure for the analysis of state spaces is called symbolic if it manipulates not individual states, but sets of states that are represented by constraints. Such a procedure can be used for the analysis of infinite state spaces, provided termination is guaranteed. We present symbolic procedures, ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
, and corresponding termination criteria, for the solution of infinitestate games, which occur in the control and modular verification of infinitestate systems. To characterize the termination of symbolic procedures for solving infinitestate games, we classify these game structures into four increasingly
Region Graphs for InfiniteState Systems
"... Timed automata were introduced by Alur and Dill in their seminal work on automatic verification of realtime systems. In a timed automaton, variables, representing clocks, range over an infinite, dense domain and are updated simultaneously. When such an update occurs, variables are either incremente ..."
Abstract
 Add to MetaCart
description of the automaton. We show that the regiongraph technique can be extended to a richer class of infinitestate systems, one that includes timed automata but also untimed systems in which variables can be updated independently and in different ways. In particular, we prove the decidability
Composability of infinitestate activity automata
, 2004
"... Abstract. Let be a class of (possibly nondeterministic) language acceptors with a oneway input tape. A system of automata in, is composable if for every string of symbols accepted by, there is an assignment of each symbol in to one of the ’s such that if is the subsequence assigned to, then is accep ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
, then is accepted by. For a nonnegative integer, alookahead delegator for is a deterministic machine in which, knowing (a) the current states! of and the accessible “local ” information of each machine (e.g., the top of the stack if each machine is a pushdown automaton, whether a counter is zero on nonzero if each
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied
On Reachability And Safety In InfiniteState Systems
"... We introduce some new models of infinitestate transition systems. The basic model, called a (reversalbounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversalbounded counters (i.e. each counter can be incremented or decremented by 1 and tested ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We introduce some new models of infinitestate transition systems. The basic model, called a (reversalbounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversalbounded counters (i.e. each counter can be incremented or decremented by 1 and tested
A theory of timed automata
, 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract

Cited by 2651 (32 self)
 Add to MetaCart
of realtime systems whose correctness depends on relative magnitudes of different delays. Consequently, timed automata [7] were introduced as a formal notation to model the behavior of realtime systems. Its definition provides a simple way to annotate statetransition graphs with timing constraints
On finite representations of infinitestate behaviours
 Information Processing Letters
, 1999
"... Abstract. We examine the problem of finitestate representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and ju ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Abstract. We examine the problem of finitestate representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design
Infinitestate games with finitary conditions ∗
"... We study twoplayer zerosum games over infinitestate graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinitestate graphs, memoryless strategies are sufficient for ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study twoplayer zerosum games over infinitestate graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinitestate graphs, memoryless strategies are sufficient
Results 1  10
of
28,355