On the Undecidability of Asynchronous Session Subtyping
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 9406
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-54458-7_26
- Title of conference / published proceedings
- Proceedings of the International Conference on Foundations of Software Science and Computation Structures - FoSSaCS 2017
- First page
- 441
- Volume
- 10203
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- March
- Year of publication
- 2017
- URL
-
https://kar.kent.ac.uk/62265/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is significant because it proves the undecidability of the asynchronous subtyping for session types, which was thought to be decidable since 2009. This was a crucial problem, which a number of independent researchers were competing to solve. As a consequence of our work, the focus in the field shifted from finding efficient algorithms to identifying useful decidable subclasses. The proof relies on observing a deeper connection between communicating automata and session types, which has clarified the link between these two fundamental models of concurrency.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
