Results 1  10
of
235
On Tableau Constructions for Timing Diagrams
 In NASA Langley Formal Methods Workshop
, 2000
"... Designers often cite unfamiliar notation as one obstacle to wider acceptance of formal methods. Formalizations of design notations, such as timing diagrams, promise to bridge the gap between design practice and formal methods. How to use such formalizations effectively, however, remains an open ques ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
notations as interfaces depends largely on computational tradeoffs. This paper explores this issue in the context of specifying properties for automatatheoretic verification using timing diagrams. Automatatheoretic algorithms perform a tableau construction to convert properties into Büchi automata. We
An Improved Onthefly Tableau Construction For a RealTime Temporal Logic
 In International Conference on Computer Aided Verification
, 2003
"... Temporal logic is popular for specifying correctness properties of reactive systems. Realtime temporal logics add the ability to express quantitative timing aspects. Tableau constructions are algorithms that translate a temporal logic formula into a finitestate automaton that accepts precisely ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Temporal logic is popular for specifying correctness properties of reactive systems. Realtime temporal logics add the ability to express quantitative timing aspects. Tableau constructions are algorithms that translate a temporal logic formula into a finitestate automaton that accepts
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 917 (75 self)
 Add to MetaCart
which reduces model checking to propositional satisfiability. We show that bounded LTL model checking can be done without a tableau construction. We have implemented a model checker BMC, based on bounded model checking, and preliminary results are presented.
The even more irresistible SROIQ
 In KR
, 2006
"... We describe an extension of the description logic underlying OWLDL, SHOIN, with a number of expressive means that we believe will make it more useful in practise. Roughly speaking, we extend SHOIN with all expressive means that were suggested to us by ontology developers as useful additions to OWL ..."
Abstract

Cited by 342 (50 self)
 Add to MetaCart
, transitive, and irreflexive roles, disjoint roles, a universal role, and constructs ∃R.Self, allowing, for instance, the definition of concepts such as a “narcist”. Finally, we consider negated role assertions in Aboxes and qualified number restrictions. The resulting logic is called SROIQ. We present a
Simple Onthefly Automatic Verification of Linear Temporal Logic
, 1995
"... We present a tableaubased algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "onthefly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model. ..."
Abstract

Cited by 327 (29 self)
 Add to MetaCart
We present a tableaubased algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "onthefly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model
A Tableau for CTL*
"... Abstract. We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional version of computation tree logic CTL*. This is the first such tableau. CTL * is an exceptionally important temporal logic with applications from hardware design to a ..."
Abstract
 Add to MetaCart
to agent reasoning but there is no easy automated reasoning approach to CTL*. The tableau here is a traditional treeshaped or topdown style tableau and affords the possibility of reasonably quick decisions on the satisfiability of mediumsized formulas and construction of small models for them. A quick
A really temporal logic
 J. ACM
, 1994
"... We introduce a temporal logic for the specification of realtime systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable f ..."
Abstract

Cited by 303 (28 self)
 Add to MetaCart
We introduce a temporal logic for the specification of realtime systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable
TableauBased Model Checking in the Propositional MuCalculus
 Acta Informatica
, 1990
"... This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses tech ..."
Abstract

Cited by 101 (7 self)
 Add to MetaCart
This paper describes a procedure, based around the construction of tableau proofs, for determining whether finitestate systems enjoy properties formulated in the propositional mucalculus. It presents a tableaubased proof system for the logic and proves it sound and complete, and it discusses
Tableau Systems for SHIO and SHIQ
"... this paper tableau systems for two expressive DLs, the new DLSHIO and the wellknown [5]. Our main results are the following: firstly, we obtain that satisfiability is ExpTimecomplete and can be decided by a tableau algorithm. Secondly, we will see that although these two logics share most of t ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
this paper tableau systems for two expressive DLs, the new DLSHIO and the wellknown [5]. Our main results are the following: firstly, we obtain that satisfiability is ExpTimecomplete and can be decided by a tableau algorithm. Secondly, we will see that although these two logics share most
Automated Synthesis of Tableau Calculi
"... Abstract This paper presents a method for synthesising sound and complete tableau calculi. Given a specification of the formal semantics of a logic, the method generates a set of tableau inference rules which can then be used to reason within the logic. The method guarantees that the generated rules ..."
Abstract

Cited by 12 (11 self)
 Add to MetaCart
rules form a calculus which is sound and constructively complete. If the logic can be shown to admit finite filtration with respect to a welldefined firstorder semantics then adding a general blocking mechanism produces a terminating tableau calculus. The process of generating tableau rules can
Results 1  10
of
235