CONCUR '91 : 2nd International Conference on Concurrency Theory Amsterdam, The Netherlands, August 26 29, 1991 : proceedings
CONCUR'91 is the second international conference on concurrency theory, organized in association with the NFI project Transfer. It is a sequel to the CONCUR'90 conference. Its basic aim is to communicate ongoing work in concurrency theory. This proceedings volume contains 30 papers selecte...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
527 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • CONCUR'91, 2nd International Conference on Concurrency Theory, Amsterdam, The Netherlands, August 26-29, 1991, proceedings, J.C.M. Baeten, J.F. Groote (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (IX-540 p.), Lecture notes in computer science, 0-387-54430-5 • CONCUR '91, Texte imprimé, 9783662203736 |
Taula de continguts:
- Formal techniques for parallel object-oriented languages
- Causal models for rational algebraic processes
- Action and state-based logics for process algebras
- A tool set for deciding behavioral equivalences
- Causality based models for the design of concurrent systems
- Modal logics for mobile processes
- Towards a design calculus for communicating programs
- A theory of testing for ACP
- Real space process algebra
- The failure of failures in a paradigm for asynchronous communication
- Embedding as a tool for language comparison: On the CSP hierarchy
- A conditional operator for CCS
- Algebraic formulations of trace theory
- Compositional synthesis of live and bounded free choice Petri nets
- The observation algebra of spatial pomsets
- Synchrony loosening transformations for interacting processes
- A compositional model for layered distributed systems
- Process algebra with guards
- Model checking and modular verification
- Geometric logic, causality and event structures
- Extended Horn clauses: the framework and some semantics
- Action systems and action refinement in the development of parallel systems
- Invariant semantics of nets with inhibitor arcs
- Abstract timed observation and process algebra
- Simulations between specifications of distributed systems
- Using truth-preserving reductions to improve the clarity of kripke-models
- Completeness in real time process algebra
- Distributed CCS
- Time-constrained automata
- Relating processes with respect to speed
- Testing, betting and timed true concurrency
- Fairness in models with true concurrency
- Efficient verification of determinate processes
- Experiments on processes with backtracking
- Some finite-graph models for process algebra
- A method for the development of totally correct shared-state parallel programs
- Reduced labelled transition systems save verification effort.