Ensuring liveness properties of distributed systems: Open problems

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 109; p. 100480
Main Author van Glabbeek, Rob
Format Journal Article
LanguageEnglish
Published 01.12.2019
Online AccessGet full text

Cover

ArticleNumber 100480
Author van Glabbeek, Rob
Author_xml – sequence: 1
  givenname: Rob
  surname: van Glabbeek
  fullname: van Glabbeek, Rob
BookMark eNp9kL1OwzAUhT0UiVL6BCx5gRTbSRqbDaryI1XqArPln2vkKHUiXxepb09KmRiYrs7V-c7w3ZBZHCIQcsfoilG2vu9WXa8P44pTJqcPrQWdkTmvGl5yTsU1WSJ2lE5V0YqKzcnTNuIxhfhZ9OELIiAWYxpGSDkAFoMvXMCcgjlmcAWeMMMBH4r9CPHcM_0Ub8mV1z3C8vcuyMfz9n3zWu72L2-bx11puaxzKRrhOGsMN37dSgOUeZCWajDMVtbx2lrZMC5aXTlvvHe1rF0NsmmFEEbIakHkZdemATGBVzZkncMQc9KhV4yqswPVqR8H6uxAXRxMbPWHHVM46HT6l_oGHJFntw
CitedBy_id crossref_primary_10_1007_s00236_022_00417_1
crossref_primary_10_4204_EPTCS_322_6
crossref_primary_10_1109_ACCESS_2020_3047411
Cites_doi 10.1145/234752.234756
10.1016/0304-3975(87)90052-1
10.1016/0304-3975(84)90067-7
10.1016/0304-3975(94)00152-9
10.1016/0890-5401(92)90013-6
10.1016/0304-3975(84)90113-0
10.1016/0304-3975(93)90006-F
10.1145/363347.363366
10.1016/0890-5401(87)90013-7
10.1007/BF01221098
10.1145/362946.362970
10.1016/0890-5401(90)90048-M
10.1007/s002360000046
10.1006/jcss.1999.1663
10.1016/S0020-0190(97)00033-1
10.3233/FI-2009-109
10.1007/978-3-662-04293-9
10.1016/j.entcs.2005.11.077
10.2168/LMCS-4(4:4)2008
10.1016/S0304-3975(99)00214-5
10.1145/963927.963929
10.1016/j.ic.2011.10.011
10.1007/BF01872848
10.1016/0167-6423(83)90017-5
10.1145/200836.200876
10.1016/j.tcs.2006.02.011
10.1016/0304-3975(93)90111-6
10.1016/0304-3975(89)90052-2
10.1007/BF00271640
10.1145/828.833
10.1016/j.ic.2010.05.002
10.1016/S0304-3975(01)00300-0
10.1109/TSE.1977.229904
10.1016/0304-3975(85)90093-3
10.1145/233551.233556
10.1007/s00236-009-0092-9
10.1007/s002360000041
10.1016/j.tcs.2011.02.036
10.1145/2682570
10.1007/s00236-006-0011-2
10.1007/s00236-015-0221-6
10.1016/S0890-5401(02)93161-5
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1016/j.jlamp.2019.100480
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
ExternalDocumentID 10_1016_j_jlamp_2019_100480
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-
ID FETCH-LOGICAL-c294t-858d215b2bf679be01fe9c0aeb1c3cd24cc951287a3dfbffd494d4e957888b893
ISSN 2352-2208
IngestDate Thu Apr 24 23:09:11 EDT 2025
Tue Jul 01 00:37:50 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c294t-858d215b2bf679be01fe9c0aeb1c3cd24cc951287a3dfbffd494d4e957888b893
OpenAccessLink https://doi.org/10.1016/j.jlamp.2019.100480
ParticipantIDs crossref_citationtrail_10_1016_j_jlamp_2019_100480
crossref_primary_10_1016_j_jlamp_2019_100480
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2019-12-00
PublicationDateYYYYMMDD 2019-12-01
PublicationDate_xml – month: 12
  year: 2019
  text: 2019-12-00
