Results 1 
3 of
3
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
Some Decidability Results for Duration Calculus under Synchronous Interpretation
 FORMAL TECHNIQUES IN REALTIME AND FAULTTOLERANT SYSTEMS (FTRTFT'98), VOLUME 1486 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1998
"... Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidab ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Duration Calculus (or DC in short) presents a formal notation to specify properties of realtime systems and a calculus to formally prove such properties. Decidability is the underlying foundation to automated reasoning. But, excepting some of its simple fragments, DC has been shown to be undecidable. DC takes the set of real numbers to represent time. The main reason of undecidability comes from the assumption that, in a realtime system, state changes can occur at any time point. But an implementation of a specification is ultimately executed on a computer, and there states change according to a system clock. Under such an assumption, it has been shown that the decidability results can be extended to cover relatively richer subsets of DC. In this paper, we extend such decidability results to still richer subsets of DC.
Software Technology RealTime Systems Development with Duration Calculi: an Overview
, 2002
"... Training Centre of the United Nations University (UNU). It is based in Macau, and was founded in ..."
Abstract
 Add to MetaCart
(Show Context)
Training Centre of the United Nations University (UNU). It is based in Macau, and was founded in