Decomposition and complexity of hereditary history preserving bisimulation on BPP

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and complete equational axiomatization for the equivalence. Both results are derived from a decomposition property of hhp-b, which is the main technical contribution of the paper. Altogether, our results complement previous work on complexity and decomposition of classical and history-preserving bisimilarity on BPP. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fröschle, S., & Lasota, S. (2005). Decomposition and complexity of hereditary history preserving bisimulation on BPP. In Lecture Notes in Computer Science (Vol. 3653, pp. 263–277). Springer Verlag. https://doi.org/10.1007/11539452_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free