Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,546
Fairness for Infinite-State Systems
, 2014
"... In this paper we introduce the first known tool for symbolically proving fair-CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairness-free CTL model checking via the use of infinite non-deterministic branching to symbolically part ..."
Abstract
- Add to MetaCart
In this paper we introduce the first known tool for symbolically proving fair-CTL properties of (infinite-state) integer programs. Our solution is based on a reduction to existing techniques for fairness-free CTL model checking via the use of infinite non-deterministic branching to symbolically
Verification of Infinite-state Systems
, 2000
"... ion by Syntactic Program Transformations 9 8 Unfoldings of Innite State Systems 9 9 Provability in a Logic for Concurrent Objects is Well-structured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over one-counter processes 12 12 Deciding rst-order non-regular ..."
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 Well-structured! 10 10 On the Complexity of Bisimulation Equivalence 11 11 Simulation and bisimulation over one-counter processes 12 12 Deciding rst-order non
On Model Checking Infinite-State 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 infinite-state 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 infinite-state 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 Infinite-State Systems
"... Timed automata were introduced by Alur and Dill in their seminal work on automatic verification of real-time 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 region-graph technique can be extended to a richer class of infinite-state 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
On Reachability And Safety In Infinite-State Systems
"... We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded 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 infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augmented with finitely many reversal-bounded counters (i.e. each counter can be incremented or decremented by 1 and tested
General Decidability Theorems for Infinite-State Systems
, 1996
"... ) Parosh Aziz Abdulla Uppsala University K¯arlis Cer¯ans University of Latvia Bengt Jonsson Uppsala University Yih-Kuen 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 141 (19 self)
- Add to MetaCart
) Parosh Aziz Abdulla Uppsala University K¯arlis Cer¯ans University of Latvia Bengt Jonsson Uppsala University Yih-Kuen 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
Model Checking and Deduction for Infinite-State Systems
"... Two well-known 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 tableau-based model checki ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
checking algorithms to the case of infinite-state systems.
Models of Infinite-State 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 Non-Deterministic Infinite-State Systems
, 1998
"... We demonstrate that many known algorithms for model checking infinite-state 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-empty ..."
Abstract
- Add to MetaCart
We demonstrate that many known algorithms for model checking infinite-state 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
3,546
