Results 1 
8 of
8
A Road Map of Interval Temporal Logics and Duration Calculi
, 2004
"... We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results. ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.
Modelchecking of specifications integrating processes, data and time
, 2005
"... Abstract. We present a new modelchecking technique for CSPOZDC, a combination of CSP, ObjectZ and Duration Calculus, that allows reasoning about systems exhibiting communication, data and realtime aspects. As intermediate layer we will use a new kind of timed automata that preserve events and ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We present a new modelchecking technique for CSPOZDC, a combination of CSP, ObjectZ and Duration Calculus, that allows reasoning about systems exhibiting communication, data and realtime aspects. As intermediate layer we will use a new kind of timed automata that preserve events and data variables of the specification. These automata have a simple operational semantics that is amenable to verification by a constraintbased abstractionrefinement model checker. By means of a case study, a simple elevator parameterised by the number of floors, we show that this approach admits modelchecking parameterised and infinite state realtime systems. 1
Some progress in satisfiability checking for difference logic
 In FORMATS/FTRTFT
, 2004
"... Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other im ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Abstract. In this paper we report a new SAT solver for difference logic, a propositional logic enriched with timing constraints. The main novelty of our solver is a tighter integration of the incremental analysis of numerical conflicts with the process of Boolean conflict analysis. This and other improvements lead to significant performance gains for some classes of problems. 1
Efficient SAT engines for concise logics: Accelerating proof search for zeroone linear constraint systems
, 2003
"... We investigate the problem of generalizing acceleration techniques as found in recent satisfiability engines for conjunctive normal forms (CNFs) to linear constraint systems over the Booleans. The rationale behind this research is that rewriting the propositional formulae occurring in e.g. bounded m ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
We investigate the problem of generalizing acceleration techniques as found in recent satisfiability engines for conjunctive normal forms (CNFs) to linear constraint systems over the Booleans. The rationale behind this research is that rewriting the propositional formulae occurring in e.g. bounded model checking (BMC) [5] to CNF requires a blowup in either the formula size (worstcase exponential) or in the number of propositional variables (linear, thus yielding a worstcase exponential blowup of the search space). We demonstrate that acceleration techniques like observation lists and lazy clause evaluation [14] as well as the more traditional nonchronological backtracking and learning techniques generalize smoothly to DavisPutnamlike resolution procedures for the very concise propositional logic of linear constraint systems over the Booleans. Despite the more expressive input language, the performance of our prototype implementation comes surprisingly close to that of stateoftheart CNFSAT engines like ZCha [14]. First experiments with bounded modelconstruction problems show that the overhead in the satisfiability engine that can be attributed to the richer input language is often amortized by the conciseness gained in the propositional encoding of the BMC problem.
A Theory of Duration Calculus with Application
"... Abstract. In this chapter we will present selected central elements in the theory of Duration Calculus and we will give examples of applications. The chapter will cover syntax, semantics and proof system for the basic logic. Furthermore, results on decidability, undecidability and modelchecking wil ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Abstract. In this chapter we will present selected central elements in the theory of Duration Calculus and we will give examples of applications. The chapter will cover syntax, semantics and proof system for the basic logic. Furthermore, results on decidability, undecidability and modelchecking will be presented. A few extensions of the basic calculus will be described, in particular, Hybrid Duration Calculus and Duration Calculus with iterations. Furthermore, a case study: the biphase mark protocol, is presented. We will not attempt to be exhaustive in our coverage of topics; but we will provide references for further study. Keywords: Realtime systems, metrictime temporal logic, duration calculus, decidability, modelchecking, application 1 Introduction to Duration Calculus In this chapter we will introduce Durations Calculus (abbreviated DC) [72], present central elements of the theory, and show examples of applications. The aim is not to make a comprehensive presentation of the logic; but rather to cover
Symbolic Test Case Generation for TimeDiscrete Hybrid Systems
"... In this article we present a modelbased test case specification and associated test data generation methods for embedded systems processing Boolean, integral and realvalued variables. Testing experts are relieved from the task of constructing input data to the system under test in an explicit way ..."
Abstract
 Add to MetaCart
In this article we present a modelbased test case specification and associated test data generation methods for embedded systems processing Boolean, integral and realvalued variables. Testing experts are relieved from the task of constructing input data to the system under test in an explicit way and manually calculating the expected reactions. Instead, test cases are specified by means of temporal logic formulae using the Duration Calculus, allowing to describe classes of concrete runs which are considered equivalent for the test objectives to be investigated. The concrete input data to the system under test and its expected reactions are automatically generated using an approach based on interval analysis. Following this approach, test data generation is handled as an interval constraint solving problem. The basic solution technique based on pavings of the solution set and bipartitioning algorithms are accelerated by using a tightly integrated combination of interval constraint propagation and a variety of novel techniques originating from Boolean SAT solving methods, which have been adapted for the mixed Boolean, integer and realvalued variable setting. 1
On Sampling Abstraction of Continuous Time Logic with Durations
"... Abstract. Duration Calculus (DC) is a realtime logic with measurement of duration of propositions in observation intervals. It is a highly expressive logic with continuous time behaviours (also called signals) as its models. Validity checking of DC is undecidable. We propose a method for validity c ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Duration Calculus (DC) is a realtime logic with measurement of duration of propositions in observation intervals. It is a highly expressive logic with continuous time behaviours (also called signals) as its models. Validity checking of DC is undecidable. We propose a method for validity checking of Duration Calculus by reduction to a sampled time version of this logic called well sampled Interval Duration Logic (WSIDL). This reduction relies on representing a continuous time behaviour by a wellsampled behaviour with 1oversampling. We provide weak and strong reductions (abstractions) of logic DC to logic WSIDL which respectively preserve the validity and the counter examples. By combining these reductions with previous work on deciding IDL, we implement a tool for validity checking of Duration Calculus. This provides a partial but practical method for validity checking of Duration Calculus. We present some preliminary experimental results to measure the success of this approach. 1