PublicationDecade 2010
PublicationTitle Journal of logical and algebraic methods in programming
PublicationYear 2019
References Fokkink (10.1016/j.jlamp.2019.100480_br0390) 2000
Verhoef (10.1016/j.jlamp.2019.100480_br1010) 1995; 2
Groote (10.1016/j.jlamp.2019.100480_br0630) 2006; 156
Morgan (10.1016/j.jlamp.2019.100480_br0860) 1994
Lehmann (10.1016/j.jlamp.2019.100480_br0790) 1981; vol. 115
Winskel (10.1016/j.jlamp.2019.100480_br1050) 1984; vol. 166
Perkins (10.1016/j.jlamp.2019.100480_br0890) 2003
Olderog (10.1016/j.jlamp.2019.100480_br0880) 1991; vol. 23
van Glabbeek (10.1016/j.jlamp.2019.100480_br0420) 2001; 37
Groote (10.1016/j.jlamp.2019.100480_br0670) 1992; 100
Brookes (10.1016/j.jlamp.2019.100480_br0120) 1984; 31
Corradini (10.1016/j.jlamp.2019.100480_br0270) 2009; vol. 5404
Deng (10.1016/j.jlamp.2019.100480_br0330) 2008; 4
van Glabbeek (10.1016/j.jlamp.2019.100480_br0450) 2015
Gibson-Robinson (10.1016/j.jlamp.2019.100480_br0410) 2014; vol. 8413
Bloom (10.1016/j.jlamp.2019.100480_br0090) 2004; 5
van Glabbeek (10.1016/j.jlamp.2019.100480_br0510) 2010; vol. 323
Bengtson (10.1016/j.jlamp.2019.100480_br0140) 2011; 7
Vogler (10.1016/j.jlamp.2019.100480_br1020) 1992; vol. 625
Boudol (10.1016/j.jlamp.2019.100480_br0070) 1994; 6
Brinksma (10.1016/j.jlamp.2019.100480_br0210) 1996
Ulidowski (10.1016/j.jlamp.2019.100480_br0980) 2000; 239
Lynch (10.1016/j.jlamp.2019.100480_br0810) 1996
van Glabbeek (10.1016/j.jlamp.2019.100480_br0540) 2012; vol. 89
Corradini (10.1016/j.jlamp.2019.100480_br0240) 2006; 43
Milner (10.1016/j.jlamp.2019.100480_br0820) 1989
van Glabbeek (10.1016/j.jlamp.2019.100480_br0490) 1994
van Glabbeek (10.1016/j.jlamp.2019.100480_br0440) 2015; 52
Bol (10.1016/j.jlamp.2019.100480_br0100) 1996; 43
Sangiorgi (10.1016/j.jlamp.2019.100480_br0960) 2001
van Glabbeek (10.1016/j.jlamp.2019.100480_br0530) 2011; 412
Yi (10.1016/j.jlamp.2019.100480_br1070) 1992
Henzinger (10.1016/j.jlamp.2019.100480_br0720) 2000; vol. 1785
Fehnker (10.1016/j.jlamp.2019.100480_br0370) 2013
Winskel (10.1016/j.jlamp.2019.100480_br1060) 1987
Costa (10.1016/j.jlamp.2019.100480_br0300) 1987; 73
Vogler (10.1016/j.jlamp.2019.100480_br1030) 2002; 275
Buti (10.1016/j.jlamp.2019.100480_br0060) 2011; vol. 54
de Simone (10.1016/j.jlamp.2019.100480_br0950) 1985; 37
Cleaveland (10.1016/j.jlamp.2019.100480_br0280) 2001
Baeten (10.1016/j.jlamp.2019.100480_br0050) 2010
Lynch (10.1016/j.jlamp.2019.100480_br0800) 1968; 11
Ulidowski (10.1016/j.jlamp.2019.100480_br0990) 2002; 178
Dyseryn (10.1016/j.jlamp.2019.100480_br0320) 2017; vol. 255
van Glabbeek (10.1016/j.jlamp.2019.100480_br0600) 2009; 93
Corradini (10.1016/j.jlamp.2019.100480_br0260) 2009; 46
Bergstra (10.1016/j.jlamp.2019.100480_br0160) 1986; vol. 215
McIver (10.1016/j.jlamp.2019.100480_br0840) 2001; 37
van Glabbeek (10.1016/j.jlamp.2019.100480_br0660) 1987; vol. 259
Fokkink (10.1016/j.jlamp.2019.100480_br0400) 2000; 60
Roscoe (10.1016/j.jlamp.2019.100480_br0930) 1997
Ulidowski (10.1016/j.jlamp.2019.100480_br0970) 1992
van Glabbeek (10.1016/j.jlamp.2019.100480_br0500) 2001
Reisig (10.1016/j.jlamp.2019.100480_br0920) 2013
Milner (10.1016/j.jlamp.2019.100480_br0830) 1999
Cleaveland (10.1016/j.jlamp.2019.100480_br0310) 2001
Walker (10.1016/j.jlamp.2019.100480_br1040) 1990; 85
Pnueli (10.1016/j.jlamp.2019.100480_br0900) 1977
Fehnker (10.1016/j.jlamp.2019.100480_br0360) 2012; vol. 7211
van Glabbeek (10.1016/j.jlamp.2019.100480_br0690) 1996; 43
Bloom (10.1016/j.jlamp.2019.100480_br0180) 1995; 146
Natarajan (10.1016/j.jlamp.2019.100480_br0870) 1995; vol. 944
Costa (10.1016/j.jlamp.2019.100480_br0290) 1984; 21
Mazurkiewicz (10.1016/j.jlamp.2019.100480_br0850) 1989; 64
Behrmann (10.1016/j.jlamp.2019.100480_br0080) 2004; vol. 3185
Baeten (10.1016/j.jlamp.2019.100480_br0040) 1987; 51
Austry (10.1016/j.jlamp.2019.100480_br0010) 1984; 30
Groote (10.1016/j.jlamp.2019.100480_br0620) 2014
(10.1016/j.jlamp.2019.100480_br0030) 1990; vol. 17
Lamport (10.1016/j.jlamp.2019.100480_br0780) 2002
Segala (10.1016/j.jlamp.2019.100480_br0940) 1996; vol. 1119
Goltz (10.1016/j.jlamp.2019.100480_br0610) 1984; vol. 172
Holzmann (10.1016/j.jlamp.2019.100480_br0710) 2004
van Glabbeek (10.1016/j.jlamp.2019.100480_br0520) 2011
Kant (10.1016/j.jlamp.2019.100480_br0730) 2015; vol. 9035
De Nicola (10.1016/j.jlamp.2019.100480_br0340) 1984; 34
Boudol (10.1016/j.jlamp.2019.100480_br0190) 1985; vol. F13
Apt (10.1016/j.jlamp.2019.100480_br0020) 1988; 2
Lamport (10.1016/j.jlamp.2019.100480_br0770) 1977; 3
van Glabbeek (10.1016/j.jlamp.2019.100480_br0470)
Bloom (10.1016/j.jlamp.2019.100480_br0130) 1995; 42
Garavel (10.1016/j.jlamp.2019.100480_br0590) 2011; vol. 6605
Emerson (10.1016/j.jlamp.2019.100480_br0350) 1982; 2
Ulidowski (10.1016/j.jlamp.2019.100480_br1000) 2000; vol. 1877
van Glabbeek (10.1016/j.jlamp.2019.100480_br0480) 1993; vol. 715
Kwiatkowska (10.1016/j.jlamp.2019.100480_br0740) 2010
Borgström (10.1016/j.jlamp.2019.100480_br0110) 2015; 14
Pratt (10.1016/j.jlamp.2019.100480_br0910) 1991
Baeten (10.1016/j.jlamp.2019.100480_br0230) 1990; vol. 18
Corradini (10.1016/j.jlamp.2019.100480_br0250) 2006; 356
van Glabbeek (10.1016/j.jlamp.2019.100480_br0550) 2015; vol. 9360
Brinksma (10.1016/j.jlamp.2019.100480_br0200) 1995; vol. 962
van Glabbeek (10.1016/j.jlamp.2019.100480_br0460) 2019
Kindler (10.1016/j.jlamp.2019.100480_br0760) 1997; 62
Baier (10.1016/j.jlamp.2019.100480_br0170) 2008
van Glabbeek (10.1016/j.jlamp.2019.100480_br0560) 2017; vol. 2017
van Glabbeek (10.1016/j.jlamp.2019.100480_br0430) 2013; 9
Groote (10.1016/j.jlamp.2019.100480_br0650) 1993; 118
Kuiper (10.1016/j.jlamp.2019.100480_br0750) 1983
Bergstra (10.1016/j.jlamp.2019.100480_br0150) 1986; vol. 1
Bartlett (10.1016/j.jlamp.2019.100480_br0220) 1969; 12
Hoare (10.1016/j.jlamp.2019.100480_br0700) 1985
Gorla (10.1016/j.jlamp.2019.100480_br0640) 2010; 208
van Glabbeek (10.1016/j.jlamp.2019.100480_br0570) 2019; vol. 11425
van Glabbeek (10.1016/j.jlamp.2019.100480_br0680) 1993; 113
van Glabbeek (10.1016/j.jlamp.2019.100480_br0580) 2019; vol. 11665
Fokkink (10.1016/j.jlamp.2019.100480_br0380) 2012; 214
References_xml – volume: vol. 18
  year: 1990
  ident: 10.1016/j.jlamp.2019.100480_br0230
  article-title: Process Algebra
