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ț: 667.75 lei
- 20% Preț: 624.06 lei
- 20% Preț: 335.03 lei
- 20% Preț: 643.50 lei
- 20% Preț: 645.97 lei
- 20% Preț: 338.35 lei
- 20% Preț: 896.93 lei
- 20% Preț: 583.40 lei
- 20% Preț: 539.02 lei
- 20% Preț: 648.26 lei
- 20% Preț: 646.80 lei
- 20% Preț: 1458.70 lei
- 20% Preț: 662.95 lei
- 20% Preț: 329.58 lei
- 20% Preț: 327.37 lei
- 18% Preț: 949.23 lei
- 20% Preț: 771.18 lei
- 20% Preț: 826.62 lei
- 20% Preț: 1015.53 lei
- 20% Preț: 994.26 lei
- 15% Preț: 644.82 lei
- 20% Preț: 643.30 lei
- 20% Preț: 993.42 lei
- 20% Preț: 643.17 lei
- 20% Preț: 646.62 lei
- 20% Preț: 645.14 lei
- 20% Preț: 636.73 lei
- 20% Preț: 511.90 lei
- 20% Preț: 605.80 lei
Preț: 658.98 lei
Preț vechi: 823.73 lei
-20% Nou
Puncte Express: 988
Preț estimativ în valută:
126.11€ • 131.50$ • 104.81£
126.11€ • 131.50$ • 104.81£
Carte tipărită la comandă
Livrare economică 21 martie-04 aprilie
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.