CONCUR '96 : concurrency theory : 7th International Conference, Pisa, Italy, August 26 29, 1996 : proceedings
This book constitutes the refereed proceedings of the 7th International Conference on Concurrency Theory, CONCUR '96, held in Pisa, Italy, in August 1996. The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributio...
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| coleção: | Lecture notes in computer science
1119 |
| Assuntos: | |
| Acesso em linha: | 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 '96, concurrency theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, proceedings, Ugo Montanari, Vladimiro Sassone, eds, 1996, Berlin, Springer, 1 vol. (XII-750 p.), Lecture notes in computer science, 3-540-61604-7 • CONCUR '96: Concurrency Theory, Texte imprimé, 9783662191231 |
Sumário:
- Retracing some paths in process algebra
- Process calculus based upon evaluation to committed form
- A process algebra with distributed priorities
- Symbolic transition graph with assignment
- Models for concurrent constraint programming
- Comparing transition systems with independence and asynchronous transition systems
- A presheaf semantics of value-passing processes
- Elementary control structures
- On transformations of concurrent object programs
- On bisimulations for the asynchronous ?-calculus
- On the expressiveness of internal mobility in name-passing calculi
- Decoding choice encodings
- Infinite results
- Decidability of bisimulation equivalence for normed pushdown processes
- The modal mu-calculus alternation hierarchy is strict
- Bisimulation collapse and the process taxonomy
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- A Facile tutorial
- Testing probabilistic automata
- Extended Markovian Process Algebra
- Rewriting logic as a semantic framework for concurrency: a progress report
- Truly concurrent constraint programming
- Constraints as processes
- A calculus of mobile agents
- Algebraic interpretation of lambda calculus with resources
- Concurrent graph and term graph rewriting
- Petri boxes and finite precedence
- Constrained properties, semilinear systems, and Petri nets
- Linear constraint systems as high-level nets
- A space-efficient on-the-fly algorithm for real-time model checking
- State equivalences for rectangular hybrid automata
- Verifying abstractions of timed systems
- Towards automatic temporal logic verification of value passing process algebra using abstract interpretation
- Modelling and verification of Distributed Algorithms
- An algorithmic approach for checkingclosure properties of ?-regular languages
- Towards automata for branching time and partial order
- Asynchronous cellular automata for pomsets without auto-concurrency
- Action refinement and property inheritance in systems of sequential agents
- A calculus for concurrent objects
- Refinement in Interworkings
- Equivalences of Statecharts
- Modular verification for shared-variable concurrent programs
- The impact of hardware models on shared memory consistency conditions
- Synchronous development of asynchronous systems.