✦ LIBER ✦

Decidability of performance equivalence for basic parallel processes

✍ Scribed by Sławomir Lasota

Book ID: 108281187
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 338 KB
Volume: 360
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.02.020

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Undecidable equivalences for basic paral

Undecidable equivalences for basic parallel processes

✍ Hans Hüttel; Naoki Kobayashi; Takashi Suto 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 401 KB

Decidability of strong bisimulation of b

Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem

✍ Jitka Stríbrná 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 27 KB

Non-interleaving bisimulation equivalenc

Non-interleaving bisimulation equivalences on Basic Parallel Processes

✍ Sibylle Fröschle; Petr Jančar; Slawomir Lasota; Zdeněk Sawa 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Undecidable Equivalences for Basic Proce

Undecidable Equivalences for Basic Process Algebra

✍ J.F. Groote; H. Huttel 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 634 KB

Bisimulation Equivalence Is Decidable fo

Bisimulation Equivalence Is Decidable for All Context-Free Processes

✍ S. Christensen; H. Huttel; C. Stirling 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 480 KB

On the decidability of process equivalen

On the decidability of process equivalences for the π-calculus

✍ Mads Dam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present general results for showing process equivalences applied to the finite control fragment of the z-calculus decidable. Firstly, a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Se