Peter Sewell LFCS, Department of Computer Science Edinburgh University...  Home/Search
Context
Related
| cl.cam.ac.uk/~pes20/licsnonax.ps 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: cl.cam.ac.uk/~pes20/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper considers the existence of finite equational axiomatisations of bisimulation over a calculus of finite state processes. To express even simple properties such as XE = XE[E=X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing axioms such as the above to be written as equations of higher type rather than as equation schemes. Notions of higher order transition system and bisimulation are... (Update)
Similar documents (at the sentence level):
78.2%: Bisimulation is not Finitely (First Order) Equationally.. - Sewell (Correct)
17.1%: The Algebra of - Finite State Processes (Correct)
17.1%: The Algebra of Finite State Processes - Sewell (1995) (Correct)
Active bibliography (related documents): More All
0.4: Iteration Algebras are not Finitely Axiomatizable (Extended.. - Bloom, Esik (2000) (Correct)
0.4: Nonfinite Axiomatizability of the Equational Theory of Shuffle - Ésik, Bertol (1998) (Correct)
0.3: A Completeness Theorem for Kleene Algebras and the Algebra of.. - Kozen (1994) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ lfcs-bisimulation,
author = "Peter Sewell Lfcs",
title = "Bisimulation is not Finitely (First Order) Equationally Axiomatisable",
url = "citeseer.ist.psu.edu/765415.html" }
Citations (may not include all citations):299 Algebraic Theory of Processes (context) - Hennessy - 1988
248 Expressing Mobility (context) - Sangiorgi - 1993
139 Type systems for programming languages (context) - Mitchell - 1990
97 Chapman and Hall (context) - Conway, Finite - 1993
93 A complete inference system for a class of regular behaviour.. (context) - Milner - 1984
84 A completeness theorem for Kleene algebras and the algebra o.. - Kozen - 1991
59 Two complete axiom systems for the algebra of regular events (context) - Salomaa - 1966
44 A complete axiomatisation for observational congruence of fi.. (context) - Milner - 1989
33 On defining relations for the algebra of regular events (context) - Redko - 1964
19 Process algebra with iteration - Bergstra, Bethke et al. - 1993
18 Iteration Theories: The Equational Logic of Iterative Proces.. (context) - Bloom, 'Esik - 1993
13 Theoretical Computer Science (context) - Krob, of - 1991
10 Equational axioms for regular sets (context) - Bloom, 'Esik - 1993
8 University of Edinburgh (context) - Moller, Concurrency - 1989
8 emes complets d (context) - Boffa, sur - 1990
6 A complete axiomatisation for trace congruence of finite sta.. - Rabinovich - 1993
6 Implicational axioms for the algebra of regular languages (context) - Arkhangelskii, Gorshkov - 1987
3 Iteration theories of synchronization trees (context) - Bloom, 'Esik et al. - 1993
3 A complete axiomatization for branching bisimulation congrue.. (context) - van Glabeek - 1993
3 Divergence bisimulation (context) - van Glabeek - 1993
2 Basic process algebra with iteration: Completeness of its eq.. - Fokkink, Zantema - 1993
2 University of Edinburgh (context) - Sewell
Documents on the same site (http://www.cl.cam.ac.uk/~pes20/): More
Design Rules and Abstractions (from branching and real time) - Sewell (1996) (Correct)
Global/Local Subtyping for a Distributed π-calculus - Sewell (1997) (Correct)
On Implementations and Semantics of a Concurrent Programming.. - Sewell (1997) (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