Reactive bisimulation semantics for a process algebra with time-outs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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.
Original languageEnglish
Title of host publicationProceedings 31st International Conference on Concurrency Theory (CONCUR '20)
EditorsI. Konnov, L. Kovács
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages23
ISBN (Electronic)9783959771603
Publication statusPublished - 26 Aug 2020
Event31st International Conference on Concurrency Theory - Vienna, Vienna, Austria
Duration: 1 Sept 20204 Sept 2020

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum für Informatik
ISSN (Electronic)1868-8969


Conference31st International Conference on Concurrency Theory
Abbreviated titleCONCUR 2020
Internet address

Keywords / Materials (for Non-textual outputs)

  • Process algebra
  • time-outs
  • labelled transition systems
  • reactive bisimulation semantics
  • Hennessy–Milner logic
  • modal characterisations
  • recursion
  • complete axiomatisations


Dive into the research topics of 'Reactive bisimulation semantics for a process algebra with time-outs'. Together they form a unique fingerprint.

Cite this