Branching bisimilarity for processes with time-outs

Gaspard Reghem*, Rob J. van Glabbeek*

*Corresponding author for this work

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

Abstract / Description of output

This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs. Multiple equivalent definitions are procured, along with a modal characterisation and a proof of its congruence property for a standard process algebra with recursion. The last section presents a complete axiomatisation for guarded processes without infinite sequences of unobservable actions.
Original languageEnglish
Title of host publication35th International Conference on Concurrency Theory (CONCUR 2024)
EditorsRupak Majumdar, Alexandra Silva
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Pages1-22
Number of pages22
Volume311
ISBN (Electronic)9783959773393
DOIs
Publication statusPublished - 29 Aug 2024
Event35th International Conference on Concurrency Theory - Calgary, Canada
Duration: 9 Sept 202413 Sept 2024

Publication series

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

Conference

Conference35th International Conference on Concurrency Theory
Abbreviated titleCONCUR 2024
Country/TerritoryCanada
CityCalgary
Period9/09/2413/09/24

Fingerprint

Dive into the research topics of 'Branching bisimilarity for processes with time-outs'. Together they form a unique fingerprint.

Cite this