– volume: vol. 625
  year: 1992
  ident: 10.1016/j.jlamp.2019.100480_br1020
  article-title: Modular Construction and Partial Order Semantics of Petri Nets
– volume: 43
  start-page: 863
  issue: 5
  year: 1996
  ident: 10.1016/j.jlamp.2019.100480_br0100
  article-title: The meaning of negative premises in transition system specifications
  publication-title: J. ACM
  doi: 10.1145/234752.234756
– volume: 51
  start-page: 129
  issue: 1/2
  year: 1987
  ident: 10.1016/j.jlamp.2019.100480_br0040
  article-title: On the consistency of Koomen's fair abstraction rule
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(87)90052-1
– year: 2015
  ident: 10.1016/j.jlamp.2019.100480_br0450
– volume: 30
  start-page: 91
  issue: 1
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br0010
  article-title: Algèbre de processus et synchronisations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(84)90067-7
– volume: vol. 323
  start-page: 32
  year: 2010
  ident: 10.1016/j.jlamp.2019.100480_br0510
  article-title: The coarsest precongruences respecting safety and liveness properties
– start-page: 46
  year: 1977
  ident: 10.1016/j.jlamp.2019.100480_br0900
  article-title: The temporal logic of programs
– year: 1994
  ident: 10.1016/j.jlamp.2019.100480_br0860
  article-title: Programming From Specifications
