Results 1 
6 of
6
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
(Show Context)
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
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
(Show Context)
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 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 for this representation structure. We apply this procedure and the automatatheoretic approach to modelchecking to define new modelchecking algorithms for pushdown systems and both linear and branchingtime properties. From these results we derive upper bounds for several modelchecking problems, and we also provide matching lower bounds, using reductions based on some techniques introduced by Walukiewicz.
Memory Efficient State Storage in SPIN
 In Proceedings of the 2nd SPIN Workshop
, 1996
"... The use of an Ordered Binary Decision Diagram (OBDD) to store all visited states during onthefly model checking (or reachability analysis) is investigated. To improve the time and space efficiency a state compression technique is introduced. This compression technique is safe, in the sense that no ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
The use of an Ordered Binary Decision Diagram (OBDD) to store all visited states during onthefly model checking (or reachability analysis) is investigated. To improve the time and space efficiency a state compression technique is introduced. This compression technique is safe, in the sense that no two unique states will have the same compressed representation. A number of examples are used to evaluate an experimental implementation of the OBDD state store within the SPIN validation tool. In all the examples a reduction in space is achieved when using the OBDD state store as opposed to the more traditional hash table state store. The memory and time usage when combining partial orders with the OBDD state store is also considered. 1 Introduction Temporal logics can express changes over time without introducing time explicitly and is therefore suitable for specifying many correctness properties of concurrent systems. Since many interesting programs can be modelled as finitestate system...
A ConstraintOriented Service Creation Environment
 IN PACT'96, 2ND INTERNATIONAL CONFERENCE ON PRACTICAL APPLICATION OF CONSTRAINT TECHNOLOGY
, 1996
"... The challenge of this joint project was to design and implement an environment for the creation of advanced telephone services (Intelligent Network Services) on the basis of a library of basic service components going beyond standard 'clipboardarchitectures' with some testing support. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
The challenge of this joint project was to design and implement an environment for the creation of advanced telephone services (Intelligent Network Services) on the basis of a library of basic service components going beyond standard 'clipboardarchitectures' with some testing support. The novelty of our approach consists of introducing a declarative specification layer, which is used for the construction of the desired services according to global constraints guaranteeing executability and other consistency conditions. These constraints are the basis for an online verification via model checking during the interactive service design process. Important for the success of the method is the high performance and the availability of diagnostic information in the case of failure: Several hundred constraints must be checked in realtime, and the diagnostic information must reflect the responsible constraint violation as concisely as possible, while preserving as much of the structure of the developed service as possible. The corresponding product was presented by Siemens Nixdorf at the Telecom'95 in Geneva and will reach the market this year.
Automatic Synthesis of Linear Process Models from Temporal Constraints  An Incremental Approach
 IN ACM/SIGPLAN INT. WORKSHOP ON AUTOMATED ANALYSIS OF SOFTWARE (AAS’97
, 1997
"... We present PMMetaFrame, a tool for automatic synthesis (i.e. prior to any enaction) of linear process models from specifications written as global constraints in linear time temporal logic. Key to ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We present PMMetaFrame, a tool for automatic synthesis (i.e. prior to any enaction) of linear process models from specifications written as global constraints in linear time temporal logic. Key to
Contents
"... Simple interactions can have consequences that are not predictable by intuition based on biological experience alone. Lee A. Segel, (1980). ed. ..."
Abstract
 Add to MetaCart
Simple interactions can have consequences that are not predictable by intuition based on biological experience alone. Lee A. Segel, (1980). ed.