Strong bisimilarity on basic parallel processes in PSPACE-complete

The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space;...

Full description

Saved in:
Bibliographic Details
Published in18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings pp. 218 - 227
Main Author Jancar, P.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Arithmetic
Automata
Computer science
Concurrent computing
Logic
Natural languages
Polynomials
Terminology
Upper bound
Online AccessGet full text
ISBN0769518842
9780769518848
ISSN1043-6871
DOI10.1109/LICS.2003.1210061

Cover

More Information
Summary:The paper shows an algorithm which, given a basic parallel processes (BPP) system, constructs a set of linear mappings which characterize the (strong) bisimulation equivalence on the system. Though the number of the constructed mappings can be exponential, they can be generated in polynomial space; this shows that the problem of deciding bisimulation equivalence on BPP is in PSAPCE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.
ISBN:0769518842
9780769518848
ISSN:1043-6871
DOI:10.1109/LICS.2003.1210061