Realisability of pomsets

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 poms...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 108; pp. 69 - 89
Main Authors Guanciale, Roberto, Tuosto, Emilio
Format Journal Article
LanguageEnglish
Published 01.11.2019
Online AccessGet full text
ISSN2352-2208
2352-2216
DOI10.1016/j.jlamp.2019.06.003

Cover

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. 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.
AbstractList 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. 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.
Author Tuosto, Emilio
Guanciale, Roberto
Author_xml – sequence: 1
  givenname: Roberto
  surname: Guanciale
  fullname: Guanciale, Roberto
– sequence: 2
  givenname: Emilio
  surname: Tuosto
  fullname: Tuosto, Emilio
BackLink https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-261176$$DView record from Swedish Publication Index
BookMark eNp9kL1OwzAURj0UiVK6I7H0BRKu7TiJx6r8FKkSEgLWK8exwSGJo9gI9e1JKSwMTHc557vSOSOz3veGkEsKKQWaXzVp06puSBlQmUKeAvAZmTMuWMIYlKdkGUIDMKFlUXI6JxePRrUuqMq1Lu5X3q4G3wUTwzk5saoNZvlzF-T59uZps012D3f3m_Uu0ZyzmFSmUqCEBZGVnBW6FqzUlZS1FVmmhZHK0oobI5Q1BrguSgsy05bWWmaWc74gyXE3fJrho8JhdJ0a9-iVw2v3skY_vuJ7fEOWU1rkEy-PvB59CKOxqF1U0fk-jsq1SAEPJbDB7xJ4KIGQ41Ricvkf9_fbf9YXqzhoNg
CitedBy_id crossref_primary_10_4204_EPTCS_324_5
crossref_primary_10_4204_EPTCS_365_3
crossref_primary_10_1016_j_jlamp_2021_100712
crossref_primary_10_1016_j_jlamp_2020_100560
crossref_primary_10_1016_j_jlamp_2023_100919
crossref_primary_10_1016_j_scico_2020_102535
Cites_doi 10.1145/2827695
10.1007/BF01379149
10.1007/s10009-002-0085-2
10.1109/TSE.2003.1214326
10.1016/j.entcs.2006.12.041
10.1016/j.ic.2005.05.006
10.1016/j.jlamp.2017.11.002
10.1145/322374.322380
ContentType Journal Article
DBID AAYXX
CITATION
ADTPV
AOWAS
BTSUP
D8V
DOI 10.1016/j.jlamp.2019.06.003
DatabaseName CrossRef
SwePub
SwePub Articles
SwePub Editorial
SWEPUB Kungliga Tekniska Högskolan
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 89
ExternalDocumentID oai_DiVA_org_kth_261176
10_1016_j_jlamp_2019_06_003
GroupedDBID --M
0R~
4.4
457
4G.
7-5
8P~
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AATTM
AAXKI
AAXUO
AAYFN
AAYWO
AAYXX
ABBOA
ABJNI
ABMAC
ABXDB
ACDAQ
ACGFS
ACRLP
ACVFH
ADBBV
ADCNI
ADEZE
ADVLN
AEBSH
AEIPS
AEKER
AENEX
AEUPX
AFJKZ
AFPUW
AFTJW
AFXIZ
AGCQF
AGHFR
AGRNS
AGUBO
AIALX
AIEXJ
AIGII
AIIUN
AIKHN
AITUG
AKBMS
AKRWK
AKYEP
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AOUOD
AXJTR
BKOJK
BLXMC
BNPGV
CITATION
EBS
EFJIC
EJD
FDB
FIRID
FYGXN
GBLVA
GBOLZ
HZ~
KOM
M41
O9-
OAUVE
RIG
ROL
SPC
SPCBC
SSH
SSV
SSZ
T5K
~G-
ADTPV
AOWAS
BTSUP
D8V
EFKBS
ID FETCH-LOGICAL-c332t-beba0a5f0548327cd528cb99df544c5e9af1b3ee5afee03c78f094cf1dc94f333
ISSN 2352-2208
2352-2216
IngestDate Thu Aug 21 06:23:24 EDT 2025
Tue Jul 01 00:37:50 EDT 2025
Thu Apr 24 23:06:09 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c332t-beba0a5f0548327cd528cb99df544c5e9af1b3ee5afee03c78f094cf1dc94f333
OpenAccessLink https://zenodo.org/record/3260605
PageCount 21
ParticipantIDs swepub_primary_oai_DiVA_org_kth_261176
crossref_citationtrail_10_1016_j_jlamp_2019_06_003
crossref_primary_10_1016_j_jlamp_2019_06_003
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-11-01
PublicationDateYYYYMMDD 2019-11-01
PublicationDate_xml – month: 11
  year: 2019
  text: 2019-11-01
  day: 01
