Skip to main content

Reactive temporal logic

Authors

Rob van Glabbeek

DATA61

UNSW Sydney

Abstract

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

BibTeX Entry

  @inproceedings{vanGlabbeek_20_2,
    author           = {van Glabbeek, Rob},
    doi              = {https://doi.org/10.4204/EPTCS.322.6},
    editor           = {{Ornela Dardha \& Jurriaan Rot}},
    month            = aug,
    date             = {2020-8-27},
    year             = {2020},
    keywords         = {Concurrency; reactive systems; temporal logic; {LTL}; process algebra; labelled transition systems;
                        Kripke structures; Petri nets; fair schedulers; mutual exclusion.},
    title            = {Reactive Temporal Logic},
    series           = {Electronic Proceedings in Theoretical Computer Science 322},
    address          = {Online},
    pages            = {51-68},
    volume           = {322},
    booktitle        = {Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on
                        Structural Operational Semantics (EXPRESS/SOS 2020)},
    paperurl         = {https://ts.data61.csiro.au/publications/csiro_full_text//vanGlabbeek_20_2.pdf},
    publisher        = {Open Publishing Association}
  }

Download

Served by Apache on Linux on seL4.