Results 1  10
of
1,932,620
Generalized ModelChecking Over Locally TreeDecomposable Classes
"... It has been proved in [12] that properties of graphs or other relational structures that are definable in firstorder logic can be decided in linear time when the input structures are restricted to come from a locally treedecomposable class of structures. Examples of such classes are the class of p ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
of planar graphs or classes of graphs of bounded valence. In this paper, we consider more general computational problems than decision problems. We prove that construction, listing, and counting problems definable in firstorder logic can be solved in linear time on locally treedecomposable classes
Practical Algorithms for MSO ModelChecking on TreeDecomposable Graphs
, 2014
"... In this survey, we review practical algorithms for graphtheoretic problems that are expressible in monadic secondorder logic. Monadic secondorder (MSO) logic allows quantifications over unary relations (sets) and can be used to express a host of useful graph properties such as connectivity, cco ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this survey, we review practical algorithms for graphtheoretic problems that are expressible in monadic secondorder logic. Monadic secondorder (MSO) logic allows quantifications over unary relations (sets) and can be used to express a host of useful graph properties such as connectivity, c
Diagnosing TreeDecomposable Circuits
, 1995
"... This paper describes a diagnosis algorithm called structurebased abduction (SAB) which was developed in the framework of constraint networks [ 12 ] . The algorithm exploits the structure of the constraint network and is most efficient for neartree problem domains. By analyzing the structure ..."
Abstract

Cited by 31 (8 self)
 Add to MetaCart
This paper describes a diagnosis algorithm called structurebased abduction (SAB) which was developed in the framework of constraint networks [ 12 ] . The algorithm exploits the structure of the constraint network and is most efficient for neartree problem domains. By analyzing the structure
Deciding FirstOrder Properties of Locally TreeDecomposable Graphs
 In Proc. 26th ICALP
, 1999
"... . We introduce the concept of a class of graphs being locally treedecomposable. There are numerous examples of locally treedecomposable classes, among them the class of planar graphs and all classes of bounded valence or of bounded treewidth. We show that for each locally treedecomposable cl ..."
Abstract

Cited by 98 (14 self)
 Add to MetaCart
. We introduce the concept of a class of graphs being locally treedecomposable. There are numerous examples of locally treedecomposable classes, among them the class of planar graphs and all classes of bounded valence or of bounded treewidth. We show that for each locally treedecomposable
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 385 (39 self)
 Add to MetaCart
modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 329 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
Symbolic Model Checking without BDDs
, 1999
"... Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis ..."
Abstract

Cited by 910 (74 self)
 Add to MetaCart
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system. In this paper we show how boolean decision procedures, like Stalmarck's Method [16] or the Davis
Problems easy for treedecomposable graphs
 J. of Algorithms
, 1991
"... Abstract. We describe the application of a Bayesian variablenumber samplepath (VNSP) optimization algorithm to yield a robust design for a floating sleeve antenna for hepatic microwave ablation. Finite element models are used to generate the electromagnetic (EM) field distribution in liver given a ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Abstract. We describe the application of a Bayesian variablenumber samplepath (VNSP) optimization algorithm to yield a robust design for a floating sleeve antenna for hepatic microwave ablation. Finite element models are used to generate the electromagnetic (EM) field distribution in liver given
Results 1  10
of
1,932,620