Specification and Analysis of Concurrent Systems: The COSY Approach: Monographs in Theoretical Computer Science. An EATCS Series
Autor Ryszard Janicki, Peter E. Laueren Limba Engleză Paperback – 29 dec 2011
Din seria Monographs in Theoretical Computer Science. An EATCS Series
- 20%
Preț: 641.95 lei - 20%
Preț: 675.38 lei - 20%
Preț: 322.29 lei - 20%
Preț: 618.64 lei - 20%
Preț: 621.01 lei - 20%
Preț: 325.47 lei - 20%
Preț: 970.75 lei - 20%
Preț: 631.38 lei - 20%
Preț: 518.27 lei - 20%
Preț: 623.22 lei - 20%
Preț: 621.81 lei - 20%
Preț: 1401.84 lei - 20%
Preț: 637.34 lei - 20%
Preț: 317.05 lei - 20%
Preț: 354.25 lei - 18%
Preț: 912.40 lei - 20%
Preț: 741.32 lei - 20%
Preț: 794.58 lei - 20%
Preț: 976.07 lei - 20%
Preț: 955.62 lei - 15%
Preț: 619.91 lei - 20%
Preț: 618.46 lei - 20%
Preț: 954.82 lei - 20%
Preț: 618.33 lei - 20%
Preț: 621.64 lei - 20%
Preț: 620.20 lei - 20%
Preț: 612.13 lei - 20%
Preț: 553.98 lei - 20%
Preț: 655.62 lei
Preț: 633.52 lei
Preț vechi: 791.91 lei
-20% Nou
Puncte Express: 950
Preț estimativ în valută:
112.09€ • 131.77$ • 98.17£
112.09€ • 131.77$ • 98.17£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642773396
ISBN-10: 3642773397
Pagini: 500
Ilustrații: XII, 480 p.
Dimensiuni: 170 x 242 x 26 mm
Greutate: 0.79 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642773397
Pagini: 500
Ilustrații: XII, 480 p.
Dimensiuni: 170 x 242 x 26 mm
Greutate: 0.79 kg
Ediția:Softcover reprint of the original 1st ed. 1992
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Monographs in Theoretical Computer Science. An EATCS Series
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
1 What COSY Is and What It Is For.- 1.1 Introduction.- 1.2 Concepts, Objectives and Design Decisions.- 1.3 Structure of Bookevevr.- 1.4 Acknowledgements.- 2 Formal Theory of Basic COSY.- 2.1 Basic COSY Syntax and Semantics.- 2.2 VFS Semantics of COSY.- 2.3. Petri Net Semantics of COSY.- 2.4 Adequacy Properties of Path Programs.- 2.5 Execution Semantics for COSY.- 2.6 Semantics of COSY with Priorities.- 2.7 Bibliographic Notes.- 3 High-level COSY Programs and System Design.- 3.1 High-level COSY Syntax and Semantics.- 3.2 The Process Notation.- 3.3 Macro Generators for COSY Notation.- 3.4 The Semantics of Macro COSY Programs.- 3.5 The COSY Environment.- 3.6 The COSY System Dossier.- 3.7 Bibliographical Notes.- 4 COSY Applications.- 4.1 Two-Way Channel with Disconnect.- 4.2 The Hyperfast Banker.- 4.3 Cigarette Smokers.- 4.4 Merlin-Randell Problem of Train Journeys.- 4.5 Transforming Sequential Systems into Concurrent Systems.- 4.6 Modelling N-Modular Redundancy.- 5 Comparison of COSY with Other Models.- 5.1 COSY and CCS.- 5.2 COSY and CSP.- Full COSY and Petri Nets.- 5.4 Vector Sequences and Mazurkiewicz Traces.- 5.5 COSY and Synchronized Behaviours.- 6 Historical Perspective.- 6.1 Introduction.- 6.2 Conceptual and Methodological Framework of COSY Approach.- Appendices.- A Algebra of Relations.- B Automata and Formal Language Theory.- B.1 Strings.- B.2 Languages.- B.3 Regular Expressions and Languages.- B.4 Finite State Automata and Grammars.- C Elements of Graph Theory.- D Proofs of Theorems 2.25, 2.26 and 2.28.- E Proofs of Theorems 2.37 and 2.38.- F Proof of Theorem 2.29.- G Proof of Theorem 4.3.- H Basic COSY Notations and Macro COSY Notation.- List of Figures.- List of Algorithms.- List of Definitions.- List of Theorems.- List of Corollaries.- List of Lemmas.