Reactive temporal logic
Authors
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,
address = {Online},
author = {van Glabbeek, Robert},
booktitle = {Combined 27th International Workshop on Expressiveness in Concurrency and 17th Workshop on
Structural Operational Semantics (EXPRESS/SOS 2020)},
date = {2020-8-27},
doi = {https://doi.org/10.4204/EPTCS.322.6},
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.},
month = aug,
pages = {51-68},
paperurl = {https://trustworthy.systems/publications/full_text/vanGlabbeek_20_3.pdf},
publisher = {Open Publishing Association},
series = {Electronic Proceedings in Theoretical Computer Science 322},
title = {Reactive Temporal Logic},
volume = {322},
year = {2020}
}
Full text
BibTeX