A hierarchy of partial order temporal properties

Marta Kwiatkowska, Doron Peled, Wojciech Penczek

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We propose a classification of partial order temporal properties into a hierarchy, which is a generalization of the safety-progress hierarchy of Chang, Manna and Pnueli. The classes of the hierarchy are characterized through three views: language-theoretic, topological and temporal. Instead of the domain of strings, we take the domain of Mazurkiewicz traces as a basis for our considerations. For the language-theoretic view, we propose operations on trace languages which define the four main classes of properties: safety, guarantee, persistence and response. These four classes are shown to correspond precisely to the two lower levels of the Borel hierarchy of the Scott topology of the domain of traces relativized to the infinite traces. In addition, a syntactic characterization of the classes is provided in terms of a sublogic of the Generalized Interleaving Set Temporal Logic GISTL (an extension of ISTL).

Original languageEnglish
Title of host publicationTemporal Logic - 1st International Conference, ICTL 1994, Proceedings
EditorsDov M. Gabbay, Hans Jurgen Ohlbach
PublisherSpringer Verlag
Pages398-414
Number of pages17
ISBN (Print)9783540582410
DOIs
StatePublished - 1994
Externally publishedYes
Event1st International Conference on Temporal Logic, ICTL 1994 - Bonn, Germany
Duration: 11 Jul 199414 Jul 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume827 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Conference on Temporal Logic, ICTL 1994
Country/TerritoryGermany
CityBonn
Period11/07/9414/07/94

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.

Funding

Central to both approaches is the space Z ~ of infinite strings (words) over a given alphabet Z. Each infinite string (of states or events) models a possible * Supported in part by CEC grant CIPA3510PL927369. Visiting Academic at the Department of Computing, Imperial College, for the duration of the Nuffield Science Foundation Fellowship SCI/124/528/G. ** On leave from Institute of Computer Science, PAS, Warsaw, Poland. Supported in part by CEC grant CIPA3510PL927370 and by the Polish grant No. 2 2047 9203.

FundersFunder number
Indian Institute of Science
FP7 SpaceCIPA3510PL927369
Nuffield FoundationSCI/124/528/, SCI/124/528/G.
Polska Akademia Nauk2 2047 9203, 2047 9203
Birla Institute of Technology and Science, PilaniCIPA3510PL927370

    Fingerprint

    Dive into the research topics of 'A hierarchy of partial order temporal properties'. Together they form a unique fingerprint.

    Cite this