Realisability of pomsets

Abstract Pomsets are a model of concurrent computations introduced by Pratt. We adopt pomsets as a syntax-oblivious specification model of distributed systems where coordination happens via asynchronous message-passing. In this paper, we study conditions that ensure a specification expressed as a set of pomsets can be faithfully realised via communicating automata. Our main contributions are (i) the definition of a realisability condition accounting for termination soundness, (ii) conditions accounting for ‘‘multi-threaded’’ participants, and (iii) an algorithm to check our realisability conditions directly over pomsets, (iv) an analysis of the algorithm and its benchmarking attained with a prototype implementation.

[1]  Emilio Tuosto,et al.  An Abstract Semantics of the Global View of Choreographies , 2016, ICE.

[2]  Nobuko Yoshida,et al.  A Calculus of Global Interaction based on Session Types , 2007, DCM@ICALP.

[3]  Emmanuel Gaudin,et al.  Property Verification with MSC , 2013, SDL Forum.

[4]  Rajeev Alur,et al.  Inference of Message Sequence Charts , 2003, IEEE Trans. Software Eng..

[5]  Markus Lohrey.  Safe Realizability of High-Level Message Sequence Charts , 2002, CONCUR.

[6]  Nobuko Yoshida,et al.  Multiparty Session Types Meet Communicating Automata , 2012, ESOP.

[7]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[8]  David Harel,et al.  Come, let's play - scenario-based programming using LSCs and the play-engine , 2003 .

[9]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[10]  Emilio Tuosto,et al.  Semantics of global view of choreographies , 2018, J. Log. Algebraic Methods Program..

[11]  Hanêne Ben-Abdallah,et al.  Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts , 1997, TACAS.

[12]  Nobuko Yoshida,et al.  Multiparty asynchronous session types , 2008, POPL '08.

[13]  Haim Gaifman,et al.  Partial Order Models of Concurrency and the Computation of Functions , 1987, LICS.

[14]  Moshe Y. Vardi,et al.  LTL Satisfiability Checking , 2007, SPIN.

[15]  Alain Finkel,et al.  Verification of programs with half-duplex communication , 2005, Inf. Comput..

[16]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[17]  Rajeev Alur,et al.  An Analyser for Mesage Sequence Charts , 1996, TACAS.

[18]  Anca Muscholl,et al.  Compositional message sequence charts , 2001, International Journal on Software Tools for Technology Transfer.

[19]  Laura Bocchi,et al.  Resolving Non-determinism in Choreographies , 2014, ESOP.

[20]  Anca Muscholl,et al.  Deciding Properties of Message Sequence Charts , 2003, Scenarios: Models, Transformations and Tools.

[21]  Qusay H. Mahmoud,et al.  Middleware for Communications , 2022 .

[22]  Joost-Pieter Katoen,et al.  Pomsets for message sequence charts , 1998 .

[23]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[24]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

[25]  Emilio Tuosto,et al.  Realizability of pomsets via communicating automata , 2018 .