Wan Fokkink  Home/Search
Context Related
| compsci.swan.ac.uk/~csw...Kleene2.ps.gz swan.ac.uk/compsci/AllS...Kleene2.ps.gz cwi.nl/~wan/WJFmore/Kleene2.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: compsci.swan.ac.uk/~cswillem/ (more) From: swan.ac.uk/compsci/AllStaff...WJF (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A classical result from Redko [20] says that there does not exist a complete finite equational axiomatization for the Kleene star modulo trace equivalence. Fokkink and Zantema [13] showed, by means of a term rewriting analysis, that there does exist a complete finite equational axiomatization for the Kleene star up to strong bisimulation equivalence. This paper presents a simpler and shorter completeness proof. Furthermore, the result is extended to open terms, i.e., to !-completeness.... (Update)
Context of citations to this paper: More
...for BPA ffi , make a complete axiomatization for BPA ffi modulo bisimulation. The proof is based on a strategy that originates from [12]. It also uses several new techniques, which will be described in detail. Hopefully, these techniques will turn out to be applicable...
...a complete axiomatization for BPA ffi (A) modulo bisimulation. The completeness proof is based on a strategy that originates from [11]. It also uses new techniques, which will hopefully turn out to be applicable in a possible proof of Milner s conjecture (see Section 4...
Cited by: More
Ordered SOS Process Languages for Branching and Eager.. - Ulidowski, Phillips (2002) (Correct)
Some of My Favourite Results in Classic Process Algebra - Aceto (2003) (Correct)
Axiomatizations for the Perpetual Loop in Process Algebra - Fokkink (Correct)
Similar documents (at the sentence level):
29.9%: On the Completeness of the Equations for the Kleene Star in.. - Wan Fokkink (1996) (Correct)
5.8%: Basic Process Algebra with Iteration: Completeness of its.. - Fokkink, Zantema (1999) (Correct)
5.3%: Process Algebra with Recursive Operations - Bergstra, Fokkink, Ponse (Correct)
Active bibliography (related documents): More All
0.4: An Equational Axiomatization for Multi-Exit Iteration - Aceto, Fokkink (1996) (Correct)
0.4: An Axiomatization for the Terminal Cycle - Fokkink (1996) (Correct)
0.3: From Ready Simulation Semantics to Completed Tracs - Fokkink, Ingólfsdóttir (1996) (Correct)
Similar documents based on text: More All
0.5: A Complete Equational Axiomatization for BPAdelta epsilon.. - Fokkink, Zantema (1995) (Correct)
0.5: A Complete Axiomatization for Prefix Iteration in Branching.. - Fokkink (1995) (Correct)
0.4: On the Axiomatizability of Ready Traces, - Ready Simulation And (Correct)
Related documents from co-citation: More All
4: A Congruence Theorem for Structured Operational Semantics with Predicates - Baeten, Verhoef - 1993
4: A structural approach to operational semantics - Plotkin - 1981
3: Process Algebra for Synchronous Communication (context) - Bergstra, Klop - 1984
BibTeX entry: (Update)
W.J. Fokkink. On the completeness of the equations for the Kleene star in bisimulation. In M. Wirsing and M. Nivat, editors, Proceedings 5th Conference on Algebraic Methodology and Software Technology (AMAST'96), Munich, volume 1101 of LNCS, pages 180--194. Springer, 1996. http://citeseer.ist.psu.edu/fokkink96completeness.html More
@article{ fokkink96completeness,
author = "W. Fokkink",
title = "On the Completeness of the Equations for the {Kleene} Star in Bisimulation",
journal = "Lecture Notes in Computer Science",
volume = "1101",
pages = "180--??",
year = "1996",
url = "citeseer.ist.psu.edu/fokkink96completeness.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
502 Concurrency and automata on infinite sequences (context) - Park - 1981 ACM DBLP
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
123 A congruence theorem for structured operational semantics wi.. - Baeten, Verhoef - 1993
113 Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1993 ACM DBLP
97 Chapman and Hall (context) - Conway, finite - 1971
93 A complete inference system for a class of regular behaviour.. (context) - Milner - 1984 DBLP
86 Termination of term rewriting by semantic labelling - Zantema - 1995 DBLP
59 Two complete axiom systems for the algebra of regular events (context) - Salomaa - 1966
55 Concrete process algebra (context) - Baeten, Verhoef - 1995
49 Process algebra with iteration and nesting (context) - Bergstra, Bethke et al. - 1994 DBLP
44 A complete axiomatisation for observational congruence of fi.. (context) - Milner - 1989
36 Basic process algebra with iteration: completeness of its eq.. - Fokkink, Zantema - 1994
33 On defining relations for the algebra of regular events (context) - Redko - 1964
27 Bisimulation is not finitely (context) - Sewell - 1994
23 ntyxt rules reduce to ntree rules (context) - Fokkink, van Glabbeek - 1996
20 A complete equational axiomatization for prefix iteration - Fokkink - 1994 ACM DBLP
16 Theoretical Informatics and Applications (context) - Caucal, de graphes - 1990
14 Axiomatizing prefix iteration with silent steps - Aceto, Fokkink et al. - 1995 ACM DBLP
14 Verification of an alternating bit protocol by means of proc.. (context) - Bergstra, Klop - 1985 ACM DBLP
8 An equational axiomatization for multi-exit iteration - Aceto, Fokkink - 1996
8 A complete axiomatization for branching bisimulation congrue.. - van Glabbeek - 1993
8 Step bisimulation is pomset equivalence on a parallel langua.. (context) - Troeger - 1993 DBLP
1 Personal communication (context) - Aceto - 1995
Documents on the same site (http://www-compsci.swan.ac.uk/~cswillem/): More
Fast Computation of an Alternating Sum - Robbert Fokkink (Correct)
Language Preorder as a Precongruence - Wan Fokkink (Correct)
Conservative Extension in Positive/Negative Conditional Term .. - Fokkink, Verhoef (1998) (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