Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Barua, Suman Roy, Chaochen Zhou (1999)
Completeness of Neighbourhood Logic
Chaochen Zhou, M. Hansen, A. Ravn, H. Rischel (1992)
Duration Specifications for Shared Processors
Thomas Bolander, Jens Hansen, M. Hansen (2007)
Decidability of a Hybrid Duration Calculus
(1990)
Interval tenselogic
T. Rasmussen (1999)
Signed Interval Logic
R. Alur, C. Courcoubetis, T. Henzinger, Pei-Hsin Ho (1992)
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems
Chaochen Zhou, C. Hoare, A. Ravn (1991)
A Calculus of DurationsInf. Process. Lett., 40
P. Pandya (1995)
Some extensions to mean-value calculus: expressiveness and de-cidability
(1998)
A sound proof system for duration calculus with neighbourhoodmodaliti es
V. Goranko, A. Montanari, G. Sciavicco (2004)
A Road Map of Interval Temporal Logics and Duration CalculiJournal of Applied Non-Classical Logics, 14
R. Alur (1999)
Timed Automata
L. Lamport (1992)
Hybrid Systems in TLA+
B. Dutertre (1995)
Complete proof systems for first order interval temporal logicProceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
(1988)
INMOSlimited occam 2
Chaochen Zhou (2004)
Duration Calculus: A Formal Approach to Real-Time Systems
T. Rasmussen (2002)
Interval logic. Proof theory and theorem proving
A. Rabinovich (1998)
On the Decidability of Continuous Time Specification FormalismsJ. Log. Comput., 8
A. Rabinovich (2000)
Expressive Completeness of Duration CalculusInf. Comput., 156
Y. Venema (1991)
A Modal Logic for Chopping IntervalsJ. Log. Comput., 1
(1988)
INMOS limited occam 2. Prentice Hall. reference manual
Y. Venema (1990)
Expressiveness and Completeness of an Interval Tense LogicNotre Dame J. Formal Log., 31
B. Moszkowski (1985)
A Temporal Logic for Multilevel Reasoning about HardwareComputer, 18
M. Hansen, Chaochen Zhou (1991)
Semantics and Completeness of Duration Calculus
Hanpin Wang, Qiwen Xu (2004)
Completeness of temporal logics over infinite intervalsDiscret. Appl. Math., 136
B. Moszkowski (1995)
Compositional reasoning about projected and infinite timeProceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95
Joseph Halpern, Y. Shoham (1991)
A propositional modal logic of time intervals
Chaochen Zhou, D. Hung, Xiaoshan Li (1995)
A Duration Calculus with Infinite Intervals
Roni Rosner, A. Pnueli (1986)
A Choppy Logic
(1990)
Control program for a gas burner: Part 1: Informal requirements, process case study 1
Chaochen Zhou, M. Hansen (1997)
An Adequate First Order Interval Logic
J. Büchi (1990)
On a Decision Method in Restricted Second Order Arithmetic
Suman Roy, Zhou Chaochen (1997)
Notes on Neighbourhood Logic
Z. Manna, A. Pnueli (1992)
Verifying Hybrid Systems
Chaochen Zhou, M. Hansen, P. Sestoft (1993)
Decidability and Undecidability Results for Duration Calculus
Chaochen Zhou, A. Ravn, M. Hansen (1992)
An Extended Duration Calculus for Hybrid Real-Time Systems
(1990)
Control program for a gas burner: Part 1: Informal requirements, processcase study 1. Technical report, ProCoSReport. ID/DTH EVS2
J. Skakkebæk (1994)
Liveness and Fairness in Duration Calculus
M. Hansen, Chaochen Zhou (1997)
Duration calculus: Logical foundationsFormal Aspects of Computing, 9
P. Pandya (2000)
Specifying and Deciding Quantified Discrete-time Duration Calculus Formulae using DCVALID
To reason about continuous processes in some areas of artificial intelligence and embedded systems one has to express real-time properties. For such purpose a real-time logic has to be considered. Various such logics have been proposed. Some of these formalisms interpret formulas over intervals of time. These are called interval logics. Zhou Chaochen and Michael Hansen have introduced one such first-order interval logic called Neighborhood Logic (NL) which has two expanding modalities ◊r and ◊l. They have shown the adequacy of these modalities by deriving other unary and binary modalities from them; in particular, they show that chop can be expressed in terms of these modalities. The logic is subsequently expanded to get a Duration Calculus (called DC/NL) by expressing temporal variables as integrals of state variables. Liveness and fairness properties of a computing system can now be expressed in DC/NL by means of neighborhood (expanding) modalities. We take up an investigation of DC/NL in detail. We present a proof system for it. We further show that most of the results that hold in the original Duration Calculus continue to hold in our logic with some modifications. In this process we discuss soundness, completeness, and decidability results for DC/NL. Thus this paper establishes DC/NL as a useful formalism for specifying and verifying properties of real-time computing systems.
Journal of Applied Non-Classical Logics – Taylor & Francis
Published: Jan 1, 2010
Keywords: interval temporal logic; neighborhood modalities; Duration Calculus; finite variability; completeness; decidability; liveness properties
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.