loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th Annual IEEE Symposium on Logic in Computer Science (LICS'03)
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
Ottawa, Canada
June 22-June 25
ISBN: 0-7695-1884-2
ASCII Text
x 
 
Petr Jancar, "Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete," Logic in Computer Science, Symposium on, pp. 218, 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2003.1210061,
author = {Petr Jancar},
title = {Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2003},
issn = {1043-6871},
pages = {218},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2003.1210061},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
SN - 1043-6871
SP
EP
A1 - Petr Jancar,
PY - 2003
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Petr Jancar, Techn. Univ. Ostrava
The paper shows an algorithmwhich, 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 PSPACE. Combining with the PSPACE-hardness result by Srba, PSPACE-completeness is thus established.
Citation:
Petr Jancar, "Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete," lics, pp.218, 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.