1. CONCUR 1990:
Amsterdam,
The Netherlands
Jos C. M. Baeten, Jan Willem Klop (Eds.):
CONCUR '90, Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands, August 27-30, 1990, Proceedings.
Lecture Notes in Computer Science 458 Springer 1990, ISBN 3-540-53048-7 BibTeX
@proceedings{DBLP:conf/concur/1990,
editor = {Jos C. M. Baeten and
Jan Willem Klop},
title = {CONCUR '90, Theories of Concurrency: Unification and Extension,
Amsterdam, The Netherlands, August 27-30, 1990, Proceedings},
booktitle = {CONCUR},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {458},
year = {1990},
isbn = {3-540-53048-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Invited Lectures
Selected Presentations
- Martín Abadi:
An Axiomatization of Lamport's Temporal Logic of Actions.
57-69 BibTeX
- Anish Arora, Paul C. Attie, Michael Evangelist, Mohamed G. Gouda:
Convergence of Iteration Systems (Extended Abstract).
70-82 BibTeX
- Jos C. M. Baeten, Jan A. Bergstra:
Process Algebra with a Zero Object.
83-98 BibTeX
- Frank S. de Boer, Catuscia Palamidessi:
On the Asynchronous Nature of Communication in Concurrent Logic Languages: A Fully Abstract Model Based on Sequences.
99-114 BibTeX
- Julian C. Bradfield, Colin Stirling:
Verifying Temporal Properties of Processes.
115-125 BibTeX
- Ivan Christoff:
Testing Equivalences and Fully Abstract Models for Probabilistic Processes.
126-140 BibTeX
- Rance Cleaveland, Bernhard Steffen:
A Preorder for Partial Process Specifications.
141-151 BibTeX
- Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager:
Back and Forth Bisimulations.
152-165 BibTeX
- Jörg Desel:
Reduction and Design of Well-behaved Concurrent Systems.
166-181 BibTeX
- Javier Esparza:
Synthesis Rules for Petri Nets, and How they Lead to New Results.
182-198 BibTeX
- Alan Fekete, Nancy A. Lynch:
The Need for Headers: An Impossibility Result for Communication over Unreliable Channels.
199-215 BibTeX
- Yulin Feng, Junbo Liu:
A Temporal Approach to Algebraic Specifications.
216-229 BibTeX
- Nissim Francez, Ira R. Forman:
Superimposition for Interacting Processes.
230-245 BibTeX
- Lars-Åke Fredlund, Bengt Jonsson, Joachim Parrow:
An Implementation of a Translational Semantics for an Imperative Language.
246-262 BibTeX
- Richard Gerber, Insup Lee:
CCSR: A Calculus for Communicating Shared Resources.
263-277 BibTeX
- Rob J. van Glabbeek:
The Linear Time-Branching Time Spectrum (Extended Abstract).
278-297 BibTeX
- E. Pascal Gribomont:
A Programming Logic for Formal Concurent Systems.
298-313 BibTeX
- Jan Friso Groote:
A New Strategy for Proving omega-Completeness applied to Process Algebra.
314-331 BibTeX
- Jan Friso Groote:
Transition System Specifications with Negative Premises (Extended Abstract).
332-341 BibTeX
- Mark B. Josephs, Jan Tijmen Udding:
Delay-Insensitive Circuits: An Algebraic Approach to their Design.
342-366 BibTeX
- Chi-Chang Jou, Scott A. Smolka:
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes.
367-383 BibTeX
- José Meseguer:
Rewriting as a Unified Model of Concurrency.
384-400 BibTeX
- Faron Moller, Chris M. N. Tofts:
A Temporal Calculus of Communicating Systems.
401-415 BibTeX
- Pawel Paczkowski:
Proving Termination of Communicating Programs.
416-426 BibTeX
- Huajun Qin, Philip Lewis:
Factorization of Finite State Machines under Observational Equivalence.
427-441 BibTeX
- Antonia Sinachopoulos:
Partial Order Logics for Elementary Net Systems: State- and Event-approaches.
442-455 BibTeX
- Scott A. Smolka, Bernhard Steffen:
Priority as Extremal Probability.
456-466 BibTeX
- Chris M. N. Tofts:
A Synchronous Calculus of Relative Frequency.
467-480 BibTeX
- Glynn Winskel:
On the Compositional Checking of Validity (Extended Abstract).
481-501 BibTeX
- Wang Yi:
Real-Time Behaviour of Asynchronous Agents.
502-520 BibTeX
- Serge Yoccoz:
Effective Solutions to Domain Equations - An Approach to Effective Denotational Semantics.
521-536 BibTeX
Copyright © Sat May 16 23:03:16 2009
by Michael Ley (ley@uni-trier.de)
