License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2021.14
URN: urn:nbn:de:0030-drops-143917
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14391/
Bollig, Benedikt ;
Di Giusto, Cinzia ;
Finkel, Alain ;
Laversa, Laetitia ;
Lozes, Etienne ;
Suresh, Amrita
A Unifying Framework for Deciding Synchronizability
Abstract
Several notions of synchronizability of a message-passing system have been introduced in the literature. Roughly, a system is called synchronizable if every execution can be rescheduled so that it meets certain criteria, e.g., a channel bound. We provide a framework, based on MSO logic and (special) tree-width, that unifies existing definitions, explains their good properties, and allows one to easily derive other, more general definitions and decidability results for synchronizability.
BibTeX - Entry
@InProceedings{bollig_et_al:LIPIcs.CONCUR.2021.14,
author = {Bollig, Benedikt and Di Giusto, Cinzia and Finkel, Alain and Laversa, Laetitia and Lozes, Etienne and Suresh, Amrita},
title = {{A Unifying Framework for Deciding Synchronizability}},
booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-203-7},
ISSN = {1868-8969},
year = {2021},
volume = {203},
editor = {Haddad, Serge and Varacca, Daniele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14391},
URN = {urn:nbn:de:0030-drops-143917},
doi = {10.4230/LIPIcs.CONCUR.2021.14},
annote = {Keywords: communicating finite-state machines, message sequence charts, synchronizability, MSO logic, special tree-width}
}
Keywords: |
|
communicating finite-state machines, message sequence charts, synchronizability, MSO logic, special tree-width |
Collection: |
|
32nd International Conference on Concurrency Theory (CONCUR 2021) |
Issue Date: |
|
2021 |
Date of publication: |
|
13.08.2021 |