CONCUR '96: Concurrency Theory: 7th International Conference, Pisa, Italy, August 26 - 29, 1996. Proceedings: Lecture Notes in Computer Science, cartea 1119
Editat de Ugo Montanari, Vladimiro Sassoneen Limba Engleză Paperback – 7 aug 1996
The volume presents 37 revised full papers selected from a total of 133 submissions; also included are seven invited papers. The contributions are grouped into topical sections on process algebras, categorical approaches, the pi-calculus, decidability and complexity, probability, functional and constraint programming, Petri nets, verification, automata and causality, practical models, and shared-memory systems.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 668.87 lei
Preț vechi: 836.09 lei
-20% Nou
Puncte Express: 1003
Preț estimativ în valută:
128.01€ • 132.06$ • 108.34£
128.01€ • 132.06$ • 108.34£
Carte tipărită la comandă
Livrare economică 04-18 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540616047
ISBN-10: 3540616047
Pagini: 772
Ilustrații: XIII, 759 p.
Dimensiuni: 155 x 235 x 41 mm
Greutate: 1.06 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540616047
Pagini: 772
Ilustrații: XIII, 759 p.
Dimensiuni: 155 x 235 x 41 mm
Greutate: 1.06 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.