The University of New South Wales

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

Download