CONCUR '93 : 4th International conference on concurrency theory, Hildesheim, Germany, August 23 26, 1993 : proceedings
This volume contains the proceedings of CONCUR '93, the fourth in an annual series of conferences devoted to the study of concurrency. The basic aim of the CONCUR conferences is to communicate advances in concurrency theory and applications. The volume contains 31 papers selected from 113submis...
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
715 |
| 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 '93, proceedings, 4th International conference on concurrency theory, Hildesheim, Germany, August 23-26, 1993, Berlin, Springer-Verlag, 1993, 1 vol. (IX-540 p.), Lecture notes in computer science, 3-540-57208-2 • CONCUR'93, Texte imprimé, 9783662207215 |
Taula de continguts:
- The lambda-calculus with multiplicities
- A multiset semantics for the pi-calculus with replication
- Model checking mobile processes
- A practical technique for process abstraction
- Modular completeness for Communication Closed Layers
- The linear time Branching time spectrum II
- A classification of models for concurrency
- On the ill-timed but well-caused
- On the reduction of chocs bisimulation to ?-calculus bisimulation
- A theory of bisimulation for the ?-calculus
- Bisimulation equivalence is decidable for basic parallel processes
- A pi-calculus semantics for an object-based design notation
- Programming with broadcasts
- Interpreting broadcast communication in SCCS
- Proof systems for message-passing process algebras
- Refinement and decomposition of value-passing action systems
- Partial-order methods for temporal verification
- Model construction for implicit specifications in modal logic
- Branching time temporal logic and amorphous tree automata
- A generalized event structure for the Muller unfolding of a safe net
- Domains of higher-dimensional automata
- Non interleaving process algebra
- Quiescence, fairness, testing, and the notion of implementation
- Two fully abstract models for UNITY
- Transformations preserving properties and properties preserved by transformations in fair transition systems (extended abstract)
- Minimal memory schedules for dataflow networks
- Networks of real-time processes
- Loop parallelization in the polytope model
- ACSR: An algebra of communicating shared resources with dense time and priorities
- An Elimination Theorem for regular behaviours with integration
- A linear local model checking algorithm for CTL
- Local event structures and Petri nets
- A congruence theorem for structured operational semantics withpredicates
- From CML to process algebras
- Types for dyadic interaction
- Principal typing schemes in a polyadic ?-calculus
- Structured operational semantics for process algebras and equational axiom systems.