Coordination Models and Languages

16th IFIP WG 6.1 International Conference, COORDINATION 2014, Held as Part of the 9th International Federated Conferences on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings
 
 
Springer (Verlag)
  • erschienen am 22. Mai 2014
  • |
  • XIV, 195 Seiten
 
E-Book | PDF mit Wasserzeichen-DRM | Systemvoraussetzungen
978-3-662-43376-8 (ISBN)
 
This book constitutes the proceedings of the 16th International Conference on Coordination Models and Languages, COORDINATION 2014, held in Berlin, Germany, in June 2014. The 12 papers included in this volume were carefully reviewed and selected from 31 submissions. They deal with topics such as programming abstractions and languages, coordination models and paradigms, applied software engineering principles, specification and verification, foundations and types, distributed middleware architectures, multicore programming, collaborative adaptive systems, and coordination related use cases.
2014
  • Englisch
  • Heidelberg
  • |
  • Deutschland
Springer Berlin
  • 69 s/w Abbildungen
  • |
  • 69 schwarz-weiße Abbildungen, Bibliographie
  • 3,42 MB
978-3-662-43376-8 (9783662433768)
10.1007/978-3-662-43376-8
weitere Ausgaben werden ermittelt
  • Intro
  • Foreword
  • Preface
  • Organization
  • Invited Talk Orchestrating Management Behavior of Cloud Applications
  • Table of Contents
  • Encoding Synchronous Interactions Using Labelled Petri Nets
  • 1 Introduction
  • 2 Communicating Sequential Processes
  • 3 Labelled Petri Nets with Interfaces
  • 3.1 Labelled Petri Nets
  • 3.2 Petri Nets with Interfaces
  • 4 From Processes to Nets
  • 5 Relating CSP and Labelled Nets
  • 6 Some Hints about Technology Transfer
  • 7 Conclusions and Further Works
  • References
  • Verifiable Decisions in Autonomous Concurrent Systems
  • 1 Introduction
  • 2 Preliminaries
  • 2.1 Rewriting Logic
  • 2.2 Action Programming
  • 3 Decisions in Autonomous Concurrent Systems
  • 3.1 RMDPs as Rewrite Theories
  • 3.2 Progressive Action Programming
  • 3.3 Projection, Branching and Loops
  • 3.4 Concurrency
  • 4 Probabilistic Model Checking of Action Programs
  • 5 Example
  • 6 Related Work
  • 7 Conclusion and Further Work
  • 7.1 Conclusion
  • 7.2 Further Work
  • References
  • Coordination of ECA Rules by Verification and Control
  • 1 Coordination Problems in ECA Rules
  • 2 State of the Art
  • 2.1 ECA Rule Based Control Systems and Their Validation
  • 2.2 Synchronous Reactive Programming and Heptagon/BZR
  • 3 Modeling ECA Rules
  • 4 Transformation to Synchronous Language
  • 4.1 Code Transformations
  • 4.2 Execution Models
  • 5 ECA Rule Set Verification and Control
  • 5.1 Verifications at Compilation Time
  • 5.2 Control at Run-Time
  • 6 Conclusions
  • References
  • Progress as Compositional Lock-Freedom
  • 1 Introduction
  • 1.1 Contributions
  • 2 The Model
  • 2.1 The p-Calculus with Sessions
  • 2.2 Typing the p-Calculus with Sessions
  • 3 Lock-Freedom and Progress
  • 3.1 Definitions
  • 3.2 Properties
  • 4 Untyped Closure
  • 4.1 Definitions
  • 4.2 Adequacy of Untyped Closure
  • 5 Progress through Static Analysis for Lock-Freedom
  • 6 Conclusions and Future Work
  • References
  • Automata-Based Optimization of Interaction Protocols for Scalable Multicore Platforms
  • 1 Introduction
  • 2 Constraint Automata
  • 3 Enhancing Scalability: Problem and Solution
  • 4 Transformation f1: Preprocessing
  • 5 Transformation f2: Constructing Hypergraphs
  • 6 Transformation f3: Manipulating SCs
  • 7 Concluding Remarks
  • References
  • LINC: A Compact Yet Powerful Coordination Environment
  • 1 Introduction
  • 2 LINC Coordination Language
  • 2.1 LINC Roots
  • 2.2 Bags Abstraction
  • 2.3 Coordination Language
  • 2.4 Improvement with Respect to CLF/Stitch
  • 3 LINC Features
  • 3.1 Control the Frequency of a Rule
  • 3.2 Reduction of the Inference Tree
  • 3.3 Guards Controlled Alternatives
  • 3.4 Graceful Degradation
  • 3.5 Mutual Exclusion
  • 3.6 Rules Activation / Deactivation
  • 3.7 Dynamic Rules Generation
  • 3.8 Registry-Based Programming
  • 4 Case Studies
  • 4.1 Building Automation
  • 4.2 RFID Table
  • 4.3 Smart Actuators
  • 5 Related Works
  • 6 Conclusion
  • References
  • Safe and Efficient Data Sharing for Message-Passing Concurrency
  • 1 Introduction
  • 2 Pipeline System
  • 3 Passive Processors
  • 4 Formal Specification
  • 4.1 Order Preservation
  • 5 Evaluation
  • 5.1 Comparison to Active Processors
  • 5.2 Comparison to Low-Level Synchronization Primitives
  • 5.3 Other Applications
  • 6 Related Work
  • 7 Conclusion
  • References
  • Affine Sessions
  • 1 Introduction
  • 2 Affine Sessions by Example
  • 3 The Process Calculus of Affine Sessions
  • 4 Typing Affine Sessions
  • 5 Properties
  • 6 Related Work and Future Plans
  • References
  • Multiparty Session Actors
  • 1 Introduction
  • 2 Session Actors Programming Model
  • 2.1 Actor Models and Design Choices
  • 2.2 Warehouse Management Use Case
  • 3 Session Actor Language
  • 4 Implementations of Session Actors
  • 4.1 AMQP Background
  • 4.2 Actor Roles
  • 4.3 Actors Discovery
  • 4.4 Preservation through FSM checking
  • 5 Evaluations of Session Actors
  • 5.1 Session Actors Performance
  • 5.2 MPST Verification Overhead
  • 5.3 Applications of Session Actors
  • 6 Related Work
  • 7 Conclusion
  • References
  • Typing Liveness in Multiparty Communicating Systems
  • 1 Introduction
  • 2 Process Model
  • 3 Types and Typing Contexts
  • 4 Typing System
  • 5 Concluding Remarks
  • References
  • A Calculus of Self-stabilising Computational Fields
  • 1 Introduction
  • 2 Computational Fields
  • 2.1 Basic Ingredients
  • 2.2 Composition Examples
  • 3 The Calculus of Self-stabilising Computational Fields
  • 3.1 Typing and Self-stabilisation
  • 3.2 Device Computation
  • 3.3 Network Evolution
  • 3.4 An Example Application of the Semantics
  • 4 Properties
  • 5 Conclusion, Related and Future Work
  • References
  • The Stochastic Quality Calculus
  • 1 Introduction
  • 2 Syntax of SQC
  • 3 Semantics of SQC
  • 4 SQC is GSMDP
  • 5 Analysable Fragments of SQC
  • 5.1 SQC with Continuous Distributions
  • 5.2 SQC with Exponential Distributions
  • 6 Conclusion
  • References
  • Author Index
