Temporal Logic with Past is Exponentially More Succinct - Archive ouverte HAL
Article Dans Une Revue Bulletin- European Association for Theoretical Computer Science Année : 2003

Temporal Logic with Past is Exponentially More Succinct

Résumé

We positively answer the old question whether temporal logic with past is more succinct than pure-future temporal logic. Surprisingly, the proof is quite simple and elementary, although the question has been open for twenty years.
Fichier principal
Vignette du fichier
NM-succinct.pdf (129.34 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01194627 , version 1 (07-09-2015)

Identifiants

  • HAL Id : hal-01194627 , version 1

Citer

Nicolas Markey. Temporal Logic with Past is Exponentially More Succinct. Bulletin- European Association for Theoretical Computer Science, 2003, 79, pp.122-128. ⟨hal-01194627⟩
253 Consultations
1541 Téléchargements

Partager

More