Silence is golden: Branching bisimilarity is decidable for context-free processes

Hans Hüttel

doi:10.1007/3-540-55179-4_2

Silence is golden: Branching bisimilarity is decidable for context-free processes

^*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

11 Citations (Scopus)

Abstract

We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.

Original language	English
Title of host publication	Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings
Editors	Kim G. Larsen, Arne Skou
Number of pages	11
Publisher	Physica-Verlag
Publication date	1991
Pages	2-12
ISBN (Print)	9783540551799
DOIs	https://doi.org/10.1007/3-540-55179-4_2
Publication status	Published - 1991
Event	3rd International Workshop on Computer Aided Verification, CAV 1991 - Aalborg, Denmark Duration: 1 Jul 1991 → 4 Jul 1991

Conference

Conference	3rd International Workshop on Computer Aided Verification, CAV 1991
Country/Territory	Denmark
City	Aalborg
Period	01/07/1991 → 04/07/1991
Sponsor	Den Humanistiske Fakultet, Danish National Research Council

Series	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	575 LNCS
ISSN	0302-9743

Access to Document

10.1007/3-540-55179-4_2

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

Hüttel, Hans. / Silence is golden : Branching bisimilarity is decidable for context-free processes. Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings. editor / Kim G. Larsen ; Arne Skou. Physica-Verlag, 1991. pp. 2-12 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 575 LNCS).

@inproceedings{2cb70984e82d496bb1dfbf7d98b1a073,

title = "Silence is golden: Branching bisimilarity is decidable for context-free processes",

abstract = "We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.",

author = "Hans H{\"u}ttel",

year = "1991",

doi = "10.1007/3-540-55179-4_2",

language = "English",

isbn = "9783540551799",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Physica-Verlag",

pages = "2--12",

editor = "Larsen, {Kim G.} and Arne Skou",

booktitle = "Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings",

note = "3rd International Workshop on Computer Aided Verification, CAV 1991 ; Conference date: 01-07-1991 Through 04-07-1991",

}

Hüttel, H 1991, Silence is golden: Branching bisimilarity is decidable for context-free processes. in KG Larsen & A Skou (eds), Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings. Physica-Verlag, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 575 LNCS, pp. 2-12, 3rd International Workshop on Computer Aided Verification, CAV 1991, Aalborg, Denmark, 01/07/1991. https://doi.org/10.1007/3-540-55179-4_2

Silence is golden: Branching bisimilarity is decidable for context-free processes. / Hüttel, Hans.
Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings. ed. / Kim G. Larsen; Arne Skou. Physica-Verlag, 1991. p. 2-12 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 575 LNCS).

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

TY - GEN

T1 - Silence is golden

T2 - 3rd International Workshop on Computer Aided Verification, CAV 1991

AU - Hüttel, Hans

PY - 1991

Y1 - 1991

N2 - We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.

AB - We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.

UR - http://www.scopus.com/inward/record.url?scp=11544270415&partnerID=8YFLogxK

U2 - 10.1007/3-540-55179-4_2

DO - 10.1007/3-540-55179-4_2

M3 - Article in proceeding

AN - SCOPUS:11544270415

SN - 9783540551799

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 2

EP - 12

BT - Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings

A2 - Larsen, Kim G.

A2 - Skou, Arne

PB - Physica-Verlag

Y2 - 1 July 1991 through 4 July 1991

ER -

Hüttel H. Silence is golden: Branching bisimilarity is decidable for context-free processes. In Larsen KG, Skou A, editors, Computer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings. Physica-Verlag. 1991. p. 2-12. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 575 LNCS). doi: 10.1007/3-540-55179-4_2

Silence is golden: Branching bisimilarity is decidable for context-free processes

Abstract

Conference

Access to Document

AUB Link

Other files and links

Cite this