Full Abstraction for Strongly Fair Communicating Processes

Electronic Notes in Theoretical Computer Science ◽

10.1016/s1571-0661(04)00004-0 ◽

2004 ◽

Vol 1 (1) ◽

pp. 1-20

Author(s):

S Brookes

Keyword(s):

Communicating Processes ◽

Full Abstraction

Download Full-text

Full abstraction for strongly fair communicating processes

Theoretical Computer Science ◽

10.1016/0304-3975(96)80116-2 ◽

1995 ◽

Vol 152 (2) ◽

pp. 325

Keyword(s):

Communicating Processes ◽

Full Abstraction

Download Full-text

Strong Fairness and Full Abstraction for Communicating Processes

Information and Computation ◽

10.1006/inco.2000.2886 ◽

2000 ◽

Vol 163 (2) ◽

pp. 471-509 ◽

Author(s):

Susan Older

Keyword(s):

Communicating Processes ◽

Full Abstraction ◽

Strong Fairness

Download Full-text

Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes

CONCUR 2002 — Concurrency Theory - Lecture Notes in Computer Science ◽

10.1007/3-540-45694-5_31 ◽

2002 ◽

pp. 466-482 ◽

Author(s):

Stephen Brookes

Keyword(s):

Communicating Processes ◽

Full Abstraction

Download Full-text

Full Abstraction for Strongly Fair Communicating Processes

Electronic Notes in Theoretical Computer Science ◽

10.1016/s1571-0661(04)80004-5 ◽

1995 ◽

Vol 1 ◽

pp. 46-65 ◽

Author(s):

Stephen Brookes ◽

Susan Older

Keyword(s):

Communicating Processes ◽

Full Abstraction

Download Full-text

Data Communicating Processes with Unreliable Channels

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16 ◽

10.1145/2933575.2934535 ◽

2016 ◽

Author(s):

Parosh Aziz Abdulla ◽

C. Aiswarya ◽

Mohamed Faouzi Atig

Keyword(s):

Communicating Processes

Download Full-text

Extended naming conventions for communicating processes

Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 ◽

10.1145/582153.582158 ◽

1982 ◽

Author(s):

Nissim Francez

Keyword(s):

Communicating Processes

Download Full-text

Exposure to deadlock for communicating processes is hard to detect

Information Processing Letters ◽

10.1016/0020-0190(85)90033-x ◽

1985 ◽

Vol 21 (2) ◽

pp. 63-68 ◽

Author(s):

Thomas Räuchle ◽

Sam Toueg

Keyword(s):

Communicating Processes

Download Full-text

Full Abstraction for Fair Testing in CCS

Algebra and Coalgebra in Computer Science - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40206-7_14 ◽

2013 ◽

pp. 175-190 ◽

Author(s):

Tom Hirschowitz

Keyword(s):

Full Abstraction

Download Full-text

Full abstraction for non-deterministic and probabilistic extensions of PCF I: The angelic cases

Journal of Logical and Algebraic Methods in Programming ◽

10.1016/j.jlamp.2014.09.003 ◽

2015 ◽

Vol 84 (1) ◽

pp. 155-184 ◽

Author(s):

Jean Goubault-Larrecq

Keyword(s):

Full Abstraction

Download Full-text

Full Abstraction for Probabilistic PCF

Journal of the ACM ◽

10.1145/3164540 ◽

2018 ◽

Vol 65 (4) ◽

pp. 1-44 ◽

Author(s):

Thomas Ehrhard ◽

Michele Pagani ◽

Christine Tasson

Keyword(s):

Full Abstraction

Download Full-text