– volume: 146
  start-page: 25
  year: 1995
  ident: 10.1016/j.jlamp.2019.100480_br0180
  article-title: Structural operational semantics for weak bisimulations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)00152-9
– volume: 100
  start-page: 202
  issue: 2
  year: 1992
  ident: 10.1016/j.jlamp.2019.100480_br0670
  article-title: Structured operational semantics and bisimulation as a congruence
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(92)90013-6
– volume: 34
  start-page: 83
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br0340
  article-title: Testing equivalences for processes
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(84)90113-0
– volume: vol. 11425
  start-page: 505
  year: 2019
  ident: 10.1016/j.jlamp.2019.100480_br0570
  article-title: Justness: a completeness criterion for capturing liveness properties (extended abstract)
– volume: 113
  start-page: 293
  issue: 2
  year: 1993
  ident: 10.1016/j.jlamp.2019.100480_br0680
  article-title: Modular specification of process algebras
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(93)90006-F
– volume: 11
  start-page: 407
  issue: 6
  year: 1968
  ident: 10.1016/j.jlamp.2019.100480_br0800
  article-title: Reliable full-duplex file transmission over half-duplex telephone line
  publication-title: Commun. ACM
  doi: 10.1145/363347.363366
– year: 2004
  ident: 10.1016/j.jlamp.2019.100480_br0710
– volume: 73
  start-page: 207
  issue: 3
  year: 1987
  ident: 10.1016/j.jlamp.2019.100480_br0300
  article-title: Weak and strong fairness in CCS
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(87)90013-7
– volume: 6
  start-page: 165
  issue: 2
  year: 1994
  ident: 10.1016/j.jlamp.2019.100480_br0070
  article-title: A theory of processes with localities
  publication-title: Form. Asp. Comput.
  doi: 10.1007/BF01221098
– volume: 12
  start-page: 260
  year: 1969
  ident: 10.1016/j.jlamp.2019.100480_br0220
  article-title: A note on reliable full-duplex transmission over half-duplex links
  publication-title: Commun. ACM
  doi: 10.1145/362946.362970
– year: 2019
  ident: 10.1016/j.jlamp.2019.100480_br0460
  article-title: Progress, justness and fairness (Survey paper)
  publication-title: ACM Comput. Surv.
– volume: 85
  start-page: 202
  issue: 2
  year: 1990
  ident: 10.1016/j.jlamp.2019.100480_br1040
  article-title: Bisimulation and divergence
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(90)90048-M
– volume: vol. 54
  start-page: 45
  year: 2011
  ident: 10.1016/j.jlamp.2019.100480_br0060
  article-title: Automated analysis of MUTEX algorithms with FASE
– volume: vol. 1785
  start-page: 299
  year: 2000
  ident: 10.1016/j.jlamp.2019.100480_br0720
  article-title: Fair bisimulation
