R.J. van Glabbeek  Home/Search
Context Related
| stanford.edu/pub/PS/tool.ps.gz stanford.edu/pub/tool.ps.gz stanford.edu/pub/tool.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: stanford.edu/~rvg/abstracts (more) From: stanford.edu/abstracts (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper separately, as it will be integrated with Fokkink [11] and Aceto & Ing' olfsd' ottir [2] into Aceto, Fokkink, Van Glabbeek & Ing' olfsd' ottir [1]. 7. Branching congruence has a lower complexity than any other abstract semantic equivalence used in concurrency theory [18]. 8. For sequential processes, branching congruence is preserved under action refinement, whereas weak congruence is not [15]. 9. Branching congruence has a very appealing complete axiomatization [12] 10. and better ... (Update)
Context of citations to this paper: More
...axiomatization for BPA ffiffl extended with prefix iteration, with respect to rooted branching bisimulation equivalence. Van Glabbeek [12] showed that the completeness result for prefix iteration in observation congruence from [3] follows from the completeness result for...
...to be an atomic action. The same is done in [1] for string iteration. The work of [9] has been extended in [2] and its predecessors [3, 10, 12] to cope with weak, delay, eta and branching bisimulation congruence in a setting with the unobservable action . Motivation and...
Cited by: More
Axiomatizing Flat Iteration - van Glabbeek (1997) (Correct)
A Complete Axiomatization for Prefix Iteration in Branching.. - Fokkink (1995) (Correct)
Active bibliography (related documents): More All
0.4: Axiomatizing Prefix Iteration with Silent Steps - Aceto, Fokkink, van.. (1995) (Correct)
0.4: A Complete Equational Axiomatization for BPAdelta epsilon.. - Fokkink, Zantema (1995) (Correct)
0.2: An Algebraic Semantics for Hierarchical P/T Nets - Basten, Voorhoeve (1995) (Correct)
Similar documents based on text: More All
0.9: A Complete Equational Axiomatization for Prefix.. - Aceto.. (1995) (Correct)
0.6: Complete Proof Systems for Observation Congruences in.. - Lin (1998) (Correct)
0.5: Complete Inference Systems for Weak Bisimulation Equivalences in.. - Lin (1995) (Correct)
Related documents from co-citation: More All
2: Basic process algebra with iteration: completeness of its equational axioms - Fokkink, Zantema - 1994
2: Branching Time and Abstraction in Bisimulation Semantics (context) - van Glabbeek, Weijland - 1989
2: Axiomatizing prefix iteration with silent steps - Aceto, Fokkink et al. - 1996
BibTeX entry: (Update)
R.J. van Glabbeek. Branching bisimulation as a tool in the analysis of weak bisimulation. Unpublished manuscript, 1995. Available at http://boole.stanford. edu/~rvg/pub/tool.dvi.gz. http://citeseer.ist.psu.edu/vanglabbeek95branching.html More
@misc{ glabbeek95branching,
author = "R. van Glabbeek",
title = "Branching bisimulation as a tool in the analysis of weak bisimulation",
text = "R.J. van Glabbeek. Branching bisimulation as a tool in the analysis of
weak bisimulation. Unpublished manuscript, 1995. Available at http://boole.stanford.
edu/~rvg/pub/tool.dvi.gz.",
year = "1995",
url = "citeseer.ist.psu.edu/vanglabbeek95branching.html" }
Citations (may not include all citations):484 A Calculus of Communicating Systems (context) - Milner - 1980
104 Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1995
104 Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1989
104 Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland - 1990
42 A modal characterisation of observable machine-behaviour (context) - Milner - 1981
26 Three logics for branching bisimulation (context) - De Nicola, Vaandrager - 1995
25 An efficient algorithm for branching bisimulation and stutte.. - Groote, Vaandrager - 1990
20 A complete equational axiomatization for prefix iteration - Fokkink - 1994
16 Another look at abstraction (context) - Baeten, van Glabbeek - 1987
12 Term rewriting analysis (context) - Akkerman, Baeten - 1990
12 Back and forth bisimulations (context) - De Nicola, Montanari et al. - 1990
9 A complete equational axiomatization for prefix iteration wi.. - Aceto, Ing'olfsd'ottir - 1995
7 Using axiomatic presentation of behavioural equivalences for.. (context) - De Nicola, Inverardi et al. - 1990
6 Refinement in branching time semantics (context) - van Glabbeek, Weijland - 1989
4 Personal communication (context) - Fokkink - 1995
4 Branching bisimulation is an equivalence indeed (context) - Basten - 1995
3 A complete axiomatization for prefix iteration in branching .. - Fokkink - 1995
1 Equational axiomatizations for prefix iteration with silent .. (context) - Aceto, Fokkink et al. - 1995
Documents on the same site (http://theory.stanford.edu/~rvg/abstracts.html): More
The Linear Time-Branching Time Spectrum II - The semantics of.. - van Glabbeek (1993) (Correct)
Ntyft/ntyxt Rules Reduce to Ntree Rules - Fokkink, van Glabbeek (1996) (Correct)
Interleaving Semantics and Action Refinement with Atomic.. - Czaja, van Glabbeek, Goltz (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC