(Enter summary)
Abstract: In this dissertation we investigate presheaf models for concurrent computation. Our
aim is to provide a systematic treatment of bisimulation for a wide range of concurrent
process calculi. Bisimilarity is defined abstractly in terms of open maps as in the
work of Joyal, Nielsen and Winskel. Their work inspired this thesis by suggesting that
presheaf categories could provide abstract models for concurrency with a built-in notion
of bisimulation. (Update)
Cited by: More
Models for Name-Passing Processes: Interleaving and Causal.. - Cattani, Sewell (2000)
(Correct)
A Formal Calculus for Categories - Caccamo (2003)
(Correct)
Domain Theory for Concurrency - Nygaard (2003)
(Correct)
Active bibliography (related documents): More All
1.8: A Theory of Recursive Domains with Applications to Concurrency .. - Cattani, al.
(Correct)
1.2: A Theory of Recursive Domains with Applications to Concurrency - Cattani, Fiore, Winskel (1997)
(Correct)
1.1: Presheaf Models for CCS-like Languages - Cattani, Winskel (1999)
(Correct)
Similar documents based on text: More All
1.3: Topics in Semantics-based Program Manipulation - Grobauer (2001)
(Correct)
1.2: Worst Case Efficient Data Structures - Brodal (1997)
(Correct)
1.0: Efficient External-Memory Data Structures and Applications - Arge (1996)
(Correct)
Related documents from co-citation: More All
40: Information and Computation (context) - Joyal, Nielsen et al. - 1996
39: Models for Concurrency
- Nielsen, Winskel - 1994
32: Categories for the Working Mathematician (context) - Lane - 1971
BibTeX entry: (Update)
G. L. Cattani and G. Winskel. Presheaf models for concurrency. In CSL'96, volume 1258 of LNCS, pages 58--75. Springer, 1997. http://citeseer.ist.psu.edu/article/cattani99presheaf.html More
@inproceedings{ cattani96presheaf,
author = "Gian Luca Cattani and Glynn Winskel",
title = "Presheaf Models for Concurrency",
booktitle = "{CSL}",
pages = "58-75",
year = "1996",
url = "citeseer.ist.psu.edu/article/cattani99presheaf.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987
906
A structural approach to operational semantics
- Plotkin
502
Concurrency and automata on infinite sequences (context) - Park
484
A Calculus of Communicating Systems (context) - Milner
410
Mobile ambients
- Cardelli, Gordon
369
Information and Computation (context) - Moggi, computations - 1991
248
Expressing Mobility (context) - Sangiorgi - 1992
216
Theoretical Computer Science (context) - Milner, Parrow et al. - 1993
216
Theoretical Computer Science (context) - Milner, synchrony - 1983
214
Domains for denotational semantics (context) - Scott
194
The Formal Semantics of Programming Languages (context) - Winskel - 1993
179
The lazy lambda calculus
- Abramsky - 1990
168
Theoretical Computer Science (context) - Nielsen, Plotkin et al. - 1981
150
The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
149
calculus: a tutorial (context) - Milner
146
A powerdomain construction (context) - Plotkin - 1976
144
Models for concurrency
- Winskel, Nielsen
144
Models for concurrency
- Winskel, Nielsen
109
Continuous lattices (context) - Scott
99
volume 5 of Graduate Texts in Mathematics (context) - Lane, the et al. - 1971
97
Mathematical Structures in Computer Science (context) - Milner, processes - 1992
91
A final coalgebra theorem (context) - Aczel, Mendler - 1989
89
Calculi for interaction
- Milner
84
A domain equation for bisimulation (context) - Abramsky - 1991
83
volume 7 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Types - 1989
80
Review of the elements of 2-categories (context) - Kelly, Street
77
Full abstraction for a simple parallel programming language (context) - Hennessy, Plotkin
71
Modelling concurrency with partial orders
- Pratt - 1986
69
Information and Computation (context) - Joyal, Nielsen et al. - 1996
69
Relational properties of domains
- Pitts - 1996
67
Towards a mathematical operational semantics
- Turi, Plotkin
65
Sheaves in Geometry and Logic: A First Introduction to Topos.. (context) - Lane, Moerdijk - 1992
59
Axiomatic Domain Theory in Categories of Partial Maps (context) - Fiore - 1996
58
Theoretical Computer Science (context) - Winskel
58
Algebraically complete categories (context) - Freyd - 1991
58
Presheaf models for concurrency
- Cattani, Winskel
50
From rewrite rules to bisimulation congruences
- Sewell
50
Bisimulation for labelled Markov processes
- Blute, Desharnais et al.
49
A co-induction principle for recursively defined domains
- Pitts
48
A technique of state space search based on unfolding
- McMillan - 1995
46
Relational parametricity and local variables (context) - O'Hearn, Tennent - 1993
46
Initial algebra and final coalgebra semantics for concurrenc..
- Rutten, Turi
45
Asynchrony and the #-calculus (context) - Boudol - 1992
45
Information and Computation (context) - Power, tricategories - 1995
42
volume 752 of Lecture Notes in Mathematics (context) - Barr, categories - 1979
42
Homology of higher dimensional automata
- Goubault, Jensen
38
International Series in Computer Science (context) - Milner, Concurrency - 1989
38
Full abstraction for sequential languages: the state of the .. (context) - Berry, Curien et al. - 1985
37
A coinduction principle for recursive data types based on bi..
- Fiore - 1996
36
Formal Category Theory: Adjointness for 2-Categories (context) - Gray - 1974
36
A process algebraic view of Linda coordination primitives
- Busi, Gorrieri et al.
36
Remarks on algebraically compact categories (context) - Freyd - 1992
35
Plain CHOCS: A second generation calculus for higher order p.. (context) - Thomsen - 1993
35
Two-dimensional monad theory (context) - Blackwell, Kelly et al. - 1989
35
Monads for which structures are adjoints to units (context) - Kock - 1995
34
Bisimulation for higher-order process calculi
- Sangiorgi - 1996
34
Categorical Type Theory (context) - Jacobs - 1991
34
Equality in hyperdoctrines and comprehension schema as an ad.. (context) - Lawvere
33
A completeness theorem for open maps (context) - Joyal, Moerdijk - 1994
30
Functorial Operational Semantics and its denotational dual (context) - Turi - 1996
29
On closed categories of functors (context) - Day - 1970
29
Coherence for compact closed categories (context) - Kelly, Laplaza - 1980
28
volume 50 of Encyclopedia of Mathematics and its Application.. (context) - Borceux, categorical - 1994
27
A presheaf semantics of value-passing processes
- Winskel
27
volume 3 of Cambridge studies in advanced mathematics (context) - Johnstone - 1982
27
Accessible Categories: The Foundations of Categorical Model .. (context) - Makkai, Pare - 1989
27
On higher dimensional transition systems
- Cattani, Sassone - 1998
27
Higher dimensional transition systems
- Cattani, Sassone
26
and agent-passing calculi (context) - Sangiorgi, internal - 1995
26
A fixpoint theorem for complete categories (context) - Lambek - 1968
24
Communicating Sequential Processes (context) - Anthony, Hoare
24
Detecting deadlocks in concurrent systems
- Fajstrup, Goubault et al.
23
A powerdomain for countable nondeterminism (context) - Plotkin
22
On semantic foundations for applicative multiprogramming (context) - Abramsky - 1983
22
Bisimulation through probabilistic testing (context) - Larsen, Skou - 1991
21
A theory of recursive domains with applications to concurren..
- Cattani, Fiore et al. - 1998
20
A fully abstract domain model for the #-calculus (context) - Stark
20
the operational semantics of a coordination language (context) - Ciancarini, Jensen et al. - 1995
19
A category of labelled petri nets and compositional proof sy.. (context) - Winskel - 1988
19
Hereditary history preserving bisimulation or what is the po..
- Bednarczyk - 1991
18
volume 39 of NorthHolland Mathematical Library (context) - Freyd, Scedrov et al. - 1990
17
Models for concurrency: towards a classification
- Sassone, Nielsen et al. - 1996
17
A fully-abstract model for the #-calculus (context) - Fiore, Moggi et al.
16
Complete cuboidal sets in axiomatic domain theory
- Fiore, Plotkin et al.
15
Domains of higher dimensional automata
- Goubault - 1993
14
A categorical axiomatics for bisimulation
- Cattani, Power et al.
13
An extension of models of axiomatic domain theory to models ..
- Fiore, Plotkin
12
Fixed-point constructions in order-enriched categories (context) - Wand
12
autonomous categories and cofree algebras (context) - Seely
11
A linear metalanguage for concurrency
- Winskel - 1998
11
Modelling concurrency with geometry (context) - Pratt
10
Introduction to bicategories (context) - Benabou - 1967
10
Behaviour structures and nets (context) - Rabinovitch, Traktenbrot - 1988
10
Algebraic completeness and compactness in an enriched settin.. (context) - Plotkin - 1995
8
Induction and coinduction via subset types and quotient type.. (context) - Hermida, Jacobs - 1995
8
A general coherence result (context) - Power - 1989
7
Categories for fixpoint semantics (context) - Lehmann - 1976
7
Memoirs of the American Mathematical Society (context) - Gordon, Power et al. - 1995
7
Profinite Solutions for Recursive Domain Equations
- Gunter - 1985
7
The Geometry of Concurrency (context) - Goubault
6
volume 220 of London Mathematical Society Lecture Note Serie.. (context) - Joyal, Moerdijk et al. - 1995
6
A relational model of non-deterministic dataflow
- Hildebrandt, Panangaden et al.
6
Simply connected limits (context) - Pare - 1990
6
categorical pasting theorem (context) - Power - 1990
6
Mathematical Structures in Computer Science (context) - Simmons, construction et al. - 1994
6
Basic Concepts of Enriched Category Theory (context) - Kelly - 1982
5
Department of Computer Science (context) - Plotkin, report - 1983
5
and Glynn Winskel (context) - Cattani, Stark
4
Cauchy characterization of enriched categories (context) - Street - 1981
4
Flexible limits for 2-categories (context) - Bird, Kelly et al. - 1989
4
generalized logic and closed categories (context) - Lawvere, spaces - 1973
4
volume 92 of Contemporary Mathematics (context) - Gray, Scedrov et al. - 1989
4
Correspondence theory (context) - van Bentham - 1984
4
volume 189 of London Mathematical Society Lecture Notes Seri.. (context) - Adamek, Rosicky et al. - 1994
3
A fully abstract denotational semantics for the #-calculus (context) - Hennessy - 1996
3
The limit-colimit coincidence for categories (context) - Taylor - 1988
3
Universite Catholique de Louvain (context) - Benabou, Rapport et al. - 1973
3
Mathematical Monographs (context) - Johnstone, volume - 1977
3
Inductive inference in reflexive domains (context) - Jensen
3
Predicates and Fibrations (context) - Pavlovic - 1990
2
World Scientific Publishing Co (context) - Wyler, on et al.
2
volume 140 of Lecture Notes in Computer Science (context) - Nielsen, Schmidt et al.
1
Cahiers de Topologie et Geometrie Di#erentielle Categoriques (context) - Pitts, change et al. - 1985
1
Revetements etales et groupe fondamental (context) - Grothendieck
1
Notes taken by Paul Taylor of Peter Johnstone's course (context) - Johnstone - 1983
1
Ambients as presheaves (context) - Winskel - 1998
1
Fibered categories and the foundations of naive category the.. (context) - Benabou - 1985
1
An elementary definition of pseudo-monads (context) - Power
1
Cahiers de Topologie et Geometrie Di#erentielle Categoriques (context) - Wood - 1985
1
Cambridge University (context) - Baeten, Weijland
1
Lecture notes for a course (context) - Milner, -calculus - 1994
1
Available as Technical Report DAIMI-PB (context) - Hermida, Predicates et al. - 1993
1
Coherence for bicategories with finite bilimits (context) - Power
1
Cahiers de Topologie et Geometrie Di#erentielle Categoriques (context) - Street, bicategories - 1980
1
mail message sent to the Concurrency mailing list on 7 July (context) - van Glabbeek, higher et al. - 1991
1
Notes taken by Cocky Hillhorst of Martin Hyland's course (context) - Hyland - 1995
1
volume 1258 of Lecture Notes in Computer (context) - van Dalen, Bezem et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/DS/Ref/BRICS-DS-Ref/BRICS-DS-Ref.html): More
Logics and Automata for Verification: Expressiveness and.. - Henriksen (2000)
(Correct)
Dynamic Computation - Husfeldt (1997)
(Correct)
Games for Verification: Algorithmic Issues - Jurdzinski (2000)
(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