Results 1  10
of
1,227
Duration Calculus of Weakly Monotonic Time
"... We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (W DC). It allows effects such as true synchrony and digitisation to be ..."
Abstract

Cited by 23 (11 self)
 Add to MetaCart
We extend Duration Calculus to a logic which allows description of Discrete Processes where several steps of computation can occur at the same time point. The resulting logic is called Duration Calculus of Weakly Monotonic Time (W DC). It allows effects such as true synchrony and digitisation
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
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds with Fully Specified Actions
 Knowledge Representation and Defeasible Reasoning
, 1990
"... . The paper is concerned with the succinct axiomatization and ecient deduction of nonchange, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only actio ..."
Abstract

Cited by 152 (5 self)
 Add to MetaCart
. The paper is concerned with the succinct axiomatization and ecient deduction of nonchange, within McCarthy and Hayes' Situation Calculus. The idea behind the proposed approach is this: suppose that in a room containing a man, a robot and a cat as the only potential agents, the only
Formalising Scheduling Theories in Duration Calculus
, 2000
"... Correctness of real time scheduling algorithms has traditionally been argued in adhoc manners using natural languages. Proofs in this way are often unreliable. Work has been done on using a formal logic, in particular Duration Calculus, a real time interval temporal logic, to specify the algorithms ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Correctness of real time scheduling algorithms has traditionally been argued in adhoc manners using natural languages. Proofs in this way are often unreliable. Work has been done on using a formal logic, in particular Duration Calculus, a real time interval temporal logic, to specify
Duration calculus:
"... Abstract. Among the possible approaches for expressing realtime problems with the B method, two are dominant: the use of the usual B mechanisms to define temporal constraints on the one hand, and extending B through another formalism more adapted to the realtime context on the other hand. We defin ..."
Abstract
 Add to MetaCart
define here a possible temporal semantic for B, by using a temporal logic (the duration calculus), and we illustrate how this extension affects the proof mechanism used to show the soundness of abstract machines. 1
Towards a Formal Semantics of Verilog using Duration Calculus
 Formal Techniques for RealTime and Fault Tolerant Systems (FTRTFT'98). LNCS
, 1998
"... We formalise the semantics of V \Gamma , a simple version of Verilog hardware description language using an extension of Duration Calculus. The language is simple enough for experimenting formalisation, but contains sufficient features for being practically relevant. V \Gamma programs can exhibi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
exhibit a rich variety of computations, and it is therefore necessary to extend Duration Calculus with several features, including Weakly Monotonic Time, infinite intervals and fixed point operators. The semantics is compositional and can be used as the formal basis of a formal theory of Verilog. Gerardo
Towards a Formal Semantics of Verilog using Duration Calculus?
"... Abstract. We formalise the semantics of V, a simple version of Verilog hardware description language using an extension of Duration Calculus. The language is simple enough for experimenting formalisation, but contains sufficient features for being practically relevant. V programs can exhibit a ric ..."
Abstract
 Add to MetaCart
rich variety of computations, and it is therefore necessary to extend Duration Calculus with several features, including Weakly Monotonic Time, infinite intervals and fixed point operators. The semantics is compositional and can be used as the formal basis of a formal theory of Verilog. 1 Introduction
Temporal contiguity requirements for longterm associative potentiation/depression in the hippocampus
 Neuroscience
, 1983
"... AbstractA previous study utilizing the powerful ipsilateral and weak crossed projection from the entorhinal cortex to the dentate gyrus in the rat revealed that longterm potentiation is an associative process in these systems. If the weak crossed projection alone receives potentiating stimulation ..."
Abstract

Cited by 186 (4 self)
 Add to MetaCart
AbstractA previous study utilizing the powerful ipsilateral and weak crossed projection from the entorhinal cortex to the dentate gyrus in the rat revealed that longterm potentiation is an associative process in these systems. If the weak crossed projection alone receives potentiating stimulation
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
Liveness and Fairness in Duration Calculus
 In CONCUR'94: Concurrency Theory, LNCS 836
, 1994
"... . This paper embeds durations in an interval temporal logic proposed by Venema. The resulting logic, DCL, is a conservative extension of the original Duration Calculus with two extra chopping operators. In contrast to the original Duration Calculus, DCL can be used to specify and verify abstract liv ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. This paper embeds durations in an interval temporal logic proposed by Venema. The resulting logic, DCL, is a conservative extension of the original Duration Calculus with two extra chopping operators. In contrast to the original Duration Calculus, DCL can be used to specify and verify abstract
Results 1  10
of
1,227