– volume: vol. 715
  start-page: 66
  year: 1993
  ident: 10.1016/j.jlamp.2019.100480_br0480
  article-title: The linear time – branching time spectrum, II: the semantics of sequential systems with silent moves (extended abstract)
– year: 2008
  ident: 10.1016/j.jlamp.2019.100480_br0170
– volume: 9
  start-page: 17
  issue: 3
  year: 2013
  ident: 10.1016/j.jlamp.2019.100480_br0430
  article-title: On characterising distributability
  publication-title: Log. Methods Comput. Sci.
– year: 1996
  ident: 10.1016/j.jlamp.2019.100480_br0810
– year: 2003
  ident: 10.1016/j.jlamp.2019.100480_br0890
– volume: 37
  start-page: 329
  issue: 4/5
  year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0840
  article-title: Demonic, angelic and unbounded probabilistic choices in sequential programs
  publication-title: Acta Inform.
  doi: 10.1007/s002360000046
– volume: 60
  start-page: 11
  issue: 1
  year: 2000
  ident: 10.1016/j.jlamp.2019.100480_br0400
  article-title: Rooted branching bisimulation as a congruence
  publication-title: J. Comput. Syst. Sci.
  doi: 10.1006/jcss.1999.1663
– volume: vol. 9035
  start-page: 692
  year: 2015
  ident: 10.1016/j.jlamp.2019.100480_br0730
  article-title: LTSmin: high-performance language-independent model checking
– year: 2013
  ident: 10.1016/j.jlamp.2019.100480_br0370
– start-page: 145
  year: 1996
  ident: 10.1016/j.jlamp.2019.100480_br0210
  article-title: Applications of fair testing
– volume: 62
  start-page: 31
  issue: 1
  year: 1997
  ident: 10.1016/j.jlamp.2019.100480_br0760
  article-title: Mutex needs fairness
  publication-title: Inf. Process. Lett.
  doi: 10.1016/S0020-0190(97)00033-1
– start-page: 711
  year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0280
  article-title: Priority in process algebra
– volume: vol. 259
  start-page: 224
  year: 1987
  ident: 10.1016/j.jlamp.2019.100480_br0660
  article-title: Petri net models for algebraic theories of concurrency (extended abstract)
– volume: 93
  start-page: 371
  issue: 4
  year: 2009
  ident: 10.1016/j.jlamp.2019.100480_br0600
  article-title: Branching bisimilarity with explicit divergence
  publication-title: Fundam. Inform.
  doi: 10.3233/FI-2009-109
– volume: vol. 166
  start-page: 140
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br1050
  article-title: A new definition of morphism on Petri nets
– year: 2000
  ident: 10.1016/j.jlamp.2019.100480_br0390
  article-title: Introduction to Process Algebra
  doi: 10.1007/978-3-662-04293-9
– volume: 156
  start-page: 3
  issue: 1
  year: 2006
  ident: 10.1016/j.jlamp.2019.100480_br0630
  article-title: A hierarchy of SOS rule formats
  publication-title: Electron. Notes Theor. Comput. Sci.
  doi: 10.1016/j.entcs.2005.11.077
– volume: vol. 6605
  start-page: 372
  year: 2011
  ident: 10.1016/j.jlamp.2019.100480_br0590
  article-title: CADP 2010: a toolbox for the construction and analysis of distributed processes
– volume: 4
  start-page: 4
  issue: 4
  year: 2008
  ident: 10.1016/j.jlamp.2019.100480_br0330
  article-title: Characterising testing preorders for finite probabilistic processes
  publication-title: Log. Methods Comput. Sci.
  doi: 10.2168/LMCS-4(4:4)2008
– volume: 239
  start-page: 97
  issue: 1
  year: 2000
  ident: 10.1016/j.jlamp.2019.100480_br0980
  article-title: Finite axiom systems for testing preorder and De Simone process languages
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(99)00214-5
– volume: 5
  start-page: 26
  issue: 1
  year: 2004
  ident: 10.1016/j.jlamp.2019.100480_br0090
  article-title: Precongruence formats for decorated trace semantics
  publication-title: ACM Trans. Comput. Log.
  doi: 10.1145/963927.963929
– year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0960
– start-page: 1691
  year: 2010
  ident: 10.1016/j.jlamp.2019.100480_br0740
  article-title: Advances and challenges of probabilistic model checking
– volume: 2
  start-page: 274
  issue: 2
  year: 1995
  ident: 10.1016/j.jlamp.2019.100480_br1010
  article-title: A congruence theorem for structured operational semantics with predicates and negative premises
  publication-title: Nord. J. Comput.
