Paper Info
Title
Branching Bisimulation for Context-free Processes
Abstract
The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimulation is obviously decidable for finite state processes. A proof that it is also decidable for reduced and proper context-free processes has been given by Hüttel. Going further along these lines, we prove that the class of reduced and proper context-free processes is closed under quotient by their greatest branching bisimulation.
Year
DOI
Venue
1992
10.1007/3-540-56287-7_115
FSTTCS
Keywords
Field
DocType
context-free processes,branching bisimulation
Discrete mathematics,Computer science,Finite state processes,Quotient,Decidability,Branching bisimulation,Graph reduction,Branching (version control)
Conference
Volume
ISSN
ISBN
652
0302-9743
3-540-56287-7
Citations 
PageRank 
References 
2
0.39
9
Authors
1
Name
Order
Citations
PageRank
Didier Caucal147039.15