Results 1  10
of
978
On Complexity Of ModelChecking For The TQL Logic
 IN 3RD IFIP INTERNATIONAL CONFERENCE ON THEORETICAL COMPUTER SCIENCE
, 2004
"... In this paper we study the complexity of the modelchecking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define two distinct fragments of this logic: TL containing only spatial connectives and TL containing spatial connectives and q ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper we study the complexity of the modelchecking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define two distinct fragments of this logic: TL containing only spatial connectives and TL containing spatial connectives
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract

Cited by 3252 (70 self)
 Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
proving or modelchecking in these expressive specification logics. Hence, the implemented BDI systems have tended to use the three major attitudes as data structures, rather than as modal operators. In this paper, we provide an alternative formalization of BDI agents by providing an operational and proof
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
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
An AutomataTheoretic Approach to BranchingTime Model Checking
 JOURNAL OF THE ACM
, 1998
"... Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automatatheoretic techniques ..."
Abstract

Cited by 354 (66 self)
 Add to MetaCart
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing lineartime modelchecking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata
Formal Methods: State of the Art and Future Directions
 ACM Computing Surveys
, 1996
"... ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept, ACM Inc., 1515 Broadway, New York, N ..."
Abstract

Cited by 425 (6 self)
 Add to MetaCart
, formal methods, hardware verification Additional Key Words and Phrases: Software specification, model checking, theorem proving 1. INTRODUCTION Hardware and software systems will inevitably grow in scale and functionality. Because of this increase in complexity, the likelihood of subtle errors is much
Model Checking of Probabilistic and Nondeterministic Systems
, 1995
"... . The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. ..."
Abstract

Cited by 291 (13 self)
 Add to MetaCart
. In this paper, we present modelchecking algorithms for extensions of pCTL and pCTL* to systems in which the probabilistic behavior coexists with nondeterminism, and show that these algorithms have polynomialtime complexity in the size of the system. This provides a practical tool for reasoning
ModelChecking Timed Temporal Logics
"... In this paper, we present several timed extensions of temporal logics, that can be used for modelchecking realtime systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results. 1 ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
In this paper, we present several timed extensions of temporal logics, that can be used for modelchecking realtime systems. We give different formalisms and the corresponding decidability/complexity results. We also give intuition to explain these results. 1
Modelchecking hierarchical structures
 In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005), Chicago (USA). IEEE Computer
, 2005
"... Hierarchical graph definitions allow a modular description of structures using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions allow to specify structures of exponential size using polynomial size descriptions. In many cases, this suc ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
, this succinctness increases the computational complexity of decision problems when input structures are defined hierarchically. In this paper, the modelchecking problem for firstorder logic (FO), monadic secondorder logic (MSO), and secondorder logic (SO) on hierarchically defined input structures
Results 1  10
of
978