π-calculus models of synchronous and asynchronous message passing (Extended abstract)

被引：0
|
作者：
Potter, JM [1 ]
Zic, JJ [1 ]
Liu, AYW [1 ]
机构：
[1] Macquarie Univ, Microsoft Res Inst, MPCE, Sydney, NSW 2109, Australia
来源：
FORMAL METHODS PACIFIC '97 | 1997年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：309 / 310
页数：2
相关论文
共 50 条
  • [31] Extending the theory of Owicki and Gries with asynchronous message passing
    Goldson, D
    ASIA-PACIFIC SOFTWARE ENGINEERING CONFERENCE, PROCEEDINGS, 2003, : 532 - 541
  • [32] EFFICIENT SPMD CONSTRUCTS FOR ASYNCHRONOUS MESSAGE PASSING ARCHITECTURES
    MAJUMDAR, A
    CHEN, MC
    SIGPLAN NOTICES, 1993, 28 (01): : 85 - 85
  • [33] A fully abstract encoding of the π-calculus with data terms (Extended abstract)
    Baldamus, M
    Parrow, J
    Victor, B
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1202 - 1213
  • [34] Models for asynchronous message handling
    Langendoen, K
    Bhoedjang, R
    Bal, H
    IEEE CONCURRENCY, 1997, 5 (02): : 28 - &
  • [35] Coercive subtyping for the calculus of constructions (extended abstract)
    Chen, G
    ACM SIGPLAN NOTICES, 2003, 38 (01) : 150 - 159
  • [36] Interpreting a reconstructed relational calculus: Extended Abstract
    Watters, Aaron
    SIGMOD Record, 1993, 22 (02) : 367 - 376
  • [37] Asynchronous active recommendation systems (Extended abstract)
    Awerbuch, Baruch
    Nisgav, Aviv
    Patt-Shamir, Boaz
    PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, 4878 : 48 - +
  • [38] Deadlock analysis of synchronous message-passing programs
    Zhou, J
    Tai, KC
    INTERNATIONAL SYMPOSIUM ON SOFTWARE ENGINEERING FOR PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1999, : 62 - 69
  • [39] Renaming in synchronous message passing systems with Byzantine failures
    Okun, Michael
    Barak, Amnon
    Gafni, Eli
    DISTRIBUTED COMPUTING, 2008, 20 (06) : 403 - 413
  • [40] Renaming in synchronous message passing systems with Byzantine failures
    Michael Okun
    Amnon Barak
    Eli Gafni
    Distributed Computing, 2008, 20 : 403 - 413
12345