(Enter summary)
Abstract: Some alternative characterizations of late full congruences, either strong or
weak, are presented. Those congruences are classically defined by requiring
the corresponding ground bisimilarity under all name substitutions.
We first improve on those infinitary definitions by showing that congruences
can be alternatively characterized in the -calculus by sticking to a finite
number of carefully identified substitutions, and hence, by resorting to only a
finite number of ground bisimilarity... (Update)
Active bibliography (related documents): More All
0.5: Adding Enrichments to Refined Interleavings: A New Model for the .. - Baldamus (1999)
(Correct)
0.4: Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995)
(Correct)
0.3: Complete Inference Systems for Weak Bisimulation Equivalences in.. - Lin (1995)
(Correct)
Similar documents based on text: More All
1.3: An Interpretation of the Fan Theorem in Type Theory - Fridlender (1998)
(Correct)
1.2: Fixpoint Alternation: Arithmetic, Transition Systems, and the.. - Bradfield (1998)
(Correct)
1.2: On Plain and Hereditary History-Preserving Bisimulation - Fröschle, Hildebrandt (1999)
(Correct)
BibTeX entry: (Update)
@techreport{ quaglia97finitary,
author = "Paola Quaglia",
title = "On the Finitary Characterization of pi-Congruences",
number = "RS-97-52",
year = "1997",
url = "citeseer.ist.psu.edu/quaglia97finitary.html" }
Citations (may not include all citations):
906
A Structural Approach to Operational Semantics
- Plotkin - 1981
854
Information and Computation (context) - Milner, Parrow et al. - 1992
502
Concurrency and automata on infinite sequences (context) - Park - 1981
484
A Calculus of Communicating Systems (context) - Milner - 1980
357
Algebraic Laws for Nondeterminism and Concurrency (context) - Hennessy, Milner - 1985
232
The Concurrency Workbench: A Semantics-Based Tool for the Ve..
- Cleaveland, Parrow et al. - 1993
218
Process Algebra for Synchronous Communication (context) - Bergstra, Klop - 1984
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
216
Theoretical Computer Science (context) - Milner, synchrony - 1983
202
International Series in Computer Science (context) - Milner, Concurrency - 1989
109
Theoretical Computer Science (context) - Hennessy, Lin - 1995
84
A Domain Equation for Bisimulation (context) - Abramsky - 1991
76
The Polyadic -Calculus: a Tutorial
- Milner - 1992
64
Turning SOS Rules into Equations
- Aceto, Bloom et al. - 1994
49
A Theory of Bisimulation for the -calculus (context) - Sangiorgi - 1996
24
Higher level synchronizing devices in MEIJE-SCCS (context) - De Simone - 1985
18
calculus with Explicit Substitutions (context) - Ferrari, Montanari et al. - 1996
17
Axiomatising finite concurrent processes (context) - Hennessy - 1988
14
Final Semantics for the -calculus (context) - Honsell, Lenisa et al. - 1997
11
axiomatising finite concurrent processes (context) - Aceto - 1994
10
Complete Inference Systems for Weak Bisimulation Equivalence..
- Lin - 1995
10
Symbolic Bisimulation and Proof Systems for the -Calculus (context) - Lin - 1994
4
The Weak Late -calculus Semantics as Observation Equivalence (context) - Ferrari, Montanari et al. - 1995
2
calculus with explicit substitutions (context) - Quaglia - 1996
Documents on the same site (http://www.brics.dk/~quaglia/papers.html): More
A Fully Parallel Calculus of Synchronizing Processes - Latella, Quaglia (1993)
(Correct)
Towards a Semantic-Based Verification Environment for the .. - Ferrari, Modoni, Quaglia (1995)
(Correct)
The π-Calculus: Notes on Labelled Semantics - Quaglia (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