On the complexity of bisimilarity for value-passing processes

DOI10.1007/3-540-60692-0_56MaRDI QIDQ2956690zbMATH OpenOpenAlexFDO

Authors Luca Trevisan, Michele Boreale

Publication date 19 January 2017

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

Full work available at URL https://doi.org/10.1007/3-540-60692-0_56

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A complexity analysis of bisimilarity for value-passing processes
• A symbolic approach to value-passing processes
• Decision procedures and graph reductions for bisimulation equivalences part 1
• scientific article; zbMATH DE number 1231555
• Symbolic bisimulations

Cited in

(4)

• Strong bisimilarity of simple process algebras: Complexity lower bounds
• A complexity analysis of bisimilarity for value-passing processes
• On Bisimilarity and Substitution in Presence of Replication
• scientific article; zbMATH DE number 1231555 (Why is no real title available?)

This page was built for publication: On the complexity of bisimilarity for value-passing processes

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