Succinctness Gap between Monadic Logic and Duration Calculus

Authors:
A. Rabinovich
Affiliations:
(Correspd.) Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel. e.mail: rabino@math.tau.ac.il
Venue:
Fundamenta Informaticae
Year:
2000

Citing 7
Cited 1

The complexity of propositional linear temporal logics

Journal of the ACM (JACM)
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-elementary lower bound for propositional duration calculus

Information Processing Letters
Expressive completeness of duration calculus

Information and Computation - Special issue on EXPRESS 1997
Specifying and Verifying Requirements of Real-Time Systems

IEEE Transactions on Software Engineering
Proceedings of the First International Conference on Temporal Logic

ICTL '94 Proceedings of the First International Conference on Temporal Logic
Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic

On the succinctness of some modal logics

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [8, 11] the expressive completeness of the Propositional fragment of Duration Calculus relative to monadic first-order logic of order was established. In this paper we show that there is at least an exponential blow-up in every meaning preserving translation from monadic logic to PDC. Hence, there exists an exponential gap between the succinctness of monadic logic and that of duration calculus.