DNB DDC Sachgruppen

Dateiformat: PDF
Kopierschutz: Wasserzeichen-DRM (Digital Rights Management)

Systemvoraussetzungen:

Computer (Windows; MacOS X; Linux): Verwenden Sie zum Lesen die kostenlose Software Adobe Reader, Adobe Digital Editions oder einen anderen PDF-Viewer Ihrer Wahl (siehe E-Book Hilfe).

Tablet/Smartphone (Android; iOS): Installieren Sie die kostenlose App Adobe Digital Editions oder eine andere Lese-App für E-Books (siehe E-Book Hilfe).

E-Book-Reader: Bookeen, Kobo, Pocketbook, Sony, Tolino u.v.a.m. (nur bedingt: Kindle)

Das Dateiformat PDF zeigt auf jeder Hardware eine Buchseite stets identisch an. Daher ist eine PDF auch für ein komplexes Layout geeignet, wie es bei Lehr- und Fachbüchern verwendet wird (Bilder, Tabellen, Spalten, Fußnoten). Bei kleinen Displays von E-Readern oder Smartphones sind PDF leider eher nervig, weil zu viel Scrollen notwendig ist. Mit Wasserzeichen-DRM wird hier ein "weicher" Kopierschutz verwendet. Daher ist technisch zwar alles möglich - sogar eine unzulässige Weitergabe. Aber an sichtbaren und unsichtbaren Stellen wird der Käufer des E-Books als Wasserzeichen hinterlegt, sodass im Falle eines Missbrauchs die Spur zurückverfolgt werden kann.

Weitere Informationen finden Sie in unserer E-Book Hilfe.


Download (sofort verfügbar)

64,19 €
inkl. 7% MwSt.
Download / Einzel-Lizenz
PDF mit Wasserzeichen-DRM
siehe Systemvoraussetzungen
E-Book bestellen