PublicationDecade 2010
PublicationTitle Journal of logical and algebraic methods in programming
PublicationYear 2019
References Kumar (10.1016/j.jlamp.2019.06.003_br0190)
Alur (10.1016/j.jlamp.2019.06.003_br0020) 1996
Tuosto (10.1016/j.jlamp.2019.06.003_br0310) 2018; 95
Mahmoud (10.1016/j.jlamp.2019.06.003_br0230) 2005
Honda (10.1016/j.jlamp.2019.06.003_br0170) 2016; 63
Gaudin (10.1016/j.jlamp.2019.06.003_br0110) 2013
Gunter (10.1016/j.jlamp.2019.06.003_br0140) 2001
Muscholl (10.1016/j.jlamp.2019.06.003_br0260) 2005
Sangiorgi (10.1016/j.jlamp.2019.06.003_br0300) 2001
Boudol (10.1016/j.jlamp.2019.06.003_br0050) 1988; vol. 354
Pratt (10.1016/j.jlamp.2019.06.003_br0280) 1986; 15
Lange (10.1016/j.jlamp.2019.06.003_br0200)
Harel (10.1016/j.jlamp.2019.06.003_br0160) 2003
Rozier (10.1016/j.jlamp.2019.06.003_br0290) 2007
Lewis (10.1016/j.jlamp.2019.06.003_br0210)
Milner (10.1016/j.jlamp.2019.06.003_br0240) 1999
Ben-Abdallah (10.1016/j.jlamp.2019.06.003_br0030) 1997
Bocchi (10.1016/j.jlamp.2019.06.003_br0040) 2014
Cécé (10.1016/j.jlamp.2019.06.003_br0080) 2005; 202
Alur (10.1016/j.jlamp.2019.06.003_br0010) 2003; 29
Brand (10.1016/j.jlamp.2019.06.003_br0060) 1983; 30
Guanciale (10.1016/j.jlamp.2019.06.003_br0120) 2016
Katoen (10.1016/j.jlamp.2019.06.003_br0180) 1998
Carbone (10.1016/j.jlamp.2019.06.003_br0070) 2007; 171
Deniélou (10.1016/j.jlamp.2019.06.003_br0090) 2012
Gunter (10.1016/j.jlamp.2019.06.003_br0150) 2003; 5
Guanciale (10.1016/j.jlamp.2019.06.003_br0130) 2018
Lohrey (10.1016/j.jlamp.2019.06.003_br0220) 2002
Gaifman (10.1016/j.jlamp.2019.06.003_br0100) 1987
Object Management Group (10.1016/j.jlamp.2019.06.003_br0270)
References_xml – year: 2013
  ident: 10.1016/j.jlamp.2019.06.003_br0110
  article-title: Property verification with MSC
– ident: 10.1016/j.jlamp.2019.06.003_br0190
– start-page: 496
  year: 2001
  ident: 10.1016/j.jlamp.2019.06.003_br0140
  article-title: Compositional message sequence charts
– start-page: 72
  year: 1987
  ident: 10.1016/j.jlamp.2019.06.003_br0100
  article-title: Partial order models of concurrency and the computation of functions
– volume: 63
  start-page: 9:1
  issue: 1
  year: 2016
  ident: 10.1016/j.jlamp.2019.06.003_br0170
  article-title: Multiparty asynchronous session types
  publication-title: J. ACM
  doi: 10.1145/2827695
– volume: 15
  start-page: 33
  issue: 1
  year: 1986
  ident: 10.1016/j.jlamp.2019.06.003_br0280
  article-title: Modeling concurrency with partial orders
  publication-title: Int. J. Parallel Program.
  doi: 10.1007/BF01379149
– volume: 5
  start-page: 78
  issue: 1
  year: 2003
  ident: 10.1016/j.jlamp.2019.06.003_br0150
  article-title: Compositional message sequence charts
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s10009-002-0085-2
– start-page: 493
  year: 2014
  ident: 10.1016/j.jlamp.2019.06.003_br0040
  article-title: Resolving non-determinism in choreographies
– year: 2005
  ident: 10.1016/j.jlamp.2019.06.003_br0230
– volume: 29
  start-page: 623
  issue: 7
  year: 2003
  ident: 10.1016/j.jlamp.2019.06.003_br0010
  article-title: Inference of message sequence charts
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.2003.1214326
– start-page: 259
  year: 1997
  ident: 10.1016/j.jlamp.2019.06.003_br0030
  article-title: Syntactic detection of process divergence and non-local choice in message sequence charts
– start-page: 149
  year: 2007
  ident: 10.1016/j.jlamp.2019.06.003_br0290
  article-title: LTL satisfiability checking
– start-page: 43
  year: 2005
  ident: 10.1016/j.jlamp.2019.06.003_br0260
  article-title: Deciding properties of message sequence charts
– start-page: 37
  year: 2018
  ident: 10.1016/j.jlamp.2019.06.003_br0130
  article-title: Realisability of pomsets via communicating automata
