Results 1  10
of
2,763
Truth of duration calculus formulae in timed frames”,
 United Nations University, International Institute for Software Technology,
, 1996
"... Abstract. Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Abstract. Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae
Truth of Duration Calculus Formulae in Timed Frames
 Fundamenta Informaticae
, 1998
"... Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed fram ..."
Abstract
 Add to MetaCart
Duration calculus is a logical formalism designed for expressing and refining realtime requirements for systems. Timed frames are essentially transition systems meant for modeling the timedependent behaviour of programs. We investigate the interpretation of duration calculus formulae in timed
Specifying and Deciding Quantified Discretetime Duration Calculus Formulae using DCVALID
, 2000
"... Quantified Discretetime Duration Calculus (QDDC) is a logic for specifying properties of finite sequences of states. It provides novel interval based modalities to specify how a system evolves with time. In this note, we give the syntax and semantics of logic QDDC. We illustrate the ability of QDDC ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
Quantified Discretetime Duration Calculus (QDDC) is a logic for specifying properties of finite sequences of states. It provides novel interval based modalities to specify how a system evolves with time. In this note, we give the syntax and semantics of logic QDDC. We illustrate the ability
Finding Extremal Models of Discrete Duration Calculus Formulae Using Symbolic Search
 In Proc. AVOCS’2004
, 2004
"... QDDC is a logic for specifying quantitative timing aspects of synchronous programs. Properties such as worstcase response time and latency (when known) can be specified elegantly in this logic and model checked. However, computing these values require finding by trial and error the least/greatest v ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
/greatest value of a parameter k making a formula D(k) valid for a program. In this paper, we discuss how an automata theoretic decision procedure for QDDC together with symbolic search for shortest/longest path can be used to compute the lengths of extremal (least/greatest length) models of a formula D
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
of states. We describe a general method that represents the state space symbolical/y instead of explicitly. The generality of our method comes from using a dialect of the MuCalculus as the primary specification language. We describe a model checking algorithm for MuCalculus formulas that uses Bryant’s
Probabilistic duration calculus for continuous time
 Formal Aspects of Computing
, 1994
"... Abstract. This paper deals with dependability of imperfect implementations concerning given requirements. The requirements are assumed to be written as formulas in Duration Calculus. Implementations are modelled by continuous semiMarkov processes with finite state space, which are expressed in the ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
Abstract. This paper deals with dependability of imperfect implementations concerning given requirements. The requirements are assumed to be written as formulas in Duration Calculus. Implementations are modelled by continuous semiMarkov processes with finite state space, which are expressed
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the ChurchRosser Theorem
 INDAG. MATH
, 1972
"... In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system is ..."
Abstract

Cited by 369 (1 self)
 Add to MetaCart
In ordinary lambda calculus the occurrences of a bound variable are made recognizable by the use of one and the same (otherwise irrelevant) name at all occurrences. This convention is known to cause considerable trouble in cases of substitution. In the present paper a different notational system
Take it NPeasy: Bounded Model Construction for Duration Calculus
, 2002
"... Following the recent successes of bounded modelchecking, we reconsider the problem of constructing models of discretetime Duration Calculus formulae. While this problem is known to be nonelementary when arbitrary length models are considered [Han94], it turns out to be only NPcomplete when const ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Following the recent successes of bounded modelchecking, we reconsider the problem of constructing models of discretetime Duration Calculus formulae. While this problem is known to be nonelementary when arbitrary length models are considered [Han94], it turns out to be only NPcomplete when
Iteration of Simple Formulas in Duration Calculus
, 1998
"... A special kind of smallest fixed point known as iteration is in most cases sufficient for the description of temporal computation processes in Duration Calculus[ZHR91]. In 1994 Dang and Wang introduced an extension of Duration Calculus with iteration [DW94]. They showed how to describe the behaviour ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
A special kind of smallest fixed point known as iteration is in most cases sufficient for the description of temporal computation processes in Duration Calculus[ZHR91]. In 1994 Dang and Wang introduced an extension of Duration Calculus with iteration [DW94]. They showed how to describe
Results 1  10
of
2,763