Rajeev Alur, Gerard J. Holzmann & Doron Peled (1996):
An analyzer for message sequence charts.
In: Tiziana Margaria & Bernhard Steffen: TACAS.
Springer,
pp. 35–48,
doi:10.1007/3-540-61042-1_37.
Hanêne Ben-Abdallah & Stefan Leue (1997):
Syntactic detection of process divergence and non-local choice in message sequence charts.
In: International Workshop on Tools and Algorithms for the Construction and Analysis of Systems.
Springer,
pp. 259–274,
doi:10.1007/BFb0035393.
Laura Bocchi, Hernán C. Melgratti & Emilio Tuosto (2014):
Resolving Non-determinism in Choreographies.
In: ESOP,
pp. 493–512,
doi:10.1007/978-3-642-54833-8_26.
Gérard Boudol & Ilaria Castellani (1988):
Permutation of transitions: an event structure semantics for CCS and SCCS.
In: J.W. de Bakker, W.-P. de Roever & G. Rozenberg: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency,
Lecture Notes in Computer Science 354.
Springer,
pp. 411–427,
doi:10.1007/BFb0013028.
Daniel Brand & Pitro Zafiropulo (1983):
On Communicating Finite-State Machines.
Journal of the ACM 30(2),
pp. 323–342,
doi:10.1145/322374.322380.
Marco Carbone, Kohei Honda & Nobuko Yoshida (2007):
A Calculus of Global Interaction based on Session Types.
Electronic Notes in Theoretical Computer Science 171(3),
pp. 127 – 151,
doi:10.1016/j.entcs.2006.12.041.
Haim Gaifman & Vaughan R Pratt (1987):
Partial order models of concurrency and the computation of functions.
In: LICS,
pp. 72–85.
Emmanuel Gaudin & Eric Brunel (2013):
Property Verification with MSC.
In: SDL 2013.
Springer,
doi:10.1007/978-3-642-38911-5_2.
Elsa L. Gunter, Anca Muscholl & Doron A. Peled (2001):
Compositional Message Sequence Charts.
In: TACAS.
Springer,
pp. 496–511,
doi:10.1007/3-540-45319-9_34.
David Harel & Rami Marelly (2003):
Come, let's play: scenario-based programming using LSCs and the play-engine.
Springer,
doi:10.1007/978-3-642-19029-2.
Kohei Honda, Nobuko Yoshida & Marco Carbone (2016):
Multiparty Asynchronous Session Types.
Journal of the ACM 63(1),
pp. 9:1–9:67,
doi:10.1145/2827695.
Extended version of a paper presented at POPL08.
Joost-Pieter Katoen & Lennard Lambert (1998):
Pomsets for message sequence charts.
Formale Beschreibungstechniken für Verteilte Systeme,
pp. 197–208.
Julien Lange & Emilio Tuosto:
ChorGram.
https://bitbucket.org/emlio_tuosto/chorgram/wiki/Home.
Markus Lohrey (2002):
Safe Realizability of High-Level Message Sequence Charts.
In: Luboš Brim, Mojmír Křetínský, Antonín Kučera & Petr Jančar: CONCUR.
Springer,
pp. 177–192,
doi:10.1007/3-540-45694-5_13.
Robin Milner (1999):
Communicating and mobile systems - the Pi-calculus.
Cambridge University Press.
(2011):
Formal description techniques (FDT) - Message Sequence Chart (MSC).
Recommendation ITU-T Z.120.
Available at http://www.itu.int/rec/T-REC-Z.120-201102-I/en.
Anca Muscholl & Doron Peled (2005):
Deciding Properties of Message Sequence Charts.
In: Stefan Leue & Tarja Johanna Systä: Scenarios: Models, Transformations and Tools.
Springer,
pp. 43–65,
doi:10.1007/11495628_3.
Vaughan Pratt (1986):
Modeling concurrency with partial orders.
International Journal of Parallel Programming 15(1),
pp. 33–71,
doi:10.1007/BF01379149.
Kristin Y Rozier & Moshe Y Vardi (2007):
LTL satisfiability checking.
In: International SPIN Workshop on Model Checking of Software.
Springer,
pp. 149–167,
doi:10.1007/978-3-540-73370-6_11.
Davide Sangiorgi & David Walker (2001):
The π-Calculus: a Theory of Mobile Processes.
Cambridge University Press.
eptcs@eptcs.org