– start-page: 197
  year: 1998
  ident: 10.1016/j.jlamp.2019.06.003_br0180
  article-title: Pomsets for message sequence charts
– year: 2003
  ident: 10.1016/j.jlamp.2019.06.003_br0160
– year: 2001
  ident: 10.1016/j.jlamp.2019.06.003_br0300
– year: 1999
  ident: 10.1016/j.jlamp.2019.06.003_br0240
– volume: vol. 354
  start-page: 411
  year: 1988
  ident: 10.1016/j.jlamp.2019.06.003_br0050
  article-title: Permutation of transitions: an event structure semantics for CCS and SCCS
– volume: 171
  start-page: 127
  issue: 3
  year: 2007
  ident: 10.1016/j.jlamp.2019.06.003_br0070
  article-title: A calculus of global interaction based on session types
  publication-title: Electron. Notes Theor. Comput. Sci.
  doi: 10.1016/j.entcs.2006.12.041
– ident: 10.1016/j.jlamp.2019.06.003_br0200
– volume: 202
  start-page: 166
  issue: 2
  year: 2005
  ident: 10.1016/j.jlamp.2019.06.003_br0080
  article-title: Verification of programs with half-duplex communication
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2005.05.006
– start-page: 194
  year: 2012
  ident: 10.1016/j.jlamp.2019.06.003_br0090
  article-title: Multiparty session types meet communicating automata
– start-page: 35
  year: 1996
  ident: 10.1016/j.jlamp.2019.06.003_br0020
  article-title: An analyzer for message sequence charts
– volume: 95
  start-page: 17
  year: 2018
  ident: 10.1016/j.jlamp.2019.06.003_br0310
  article-title: Semantics of global view of choreographies
  publication-title: J. Log. Algebraic Methods Program.
  doi: 10.1016/j.jlamp.2017.11.002
– ident: 10.1016/j.jlamp.2019.06.003_br0270
– start-page: 67
  year: 2016
  ident: 10.1016/j.jlamp.2019.06.003_br0120
  article-title: An abstract semantics of the global view of choreographies
– start-page: 177
  year: 2002
  ident: 10.1016/j.jlamp.2019.06.003_br0220
  article-title: Safe realizability of high-level message sequence charts
– ident: 10.1016/j.jlamp.2019.06.003_br0210
– volume: 30
  start-page: 323
  issue: 2
  year: 1983
  ident: 10.1016/j.jlamp.2019.06.003_br0060
  article-title: On communicating finite-state machines
  publication-title: J. ACM
  doi: 10.1145/322374.322380
SSID ssj0001687831
ssib023362453
Score 2.2468405
Snippet Pomsets are a model of concurrent computations introduced by Pratt. We adopt pomsets as a syntax-oblivious specification model of distributed systems where...
SourceID swepub
crossref
SourceType Open Access Repository
Enrichment Source
Index Database
StartPage 69
Title Realisability of pomsets
URI https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-261176
Volume 108
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT4NAEN5ovXjxbayvcDCexMAurz02PlI1ejCt8UZg2a2tbTFKL_56Zx-ApGrUCwGykGW_YfYbmP0GoaOMCGkHkU1w5NgedoSdhIzZIfGdFCIuKpTY8-1d0O1714_-Y13xVK0uKdJT9v7lupL_oArnAFe5SvYPyFY3hROwD_jCFhCG7a8wvudSvlArbas_5S_55I1rbaYvGGfp5pQ-63ggfxkPmakhrdPJdbLWpJzOZF7OTAty8DoNO69zMqQqh_KmE-hC_vkLgkvNUrrK0WAgYTbGTtTwiuZQ-zVdTmXO3erIf3Q6AuuV4p8uVWKoDqlnl4aO9fnwoRPnr4P4uXiKIXZzw2ARLWFg-LiFljpXN9270hlgAlOrZ7iE-mAWgEmp-pJVf-t9NygVpVTu3lx_GqyjoQmreERvDa0YOKyORnMdLfDpBloti2tYxtduop0GuFYuLAPuFupfXvTOurYpY2EzQnBhpzxNnMQXQI7BfYYs83HEUkoz4Xse8zlNhJsSzv1EcO4QFkYCYm4m3IxRTxBCtlFrmk_5DrI8DgE7vEsZSR1PZDQhcBPKCcSsPgOu0Ua4fMyYGY13WWpkHJfJfKNYjU0sxyZWKY2kjU6qi160xMnPzY_1-FWNv0F297cN99BybZb7qFW8zvgBUL0iPTRG8QFmRlN4
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Realisability+of+pomsets&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=Guanciale%2C+Roberto&rft.au=Tuosto%2C+Emilio&rft.date=2019-11-01&rft.issn=2352-2208&rft.volume=108&rft.spage=69&rft_id=info:doi/10.1016%2Fj.jlamp.2019.06.003&rft.externalDocID=oai_DiVA_org_kth_261176
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2352-2208&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2352-2208&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2352-2208&client=summon