default search action
Theoretical Computer Science, Volume 177
Volume 177, Number 1, 30 April 1997
- Stuart Oliver Anderson, John Power:
A Representable Approach to Finite Nondeterminism. 3-25 - Torben Braüner:
A General Adequacy Result for a Linear Functional Language. 27-58 - Antonio Bucciarelli:
Degrees of Parallelism in the Continuous Type Hierarchy. 59-71 - J. Robin B. Cockett, David A. Spooner:
Constructing Process Categories. 73-109 - Bob Flagg, Ralph Kopperman:
Continuity Spaces: Reconciling Domains and Metric Spaces. 111-138 - Doris Nolte, Lutz Priese:
Abstract Fairness and Semantics. 139-153 - Guo-Qiang Zhang, William C. Rounds:
Defaults in Domain Theory. 155-182 - Gary T. Leavens, Don Pigozzi:
The Behavior-Realization Adjunction and Generalized Homomorphic Relations. 183-216 - Zoltán Ésik:
Completeness of Park Induction. 217-283
Volume 177, Number 2, 15 May 1997
- Alban Ponse, Chris Verhoef, Bas van Vlijmen:
Algebra of Communicating Processes - Preface to the Special Issue. 285-286 - Jos L. M. Vrancken:
The Algebra of Communicating Processes With Empty Process. 287-328 - Rob J. van Glabbeek:
Notes on the Methodology of CCS and CSP. 329-349 - Pedro R. D'Argenio, Chris Verhoef:
A General Conservative Extension Theorem in Process Algebras with Inequalities. 351-380 - Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with Propositional Signals. 381-405 - Wan J. Fokkink, Hans Zantema:
Termination Modulo Equations by Abstract Commutation with an Application to Iteration. 407-423 - Jos van Wamel:
Process Algebra with Language Matching. 425-458 - Lars-Åke Fredlund, Jan Friso Groote, Henri Korver:
Formal Verification of a Leader Election Protocol in Process Algebra. 459-486 - Marc Bezem, Alban Ponse:
Two Finite Specifications of a Queue. 487-507
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.