Results 1  10
of
43
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 20 (9 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 to be modelled. As an example of this, we formulate a novel semantics of Timed CSP assuming that the communication and computation take no time.
The UniForM Workbench, a Universal Development Environment for Formal Methods
 FM'99
, 1999
"... The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, realtime or reactive systems, transformation, verification, validation and testing. Moreover, it... ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, realtime or reactive systems, transformation, verification, validation and testing. Moreover, it...
Combining Specification Techniques for Processes, Data and Time
 Nordic Journal of Computing
, 2002
"... We present a new combination CSPOZDC of three well researched formal techniques for the specification of processes, data and time: CSP [17], ObjectZ [36], and Duration Calculus [40]. The emphasis is on a smooth integration of the underlying semantic models and its use for verifying properties ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
We present a new combination CSPOZDC of three well researched formal techniques for the specification of processes, data and time: CSP [17], ObjectZ [36], and Duration Calculus [40]. The emphasis is on a smooth integration of the underlying semantic models and its use for verifying properties of CSPOZDC specifications by a combined application of the modelcheckers FDR [29] for CSP and UPPAAL [1] for Timed Automata. This approach is applied to part of a case study on radio controlled railway crossings.
Sensors and Actuators in TCOZ
 FM’99: WORLD CONGRESS ON FORMAL METHODS, LECT. NOTES IN COMPUT. SCI
, 1999
"... Timed Communicating Object Z (TCOZ) combines ObjectZ's strengths in modeling complex data and algorithms with Timed CSP's strengths in modeling realtime concurrency. TCOZ inherits CSP's channelbased communication mechanism, in which messages represent discrete synchronisations between process ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
Timed Communicating Object Z (TCOZ) combines ObjectZ's strengths in modeling complex data and algorithms with Timed CSP's strengths in modeling realtime concurrency. TCOZ inherits CSP's channelbased communication mechanism, in which messages represent discrete synchronisations between processes. The purpose of most control systems is to observe and control analog components. In such cases, the interface between the control system and the controlled systems cannot be satisfactorily described using the channel mechanism. In order to address this problem, TCOZ is extended with continuousfunction interface mechanisms inspired by process control theory, the sensor and the actuator. The utility of these new mechanisms is demonstrated through their application to the design of an automobile cruise control system.
Automata over Continuous Time
 Theoretical Computer Science
, 1998
"... The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of nite memory retrospective functions is the set of functions realized by nite state devices. We show that the nite memory retros ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of nite memory retrospective functions is the set of functions realized by nite state devices. We show that the nite memory retrospective functions are speedindependent, i.e., they are invariant under `stretchings' of the time axis. Therefore, such functions cannot deal with metrical aspects of the reals.
Modelchecking of specifications integrating processes, data and time
 In FM 2005, volume 3582 of LNCS
, 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 d ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
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
Interval Duration Logic: Expressiveness and Decidability
, 2002
"... We investigate a variant of densetime Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time con ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We investigate a variant of densetime Duration Calculus which permits model checking using timed/hybrid automata. We define a variant of the Duration Calculus, called Interval Duration Logic, (IDL), whose models are timed state sequences [1]. A subset LIDL of IDL consisting only of located time constraints is presented. As our main result, we show that the models of an LIDL formula can be captured as timed state sequences accepted by an eventrecording integrator automaton. A tool called IDLVALID for reducing LIDL formulae to integrator automata is briefly described. Finally, it is shown that LIDL has precisely the expressive power of eventrecording integrator automata, and that a further subset LIDL corresponds exactly to eventrecording timed automata [2]. This gives us an automatatheoretic decision procedure for the satisfiability of LIDL formulae.
Sequential Calculus.
 Information Processing Letters
, 1994
"... This paper presents an algebraic calculus like the relational calculus for reasoning about sequential phenomena. It provides a common foundation for several proposed models of concurrent or reactive systems. It is clearly differentiated from the relational calculus by absence of a general converse o ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
This paper presents an algebraic calculus like the relational calculus for reasoning about sequential phenomena. It provides a common foundation for several proposed models of concurrent or reactive systems. It is clearly differentiated from the relational calculus by absence of a general converse operation. This permits the treatment of temporal logic within the sequential calculus. 1 Introduction and general axioms.
Formal Reasoning with Verilog HDL
 In Workshop on Formal Techniques for Hardware and Hardwarelike Systems, Marstrand
, 1998
"... Most hardware verification techniques tend to fall under one of two broad, yet separate caps: simulation or formal verification. This paper briefly presents a framework in which formal verification plays a crucial role within the standard approach currently used by the hardware industry. As a basis ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Most hardware verification techniques tend to fall under one of two broad, yet separate caps: simulation or formal verification. This paper briefly presents a framework in which formal verification plays a crucial role within the standard approach currently used by the hardware industry. As a basis for this, the formal semantics of Verilog HDL are defined, and properties about synchronization and mutual exclusion algorithms are proved.
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 8 (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 in the paper as finite automata with stochastic delays of state transitions. A probabilistic model for Duration Calculus formulas is introduced, so that the satisfaction probabilities of Duration Calculus formulas with respect to semiMarkov processes can be defined, reasoned about and calculated through a set of axioms and rules of the model. 1.