✦ LIBER ✦

Strong Fairness and Full Abstraction for Communicating Processes

✍ Scribed by Susan Older

Book ID: 112252513
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 296 KB
Volume: 163
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.2000.2886

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong Fairness and Recursive Communicat

Strong Fairness and Recursive Communicating Processes

✍ Susan Older 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 799 KB

Fairness-the guarantee that every process enabled sufficiently often will eventually make progress-provides a convenient and often useful abstraction from timing details that affect how parallel processes interact with one another. For processes that communicate via synchronous message passing, stro

Full Abstraction for Strongly Fair Commu

Full Abstraction for Strongly Fair Communicating Processes

✍ Stephen Brookes; Susan Older 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

Full abstraction for strongly fair commu

Full abstraction for strongly fair communicating processes : Stephen Brookes and Susan Older http://www.elsevier.nl/locate/entcs/volume1/brookes

📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 80 KB

Games and Full Abstraction for FPC

✍ Guy McCusker 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 591 KB

Types and full abstraction for polyadic

Types and full abstraction for polyadic π-calculus

✍ Paola Quaglia; David Walker 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 376 KB

τ-Bisimulations and full abstraction for

τ-Bisimulations and full abstraction for refinement of actions

✍ F. Cherief; Ph. Schnoebelen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 525 KB