– year: 2013
  ident: 10.1016/j.jlamp.2019.100480_br0920
– volume: 214
  start-page: 59
  year: 2012
  ident: 10.1016/j.jlamp.2019.100480_br0380
  article-title: Divide and congruence: from decomposition of modal formulas to preservation of branching and η-bisimilarity
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2011.10.011
– volume: 2
  start-page: 226
  issue: 4
  year: 1988
  ident: 10.1016/j.jlamp.2019.100480_br0020
  article-title: Appraising fairness in languages for distributed programming
  publication-title: Distrib. Comput.
  doi: 10.1007/BF01872848
– volume: 2
  start-page: 241
  issue: 3
  year: 1982
  ident: 10.1016/j.jlamp.2019.100480_br0350
  article-title: Using branching time temporal logic to synthesize synchronization skeletons
  publication-title: Sci. Comput. Program.
  doi: 10.1016/0167-6423(83)90017-5
– volume: vol. 5404
  start-page: 193
  year: 2009
  ident: 10.1016/j.jlamp.2019.100480_br0270
  article-title: Time and fairness in a process algebra with non-blocking reading
– volume: vol. 2017
  year: 2017
  ident: 10.1016/j.jlamp.2019.100480_br0560
  article-title: Lean and full congruence formats for recursion
– ident: 10.1016/j.jlamp.2019.100480_br0470
– volume: 42
  start-page: 232
  issue: 1
  year: 1995
  ident: 10.1016/j.jlamp.2019.100480_br0130
  article-title: Bisimulation can't be traced
  publication-title: J. ACM
  doi: 10.1145/200836.200876
– volume: vol. 255
  start-page: 18
  year: 2017
  ident: 10.1016/j.jlamp.2019.100480_br0320
  article-title: Analysing mutual exclusion using process algebra with signals
– volume: 356
  start-page: 291
  issue: 3
  year: 2006
  ident: 10.1016/j.jlamp.2019.100480_br0250
  article-title: Fairness of components in system computations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2006.02.011
– volume: vol. 1877
  start-page: 275
  year: 2000
  ident: 10.1016/j.jlamp.2019.100480_br1000
  article-title: Process languages for rooted eager bisimulation
– volume: 118
  start-page: 263
  issue: 2
  year: 1993
  ident: 10.1016/j.jlamp.2019.100480_br0650
  article-title: Transition system specifications with negative premises
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(93)90111-6
– volume: 64
  start-page: 281
  issue: 3
  year: 1989
  ident: 10.1016/j.jlamp.2019.100480_br0850
  article-title: Concurrent systems and inevitability
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(89)90052-2
– volume: 21
  start-page: 417
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br0290
  article-title: A fair calculus of communicating systems
  publication-title: Acta Inform.
  doi: 10.1007/BF00271640
– start-page: 391
  year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0310
  article-title: Equivalence and preorder checking for finite-state systems
– volume: 31
  start-page: 560
  issue: 3
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br0120
  article-title: A theory of communicating sequential processes
  publication-title: J. ACM
  doi: 10.1145/828.833
– start-page: 159
  year: 1983
  ident: 10.1016/j.jlamp.2019.100480_br0750
  article-title: Fairness assumptions for CSP in a temporal logic framework
– volume: vol. 23
  year: 1991
  ident: 10.1016/j.jlamp.2019.100480_br0880
  article-title: Nets, Terms and Formulas: Three Views of Concurrent Processes and their Relationship
– volume: vol. 962
  start-page: 313
  year: 1995
  ident: 10.1016/j.jlamp.2019.100480_br0200
  article-title: Fair testing
– volume: 208
  start-page: 1031
  issue: 9
  year: 2010
  ident: 10.1016/j.jlamp.2019.100480_br0640
  article-title: Towards a unified approach to encodability and separation results for process calculi
  publication-title: Inf. Comput.
  doi: 10.1016/j.ic.2010.05.002
– volume: vol. 17
  year: 1990
  ident: 10.1016/j.jlamp.2019.100480_br0030
– volume: 275
  start-page: 589
  issue: 1–2
  year: 2002
  ident: 10.1016/j.jlamp.2019.100480_br1030
  article-title: Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/S0304-3975(01)00300-0
– volume: vol. 215
  start-page: 9
  year: 1986
  ident: 10.1016/j.jlamp.2019.100480_br0160
  article-title: Verification of an alternating bit protocol by means of process algebra
