Results 1  10
of
4,527,725
Fairness for InfiniteState Systems
, 2014
"... In this paper we introduce the first known tool for symbolically proving fairCTL properties of (infinitestate) integer programs. Our solution is based on a reduction to existing techniques for fairnessfree CTL model checking via the use of infinite nondeterministic branching to symbolically part ..."
Abstract
 Add to MetaCart
In this paper we introduce the first known tool for symbolically proving fairCTL properties of (infinitestate) integer programs. Our solution is based on a reduction to existing techniques for fairnessfree CTL model checking via the use of infinite nondeterministic branching to symbolically
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
General Decidability Theorems for InfiniteState Systems
, 1996
"... ) Parosh Aziz Abdulla Uppsala University K¯arlis Cer¯ans University of Latvia Bengt Jonsson Uppsala University YihKuen Tsay National Taiwan University Abstract Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state sys ..."
Abstract

Cited by 140 (19 self)
 Add to MetaCart
) Parosh Aziz Abdulla Uppsala University K¯arlis Cer¯ans University of Latvia Bengt Jonsson Uppsala University YihKuen Tsay National Taiwan University Abstract Over the last few years there has been an increasing research effort directed towards the automatic verification of infinite state
On Model Checking InfiniteState Systems
 In Nerode and Matiyasevich, editors, LFCS'94: Logic at St. Petersburg. Symposium on Logical Foundations of Computer Science
, 1994
"... This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal ¯calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Bradfield and Stirling ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal ¯calculus. The method is sound and complete relative to externally proving inclusions of sets of states. It can be seen as a recast of a tableau method due to Bradfield and Stirling
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
Computing abstractions of infinite state systems compositionally and automatically
 PROCEEDINGS OF CAV ’98
, 1998
"... We present a method for computing abstractions of infinite state systems compositionally and automatically. Given a concrete system S = S1 k \Delta \Delta \Delta k Sn of programs and given an abstraction function ff, using our method one can compute an abstract system S a = Sa 1 k \Delta \Delta \Del ..."
Abstract

Cited by 108 (6 self)
 Add to MetaCart
We present a method for computing abstractions of infinite state systems compositionally and automatically. Given a concrete system S = S1 k \Delta \Delta \Delta k Sn of programs and given an abstraction function ff, using our method one can compute an abstract system S a = Sa 1 k \Delta \Delta
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
Model Checking and Deduction for InfiniteState Systems
"... Two wellknown approaches to the verification of reactive systems are deductive verification and model checking. After briefly reviewing them, we present deductive model checking, which combines these two approaches. The new procedure uses deduction to extend the classical tableaubased model checki ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
checking algorithms to the case of infinitestate systems.
Models of InfiniteState Systems with Constraints
, 2001
"... We extend a widely used concept of rewrite systems with a mechanism for computing with partial information in a form similar to the one used in concurrent constraint programming. We present how this extension changes the expressive power of rewrite systems classes which are included in Mayr’s PRS ..."
Abstract
 Add to MetaCart
We extend a widely used concept of rewrite systems with a mechanism for computing with partial information in a form similar to the one used in concurrent constraint programming. We present how this extension changes the expressive power of rewrite systems classes which are included in Mayr’s PRS
On Model Checking for NonDeterministic InfiniteState Systems
, 1998
"... We demonstrate that many known algorithms for model checking infinitestate systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the KarpMiller graph for Petri Nets. Each node of the covering graph has an associated nonempty ..."
Abstract
 Add to MetaCart
We demonstrate that many known algorithms for model checking infinitestate systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the KarpMiller graph for Petri Nets. Each node of the covering graph has an associated non
Results 1  10
of
4,527,725