|
279
|
Universal coalgebra: a theory of systems
– J. J. M. M. Rutten
- 2000
|
|
20
|
Domain theory for concurrency
– Mikkel Nygaard
- 2003
|
|
1
|
Strategic Directions in Computing Research Concurrency Working Group Report
– Rance Cleaveland, Scott A. Smolka (eds.), Scott A. Smolka
- 1996
|
|
1
|
On the Bisimulation Theory and Axiomatization of Higher-order Process Calculi
– Xian Xu
|
|
6
|
Synthesising Labelled Transitions and Operational Congruences in Reactive Systems, Part 1
– James J. Leifer
- 2002
|
|
31
|
Operational congruences for reactive systems
– James Judi Leifer
- 2001
|
|
29
|
On the Foundations of Final Coalgebra Semantics: non-well-founded sets, partial orders, metric spaces
– Daniele Turi, Jan Rutten
- 1998
|
|
47
|
On the Foundations of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
– Jan J. M. M. Rutten , Daniele Turi
- 1998
|
|
242
|
Relations in Concurrency
– Glynn Winskel
|
|
5
|
Categorical Models for Concurrency: Independence, Fairness and Dataflow
– Thomas Troels Hildebrandt
- 2000
|
|
|
Adding Enrichments to Refined Interleavings: A New Model for the π-Calculus
– Michael Baldamus
- 1999
|
|
18
|
A theory of bisimulation for a fragment of concurrent ML with local names
– Alan Jeffrey, Julian Rathke
- 2003
|
|
35
|
A brief history of process algebra
– J. C. M. Baeten
- 2004
|
|
37
|
A Coinduction Principle for Recursive Data Types Based on Bisimulation
– Marcelo P. Fiore
- 1996
|
|
52
|
Initial Algebra and Final Coalgebra Semantics for Concurrency
– Jan Rutten, Daniele Turi
- 1994
|
|
214
|
Domain Theory in Logical Form
– Samson Abramsky
- 1991
|
|
12
|
Programming Metalogics with a Fixpoint Type
– Roy Louis Crole, C Fl Roy Louis Crole, Prof E. Moggi
- 1992
|
|
21
|
Correspondence between Operational and Denotational Semantics
– C. -h. L. Ong
- 1995
|
|
33
|
A Theory of Bisimulation for the pi-calculus
– Davide Sangiorgi
- 1993
|