– volume: vol. 172
  start-page: 196
  year: 1984
  ident: 10.1016/j.jlamp.2019.100480_br0610
  article-title: On the relationship of CCS and Petri nets
– start-page: 188
  year: 1994
  ident: 10.1016/j.jlamp.2019.100480_br0490
  article-title: On the expressiveness of ACP (extended abstract)
– volume: 7
  issue: 1
  year: 2011
  ident: 10.1016/j.jlamp.2019.100480_br0140
  article-title: Psi-calculi: a framework for mobile processes with nominal data and logic
  publication-title: Log. Methods Comput. Sci.
– start-page: 47
  year: 1992
  ident: 10.1016/j.jlamp.2019.100480_br1070
  article-title: Testing probabilistic and nondeterministic processes
– volume: vol. 1119
  start-page: 299
  year: 1996
  ident: 10.1016/j.jlamp.2019.100480_br0940
  article-title: Testing probabilistic automata
– year: 1987
  ident: 10.1016/j.jlamp.2019.100480_br1060
  article-title: Event structures
– volume: vol. 8413
  start-page: 187
  year: 2014
  ident: 10.1016/j.jlamp.2019.100480_br0410
  article-title: FDR3 – a modern refinement checker for CSP
– start-page: 311
  year: 1991
  ident: 10.1016/j.jlamp.2019.100480_br0910
  article-title: Modeling concurrency with geometry
– start-page: 148
  year: 1992
  ident: 10.1016/j.jlamp.2019.100480_br0970
  article-title: Equivalences on observable processes
– volume: vol. 3185
  start-page: 200
  year: 2004
  ident: 10.1016/j.jlamp.2019.100480_br0080
  article-title: A tutorial on Uppaal
– volume: vol. F13
  start-page: 261
  year: 1985
  ident: 10.1016/j.jlamp.2019.100480_br0190
  article-title: Notes on algebraic calculi of processes
– volume: 3
  start-page: 125
  issue: 2
  year: 1977
  ident: 10.1016/j.jlamp.2019.100480_br0770
  article-title: Proving the correctness of multiprocess programs
  publication-title: IEEE Trans. Softw. Eng.
  doi: 10.1109/TSE.1977.229904
– volume: 37
  start-page: 245
  year: 1985
  ident: 10.1016/j.jlamp.2019.100480_br0950
  article-title: Higher-level synchronising devices in Meije-SCCS
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(85)90093-3
– volume: vol. 11665
  start-page: 45
  year: 2019
  ident: 10.1016/j.jlamp.2019.100480_br0580
  article-title: Reward testing equivalences for processes
– volume: 43
  start-page: 555
  issue: 3
  year: 1996
  ident: 10.1016/j.jlamp.2019.100480_br0690
  article-title: Branching time and abstraction in bisimulation semantics
  publication-title: J. ACM
  doi: 10.1145/233551.233556
– volume: 46
  start-page: 209
  issue: 3
  year: 2009
  ident: 10.1016/j.jlamp.2019.100480_br0260
  article-title: Liveness of a mutex algorithm in a fair process algebra
  publication-title: Acta Inform.
  doi: 10.1007/s00236-009-0092-9
– volume: 37
  start-page: 229
  year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0420
  article-title: Refinement of actions and equivalence notions for concurrent systems
  publication-title: Acta Inform.
  doi: 10.1007/s002360000041
– year: 2002
  ident: 10.1016/j.jlamp.2019.100480_br0780
– year: 1985
  ident: 10.1016/j.jlamp.2019.100480_br0700
– volume: 412
  start-page: 3283
  issue: 28
  year: 2011
  ident: 10.1016/j.jlamp.2019.100480_br0530
  article-title: On cool congruence formats for weak bisimulations
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2011.02.036
– volume: vol. 7211
  start-page: 295
  year: 2012
  ident: 10.1016/j.jlamp.2019.100480_br0360
  article-title: A process algebra for wireless mesh networks
– year: 2014
  ident: 10.1016/j.jlamp.2019.100480_br0620
– volume: 14
  start-page: 9:1
  issue: 1
  year: 2015
  ident: 10.1016/j.jlamp.2019.100480_br0110
  article-title: The psi-calculi workbench: a generic tool for applied process calculi
  publication-title: ACM Trans. Embed. Comput. Syst.
  doi: 10.1145/2682570
– year: 1999
  ident: 10.1016/j.jlamp.2019.100480_br0830
– start-page: 136
  year: 2011
  ident: 10.1016/j.jlamp.2019.100480_br0520
  article-title: Bisimulation
