Skip to main content Accessibility help
×
Hostname: page-component-7c8c6479df-8mjnm Total loading time: 0 Render date: 2024-03-29T09:09:56.657Z Has data issue: false hasContentIssue false

10 - Expressiveness

from PART III - PROPERTIES

Published online by Cambridge University Press:  13 October 2016

Stéphane Demri
Affiliation:
Centre National de la Recherche Scientifique (CNRS), Paris
Valentin Goranko
Affiliation:
Stockholms Universitet
Martin Lange
Affiliation:
Universität Kassel, Germany
Get access

Summary

A formula of a temporal logic expresses a temporal property of interpreted transition systems, for instance in order to specify formally some wanted or some unwanted behaviour of the system. With several logics at hand, a natural question arises that has already been introduced in Chapter 7 with the definition of several syntactic fragments of CTL*: what are the properties that can be formalised in a particular logic? And which ones cannot be formalised? The first question is answered, in a way, by all formulae of that logic, but this answer is pretty much useless for getting an idea of what is possible with that logic. A better way to address these questions is to look at the whole picture of all temporal logics. We can naturally compare two logics L1 and L2 by asking whether every property that is formalisable in L1 can also be formalised in L2. It is easily seen that this yields a preorder on all temporal logics of the same kind, for example all linear-time temporal logics or all branching-time temporal logics. Note that a temporal property can be identified with the class of (rooted) interpreted transition systems that possess this property. Thus, a formula from one logic being expressible by a formula in another logic simply amounts to the two formulae being equivalent in the usual logical sense, i.e. having the same families of models. For linear-time logics this is a family of computation paths, while for branching-time logics it is a family of rooted interpreted transition systems.

A careful analysis of what is possible in which logic should thus give us two hierarchies, of linear-time logics and of branching-time logics.Obviously, itwould be nice to unify them in one big picture which shows the expressive power of every temporal logic. For this we need to be able to compare a linear-time and a branching-time logic, and this can be done by regarding the former as a latter with implicit quantification over computation paths. When we identify a linear-time formula φ with the branching-time property Aφ or Eφ then we should be able to study the relative expressive power of all temporal logics in one big picture.

Type
Chapter
Information
Temporal Logics in Computer Science
Finite-State Systems
, pp. 361 - 418
Publisher: Cambridge University Press
Print publication year: 2016

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Expressiveness
  • Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), Paris, Valentin Goranko, Stockholms Universitet, Martin Lange, Universität Kassel, Germany
  • Book: Temporal Logics in Computer Science
  • Online publication: 13 October 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781139236119.010
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Expressiveness
  • Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), Paris, Valentin Goranko, Stockholms Universitet, Martin Lange, Universität Kassel, Germany
  • Book: Temporal Logics in Computer Science
  • Online publication: 13 October 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781139236119.010
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Expressiveness
  • Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), Paris, Valentin Goranko, Stockholms Universitet, Martin Lange, Universität Kassel, Germany
  • Book: Temporal Logics in Computer Science
  • Online publication: 13 October 2016
  • Chapter DOI: https://doi.org/10.1017/CBO9781139236119.010
Available formats
×