Results 1 
7 of
7
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.
Automated Temporal Reasoning about Reactive Systems
, 1996
"... . There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective a ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
. There is a growing need for reliable methods of designing correct reactive systems such as computer operating systems and air traffic control systems. It is widely agreed that certain formalisms such as temporal logic, when coupled with automated reasoning support, provide the most effective and reliable means of specifying and ensuring correct behavior of such systems. This paper discusses known complexity and expressiveness results for a number of such logics in common use and describes key technical tools for obtaining essentially optimal mechanical reasoning algorithms. However, the emphasis is on underlying intuitions and broad themes rather than technical intricacies. 1 Introduction There is a growing need for reliable methods of designing correct reactive systems. These systems are characterized by ongoing, typically nonterminating and highly nondeterministic behavior. Examples include operating systems, network protocols, and air traffic control systems. There is w...
Firstorder definable languages
 Logic and Automata: History and Perspectives, Texts in Logic and Games
, 2008
"... We give an essentially selfcontained presentation of some principal results for firstorder definable languages over finite and infinite words. We introduce the notion of a counterfree Büchi automaton; and we relate counterfreeness to aperiodicity and to the notion of very weak alternation. We al ..."
Abstract

Cited by 24 (5 self)
 Add to MetaCart
(Show Context)
We give an essentially selfcontained presentation of some principal results for firstorder definable languages over finite and infinite words. We introduce the notion of a counterfree Büchi automaton; and we relate counterfreeness to aperiodicity and to the notion of very weak alternation. We also show that aperiodicity of a regular ∞language can be decided in polynomial space, if the language is specified by some Büchi automaton. 1
Separating Regular Languages with FirstOrder Logic ∗
"... Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a firstorder definable separator. We prove that in orde ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a firstorder definable separator. We prove that in order to answer this question, sufficient information can be extracted from semigroups recognizing the input languages, using a fixpoint computation. This yields an EXPTIME algorithm for checking firstorder separability. Moreover, the correctness proof of this algorithm yields a stronger result, namely a description of a possible separator. Finally, we prove that this technique can be generalized to answer the same question for regular languages of infinite words.
Temporal Assertions for Sequential and Concurrent Programs
, 2007
"... In this thesis, we present an extension to the wellknown concept of assertions: temporal assertions allow the specification and validation of modal safety properties of an application at runtime. We see this as a necessary step in enforcing the growing number of implicit requirements of software sp ..."
Abstract
 Add to MetaCart
(Show Context)
In this thesis, we present an extension to the wellknown concept of assertions: temporal assertions allow the specification and validation of modal safety properties of an application at runtime. We see this as a necessary step in enforcing the growing number of implicit requirements of software specifications, which are often only informally defined in the documentation of application program interfaces (API) and are beyond the reach of type checkers, compilers, or model checkers. Also, we show how our techniques can be applied to existing programs without modifying the source code. Although, like assertions, our approach cannot prove the absence of errors, it gives the programmer a more powerful means of automatically checking assumptions about his program at runtime. It can also be used to look for behaviour that indicates the potential for problems, that is, that might be used to predict future errors. An example is the Lockorder Reversal pattern which indicates a potential deadlock in a concurrent program. Our parametrised propositions approach gives us a convenient way to handle dynamic