Alexander Rabinovich  Home/Search
Context Related
| math.tau.ac.il/~rabi...expressdc.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.tau.ac.il/~rabinoa...journal (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper compares the expressive power of first-order monadic logic of order, a fundamental formalism in mathematical logic and the theory of computation, with that of the Propositional version of Duration Calculus (PDC), a formalism for the specification of realtime systems. (Update)
Context of citations to this paper: More
.... user s viewpoint, e.g. on temporal or duration logics to specify requirements (see e.g. Pnu77] CHR91] MP92] Han94] Var96] Rab98a] and, say, on timed automata to specify algorithms [AD94] LSVW96] ACH 95] So we are approaching the veri cation problem from...
...semantics of DC. Let us note here that the basic semantical relation is whether a formula D holds on an interval I. It was shown in [12, 11] that the propositional fragment of DC is a fragment of first order monadic logic of order. Hence for every formula D of Propositional...
Cited by: More
A First Order Logic for Specification of Timed.. - Danièle.. (1999) (Correct)
Logics of Metric Spaces - Kutz, Sturm, Suzuki, Wolter.. (2001) (Correct)
Specifying and Deciding Quantified Discrete-time Duration.. - Pandya (2000) (Correct)
Similar documents (at the sentence level):
53.0%: Expressive Completeness of Duration Calculus - Rabinovich (2000) (Correct)
Active bibliography (related documents): More All
1.7: On Expressive Completeness of Duration and Mean Value Calculi.. - Rabinovich (1997) (Correct)
0.9: Succinctness Gap between Monadic Logic and Duration Calculus - Rabinovich (1997) (Correct)
0.6: Star Free Expressions over the Reals - Rabinovich (1997) (Correct)
Similar documents based on text: More All
0.3: Complexity of Equivalence Problems for Concurrent Systems of.. - Rabinovich (1995) (Correct)
0.3: Expressive Completeness of Temporal Logic of Action - Rabinovich (Correct)
0.3: Quantitative Temporal Logic - Yoram Hirshfeld (1998) (Correct)
Related documents from co-citation: More All
3: Theoretical Computer Science (context) - Alur, Dill et al. - 1994
3: Tense logic and the theory of linear order (context) - Kamp - 1968
2: Specifying and verifying requirements of real-time systems (context) - Hansen, Ravn et al. - 1991
BibTeX entry: (Update)
A. Rabinovich. Expressive Completeness of Duration Calculus. Information and Computation, Vol. 156, No. 1/2, pp. 320-344, 2000. http://citeseer.ist.psu.edu/rabinovich01expressive.html More
@article{ rabinovich00expressive,
author = "Alexander Moshe Rabinovich",
title = "Expressive Completeness of Duration Calculus",
journal = "Information and Computation",
volume = "156",
number = "1-2",
pages = "320-344",
year = "2000",
url = "citeseer.ist.psu.edu/rabinovich01expressive.html" }
Citations (may not include all citations):625 ACM Transactions on Programming Languages and Systems (context) - Lamport, Logic - 1994
281 Information processing Letters (context) - Chaochen, Hoare et al. - 1991
163 the temporal analysis of fairness (context) - Gabbay, Pnueli et al. - 1980
140 Tense logic and the theory of linear order (context) - Kamp - 1968
127 Counter-free automata (context) - McNaughton, Papert - 1971
103 Specifying and verifying requirement of real time systems (context) - Ravn, Richel et al. - 1993
90 Duration Calculus: Logical Foundations (context) - Hansen, Chaochen - 1997
63 Design of Embedded Real Time Computing Systems (context) - Ravn - 1995
31 Reasoning about Digital Circuits (context) - Moszkowski - 1983
29 A mean value calculus of duration (context) - Chaochen, Xiaoshan - 1994
22 Mathematical Logic (context) - Monk - 1976
20 A duration Calculus with Infinite Intervals - Chaochen, Hung et al. - 1995
9 The complexity of decision problems in automata and logic (context) - Stockmeyer - 1974
8 Some extensions to Propositional Mean Value Calculus: Expres.. (context) - Pandya - 1995
7 Non-elementary Lower Bound for Propositional Duration Calcul.. - Rabinovich - 1998
7 Specification of Embedded Real time Systems (context) - Skakkbak, Ravn et al. - 1992
6 On Expressive Completeness of Duration and Mean Value Calcul.. - Rabinovich - 1997
6 Decidability and undecidablity results for Duration Calculus (context) - Chaochen, Hansen et al. - 1993
5 Hodkinson and M (context) - Gabbay - 1994
3 A Universal Continuous Time Specification Formalism (context) - Rabinovich
3 Star Free regular sets of #-sequences (context) - Thomas - 1979
3 Star Free expressions over the reals - Rabinovich
2 Succinctness Gap between Monadic Logic and Duration Calculus - Rabinovich - 1997
1 Liveness and Fairness in Duration Calculus (context) - Skakkbak - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~rabinoa/journal.html): More
Decidability of Split Equivalence - Abramson, Rabinovich (1998) (Correct)
Automata over Continuous Time - Rabinovich (1998) (Correct)
Counting on CTL*: On the Expressive Power of Monadic Path Logic - Moller, Rabinovich (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC