Journal
JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING
Volume 108, Issue -, Pages 69-89Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.jlamp.2019.06.003
Keywords
-
Categories
Funding
- EU H2020 RISE programme under the Marie Sklodowska-Curie grant [778233]
Ask authors/readers for more resources
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. (C) 2019 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available