Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir  Home/Search
Context Related
| compsci.swan.ac.uk/~cswi...conway.ps.gz swan.ac.uk/compsci/AllSt...conway.ps.gz cwi.nl/~wan/WJFmore/conway.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: Fokkink and Zantema ((1994) Computer Journal 37:259--267) have shown that bisimulation equivalence has a finite equational axiomatization over the language of Basic Process Algebra with the binary Kleene star operation (BPA ). In light of this positive result on the mathematical tractability of bisimulation equivalence over BPA , a natural question to ask is whether any other (pre)congruence relation in van Glabbeek's linear time/branching time spectrum is finitely (in)equationally... (Update)
Context of citations to this paper: More
...is not finitely based. Our interest in this problem stems from previous work by two of the authors in the field of concurrency theory, see [2]. In op. cit. a collection of results was given to the e#ect that no fully invariant congruence that includes ready simulation [5, 13]...
Cited by: More
Bisimilarity is not Finitely Based over BPA with Interrupt - Aceto, Fokkink.. (2004) (Correct)
Some of My Favourite Results in Classic Process Algebra - Aceto (2003) (Correct)
Nested Semantics over Finite Trees are Equationally Hard - Aceto, Fokkink, van.. (2003) (Correct)
Similar documents (at the sentence level): More
71.2%: From Ready Simulation Semantics to Completed Tracs - Fokkink, Ingólfsdóttir (1996) (Correct)
58.5%: Decorated Trace Semantics over BPA have no Finite.. - Aceto, Fokkink.. (Correct)
5.6%: On a Question of A. Salomaa - The Equational.. - Aceto, Fokkink.. (1996) (Correct)
Active bibliography (related documents): More All
2.1: An Equational Axiomatization for Multi-Exit Iteration - Aceto, Fokkink (1996) (Correct)
0.9: Structural Operational Semantics - Aceto, Fokkink, Verhoef (1999) (Correct)
0.7: Axiomatizing Prefix Iteration with Silent Steps - Aceto, van Glabbeek.. (1995) (Correct)
Similar documents based on text: More All
0.8: A Complete Equational Axiomatization for Prefix.. - Aceto.. (1995) (Correct)
0.8: On the Axiomatizability of Ready Traces, - Ready Simulation And (Correct)
0.7: A Complete Axiomatization for Prefix Iteration in Branching.. - Fokkink (1995) (Correct)
Related documents from co-citation: More All
7: A structural approach to operational semantics - Plotkin - 1981
7: Chapman and Hall (context) - Conway, Finite - 1971
6: Concurrency and Automata on Infinite Sequences (context) - Park - 1981
BibTeX entry: (Update)
L. Aceto, W.J. Fokkink and A. Ing'olfsd'ottir. A menagerie of non-finitely based process semantics over BPA . Mathematical Structures in Computer Science, To appear. http://citeseer.ist.psu.edu/aceto96menagerie.html More
@article{ aceto98menagerie,
author = "Luca Aceto and Wan Fokkink and Anna Ing{\'o}lfsd{\'o}ttir",
title = "A menagerie of non-finitely based process semantics over~{BPA*}---from ready simulation to completed traces",
journal = "Mathematical Structures in Computer Science",
volume = "8",
number = "3",
pages = "193--230",
year = "1998",
url = "citeseer.ist.psu.edu/aceto96menagerie.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
447 Prentice-Hall International (context) - Concurrency - 1989
299 Algebraic Theory of Processes (context) - Hennessy - 1988
266 Cambridge Tracts in Theoretical Computer Science (context) - Baeten, Weijland et al. - 1990
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
204 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
192 Representation of events in nerve nets and finite automata (context) - Kleene - 1956
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
113 Decidability of bisimulation equivalence for processes gener.. (context) - Baeten, Bergstra et al. - 1993
102 Formal verification of parallel programs (context) - Keller - 1976
98 An introduction to the theory of numbers (context) - Niven, Zuckerman - 1960
97 Chapman and Hall (context) - Conway, algebra et al. - 1971
84 A completeness theorem for Kleene algebras and the algebra o.. - Kozen - 1994
78 Specification-oriented semantics for communicating processes (context) - Olderog, Hoare - 1986
59 Two complete axiom systems for the algebra of regular events (context) - Salomaa - 1966
47 Comparative Concurrency Semantics and Refinement of Actions (context) - Glabbeek - 1990
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
28 ebre de processus et synchronisations (context) - Austry, Boudol - 1984
27 Bisimulation is not finitely (context) - Sewell - 1994
27 Fixed point semantics (context) - Bergstra, Klop - 1982
20 A complete equational axiomatization for prefix iteration - Fokkink - 1994
19 Complete systems of B-rational identities (context) - Krob - 1991
18 Realization of events by logical nets (context) - Copi, Elgot et al. - 1958
17 Varieties of ordered algebras (context) - Bloom - 1976
15 The theory of binary relations (context) - J'onsson - 1988
14 Axio34 matizing prefix iteration with silent steps - Aceto, van Glabbeek et al. - 1996
12 of Pure and Applied Mathematics (context) - Eilenberg, Languages et al. - 1974
12 A complete system of identities for one-letter rational expr.. (context) - Bonnier-Rigny, Krob - 1994
11 Mathematical Structures in Computer Science (context) - Bloom, 'Esik et al. - 1993
10 Information and Computation (context) - axiomatisation, congruence et al. - 1989
9 Fully abstract models for nondeterministic Kleene algebras (context) - Corradini, De Nicola et al. - 1995
9 Computer Journal (context) - with, nesting - 1994
9 refusals and communicating processes (context) - Rounds, Brookes et al. - 1981
9 Independence of the equational axioms for iteration theories (context) - 'Esik - 1988
8 System Sci (context) - inference, for et al. - 1984
7 Theoretical Comput (context) - communicating, abstraction - 1985
7 A completeness theorem for nondeterministic Kleene algebras (context) - De Nicola, Labella - 1994
6 Programming Research Group (context) - Hoare, programs et al. - 1982
6 Full abstraction in structural operational semantics (context) - in, semantics et al. - 1993
6 of International Series of Monographs in Pure and Applied Ma.. (context) - Automata - 1969
5 Prentice-Hall International (context) - Processes - 1985
5 EATCS Monographs on Theoretical Computer Science (context) - Theories, Logic et al. - 1993
5 Theoretical Comput (context) - synchrony - 1983
5 of Lecture Notes in Computer Science (context) - Wirsing, Nivat et al. - 1996
5 Fundamenta Informaticae (context) - axiomatization, iteration et al. - 1996
5 Ukrainskii Matematicheskii Zhurnal (context) - algebra, events - 1964
4 An equational axiomatization of observation congruence for p.. (context) - Aceto, Ing'olfsd'ottir - 1995
4 rational identity system (context) - of, K- - 1992
3 Unpublished manuscript (context) - for - 1995
3 Unpublished manuscript (context) - of, process et al. - 1994
3 Theoretical Comput (context) - Crvenkovi'c, Madar'asz et al. - 1993
3 Available by anonymous ftp at the address fwi (context) - Bergstra, Bethke et al. - 1993
The graph only includes citing articles where the year of publication is known.
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