The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From Communicating Machines to Graphical Choreographies
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
Graphical choreographies, or global graphs, are general multiparty session specifications featuring expressive constructs such as forking, merging, and joining for representing application-level protocols. Global graphs can be directly translated into modelling notations such as BPMN and UML. This paper presents an algorithm whereby a global graph can be constructed from asynchronous interactions represented by communicating finite-state machines (CFSMs). Our results include: a sound and complete characterisation of a subset of safe CFSMs from which global graphs can be constructed; an algorithm to translate CFSMs to global graphs; a time complexity analysis; and an implementation of our theory, as well as an experimental evaluation.
How it got here
How it got here
agent via openalex
Added
2026-10-26 20:43 UTC
Not denied by
a person 2026-10-29 17:12 UTC
Cite it as
@misc{lange2015communicating,
title = {From Communicating Machines to Graphical Choreographies},
author = {Julien Lange and Emilio Tuosto and Nobuko Yoshida},
year = {2015},
journal = {ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)},
pages = {221--232},
doi = {10.1145/2676726.2676964},
}