Decomposition and complexity of hereditary history preserving bisimulation on BPP

Authors:
Sibylle Fröschle;Sławomir Lasota
Affiliations:
Institute of Informatics, Warsaw University, Warszawa, Banacha, Poland;Institute of Informatics, Warsaw University, Warszawa, Banacha, Poland
Venue:
CONCUR 2005 - Concurrency Theory
Year:
2005

Citing 11
Cited 1

Unique decomposition of processes

Theoretical Computer Science
Deciding true concurrency equivalences on safe, finite nets

ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
On Plain and Hereditary History-Preserving Bisimulation

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Behavioural Equivalence for Infinite Systems - Partially Decidable!

Proceedings of the 17th International Conference on Application and Theory of Petri Nets
On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes

Proceedings of the 7th International Conference on Computer Aided Verification
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Undecidability of domino games and hhp-bisimilarity

Information and Computation
The decidability border of hereditary history preserving bisimilarity

Information Processing Letters
Composition and decomposition in true-concurrency

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Non-interleaving bisimulation equivalences on Basic Parallel Processes

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.