Logics and Models of Concurrent Systems: NATO ASI Subseries F:, cartea 13
Editat de Krzysztof R. Apten Limba Engleză Paperback – 30 dec 2011
Din seria NATO ASI Subseries F:
- 20% Preț: 650.27 lei
- 20% Preț: 668.55 lei
- 20% Preț: 992.44 lei
- 18% Preț: 1239.19 lei
- 20% Preț: 1922.81 lei
- 20% Preț: 654.37 lei
- 18% Preț: 1234.00 lei
- 20% Preț: 709.78 lei
- 20% Preț: 656.03 lei
- 18% Preț: 1854.94 lei
- 20% Preț: 374.97 lei
- 20% Preț: 991.94 lei
- 20% Preț: 671.02 lei
- 20% Preț: 1925.96 lei
- 20% Preț: 994.73 lei
- Preț: 389.49 lei
- 20% Preț: 657.99 lei
- 20% Preț: 655.20 lei
- 18% Preț: 1225.31 lei
- 18% Preț: 952.09 lei
- 20% Preț: 332.06 lei
- 20% Preț: 1284.47 lei
- 20% Preț: 644.81 lei
- Preț: 395.85 lei
- 18% Preț: 1221.07 lei
- 15% Preț: 643.34 lei
- 20% Preț: 645.47 lei
- 20% Preț: 1282.98 lei
- 20% Preț: 656.36 lei
- 20% Preț: 1283.31 lei
- 20% Preț: 1924.15 lei
- 20% Preț: 362.24 lei
Preț: 659.63 lei
Preț vechi: 824.54 lei
-20% Nou
Puncte Express: 989
Preț estimativ în valută:
126.26€ • 137.19$ • 106.13£
126.26€ • 137.19$ • 106.13£
Carte tipărită la comandă
Livrare economică 21 aprilie-05 mai
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642824555
ISBN-10: 3642824552
Pagini: 512
Ilustrații: VIII, 500 p.
Dimensiuni: 170 x 244 x 27 mm
Greutate: 0.81 kg
Ediția:Softcover reprint of the original 1st ed. 1985
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642824552
Pagini: 512
Ilustrații: VIII, 500 p.
Dimensiuni: 170 x 244 x 27 mm
Greutate: 0.81 kg
Ediția:Softcover reprint of the original 1st ed. 1985
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria NATO ASI Subseries F:
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Temporal logic.- Using temporal logic for automatic verification of finite state systems.- Resolution modal logics.- Tools for verifying network protocols.- An axiomatic semantics of concurrent programming languages.- In transition from global to modular temporal reasoning about programs.- Syntax directed verification methods.- Correctness proofs of distributed termination algorithms.- Script: A communication abstraction mechanism and its verification.- The cooperation test: a syntax-directed verification method.- Around CCS, Theoretical CSP and distributed systems.- Notes on algebraic calculi of processes.- Deadlock analysis in networks of Communicating Processes.- A paradigm for detecting quiescent properties in distributed computations.- About fair asynchrony.- A logic for the specification and proof of controllable processes of CCS.- Specification-oriented programming in TCSP.- Miscellaneous.- Theoretical foundations for non-monotonic reasoning in expert systems.- Towards a theory of knowledge and ignorance: preliminary report.- On the development of reactive systems.