Branching bisimulation for context-free processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

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 Huttel. Going further along these lines, we prove that the class of reduced and proper context-free processes is closed under quotient by their greates branching bisimulation. moreover, the construction of the factor graph is in PSPACE.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1789.pdf (1.44 Mo) Télécharger le fichier

Dates and versions

inria-00077029 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077029 , version 1

Cite

Didier Caucal, Dung Huynh, Lu Tian. Branching bisimulation for context-free processes. [Research Report] RR-1789, INRIA. 1992. ⟨inria-00077029⟩
156 View
132 Download

Share

Gmail Mastodon Facebook X LinkedIn More