– volume: vol. 89
  start-page: 81
  year: 2012
  ident: 10.1016/j.jlamp.2019.100480_br0540
  article-title: Musings on encodings and expressiveness
– volume: vol. 115
  start-page: 264
  year: 1981
  ident: 10.1016/j.jlamp.2019.100480_br0790
  article-title: Impartiality, justice and fairness: the ethics of concurrent termination
– volume: 43
  start-page: 73
  issue: 2
  year: 2006
  ident: 10.1016/j.jlamp.2019.100480_br0240
  article-title: Fairness of actions in system computations
  publication-title: Acta Inform.
  doi: 10.1007/s00236-006-0011-2
– year: 2010
  ident: 10.1016/j.jlamp.2019.100480_br0050
– start-page: 3
  year: 2001
  ident: 10.1016/j.jlamp.2019.100480_br0500
  article-title: The linear time – branching time spectrum, I: the semantics of concrete, sequential processes
– volume: 52
  start-page: 175
  issue: 2–3
  year: 2015
  ident: 10.1016/j.jlamp.2019.100480_br0440
  article-title: CCS: It's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
  publication-title: Acta Inform.
  doi: 10.1007/s00236-015-0221-6
– year: 1989
  ident: 10.1016/j.jlamp.2019.100480_br0820
  article-title: Communication and Concurrency
– year: 1997
  ident: 10.1016/j.jlamp.2019.100480_br0930
– volume: 178
  start-page: 180
  issue: 1
  year: 2002
  ident: 10.1016/j.jlamp.2019.100480_br0990
  article-title: Ordered SOS process languages for branching and eager bisimulations
  publication-title: Inf. Comput.
  doi: 10.1016/S0890-5401(02)93161-5
– volume: vol. 1
  start-page: 89
  year: 1986
  ident: 10.1016/j.jlamp.2019.100480_br0150
  article-title: Algebra of communicating processes
– volume: vol. 9360
  start-page: 99
  year: 2015
  ident: 10.1016/j.jlamp.2019.100480_br0550
  article-title: Structure preserving bisimilarity, supporting an operational petri net semantics of CCSP
– volume: vol. 944
  start-page: 648
  year: 1995
  ident: 10.1016/j.jlamp.2019.100480_br0870
  article-title: Divergence and fair testing
SSID ssj0001687831
Score 2.2033806
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 100480
Title Ensuring liveness properties of distributed systems: Open problems
Volume 109
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwELWgLCx8I8qXPLBBqsQ4ic1WUKGAYAKJLYodG1FKWrVl4ddzTuwmfFXAElWWa0V57vnl-u4dQgdZKIUfCOYJXzKPAkHwAGbqxQoGOInTVJo85M1t1L2nVw_hQ9U4sagumYiWfPu2ruQ_qMIY4GqqZP-A7HRRGIDPgC9cAWG4_grjTj4uqwz7LmYNTW59ZExSDQvMjCuuaWgFrLK0bC4EcEZEcmg7yYx_YKcuJBZerv1H8_fyk7T9pkvpeSnsenFHny2FuoBdJZR6tqrtelIh4DWBRhF7CPAyjxCffQiUPq-FuqAoR_82CpcJgV6rB5vaeIIGvFXN_uh5_eksmioEnfislxSLJGaRpFxkHi0QeCcgDbTQvrzu3lYptYjFrOhAOb195zNVKPq-3E6Ni9RIxd0KWrLPG7dLaFfRnMrX0LLrtIFt4F1Hpw5p7JDGFdJ4oHENaWyRPsEGZ-xw3kD35527s65nu194knA68VjIMuBjgggdxVwoP9CKSz-Fw1Uey4xQKYEdwwtvepxpoXVGOc2o4qFJagigoZuokQ9ytYUw_O5iP-JAhSNJtQxZyoEJ6jgLmBZhHDcRcc8hkdYa3nQo6SczYGiio-mXhqUzyqzp23-bvoMWq325ixqT0avaA_o3EfsW9ncpK1yi
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=Ensuring+liveness+properties+of+distributed+systems%3A+Open+problems&rft.jtitle=Journal+of+logical+and+algebraic+methods+in+programming&rft.au=van+Glabbeek%2C+Rob&rft.date=2019-12-01&rft.issn=2352-2208&rft.volume=109&rft.spage=100480&rft_id=info:doi/10.1016%2Fj.jlamp.2019.100480&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jlamp_2019_100480
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