Back to Search
Start Over
Distributed Semantics and Implementation for Systems with Interaction and Priority
- Source :
- FORTE 2008 28th IFIP WG 6.1 International Conference Tokyo Proceedings, Formal Techniques for Networked and Distributed Systems – FORTE 2008, Formal Techniques for Networked and Distributed Systems – FORTE 2008, Jun 2008, Tokyo, Japan. pp.116--133, ⟨10.1007/978-3-540-68855-6⟩, Formal Techniques for Networked and Distributed Systems – FORTE 2008 ISBN: 9783540688549, FORTE
- Publication Year :
- 2008
- Publisher :
- HAL CCSD, 2008.
-
Abstract
- The paper studies a distributed implementation method for the BIP (Behavior, Interaction, Priority) component framework for modeling heterogeneous systems. BIP offers two powerful mechanisms for describing composition of components by combining interactions and priorities. A system model is layered. The lowest layer contains atomic components; the second layer, describes possible interactions between atomic components; the third layer includes priorities between the interactions. The current implementation of BIP is based on global state operational semantics. An Engine directly interprets the operational semantics rules and computes the possible interactions between atomic components from global states. The implementation method is a translation from BIP models into distributed models involving two steps. The first translates BIP models into partial state models where are known only the states of the components which are ready to communicate. The second implements interactions in the partial state model by using message passing primitives. The main results of the paper are conditions for which the three models are observationally equivalent. We show that in general, the translation from global state to partial state models does not preserve observational equivalence. Preservation can be achieved by strengthening the premises of the operational semantics rules by an oracle. This is a predicate depending on the priorities of the BIP model. We show that there are many possible choices for oracles. Maximal parallelism is achieved for dynamic oracles allowing interaction as soon as possible. Nonetheless, these oracles may entail considerable computational overhead. We study performance trade-offs for different types of oracles. Finally, we provide experimental results illustrating the application of the theory on a prototype implementation. © 2008 Springer-Verlag Berlin Heidelberg.
- Subjects :
- Food preservation
Paper
Atoms
Information theory
Theoretical computer science
Dynamical systems theory
Computer science
distributed implementation
Distributed computing
observational equivalence
Computational linguistics
Equivalence classes
0102 computer and information sciences
02 engineering and technology
Software prototyping
01 natural sciences
Operational semantics
Oracle
Atomic physics
System model
Dynamical systems
component-based systems
0202 electrical engineering, electronic engineering, information engineering
Observational equivalence
message-passing
Model structures
Theorem proving
Computer networks
Canning
Message passing
020207 software engineering
Digital signal processing
Semantics
Automated theorem proving
010201 computation theory & mathematics
[INFO.INFO-ES]Computer Science [cs]/Embedded Systems
Translation (languages)
Subjects
Details
- Language :
- English
- ISBN :
- 978-3-540-68854-9
- ISBNs :
- 9783540688549
- Database :
- OpenAIRE
- Journal :
- FORTE 2008 28th IFIP WG 6.1 International Conference Tokyo Proceedings, Formal Techniques for Networked and Distributed Systems – FORTE 2008, Formal Techniques for Networked and Distributed Systems – FORTE 2008, Jun 2008, Tokyo, Japan. pp.116--133, ⟨10.1007/978-3-540-68855-6⟩, Formal Techniques for Networked and Distributed Systems – FORTE 2008 ISBN: 9783540688549, FORTE
- Accession number :
- edsair.doi.dedup.....bee9341d409e80849df194e147716c8b