More on Weak Bisimilarity of Normed Basic Parallel Processes

DOI10.1007/978-3-540-79228-4_17zbMATH Open1139.68386OpenAlexW1885901989MaRDI QIDQ3502645

Haiyan Chen

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_17

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Non-interleaving bisimulation equivalences on basic parallel processes 👍 👎
• A note on the complexity of deciding bisimilarity of normed unary processes 👍 👎
• Bisimilarity on basic parallel processes 👍 👎
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: More on Weak Bisimilarity of Normed Basic Parallel Processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3502645)