The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
A distributed algorithm to implement n-party rendezvous
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Parallel program design: a foundation
Parallel program design: a foundation
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Communication and concurrency
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
An order-based algorithm for implementing multiparty synchronization: Research Articles
Concurrency and Computation: Practice & Experience
Modeling Heterogeneous Real-time Components in BIP
SEFM '06 Proceedings of the Fourth IEEE International Conference on Software Engineering and Formal Methods
A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
Journal of Parallel and Distributed Computing
Distributed Semantics and Implementation for Systems with Interaction and Priority
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Priority Scheduling of Distributed Systems Based on Model Checking
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
From high-level component-based models to distributed implementations
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Algorithms for synthesizing priorities in component-based systems
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Knowledge-Based distributed conflict resolution for multiparty interactions and priorities
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Optimized distributed implementation of multiparty interactions with observation
Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions
| Hi-index | 0.00 |
In this paper, we introduce a novel model-based approach for constructing correct distributed implementation of component-based models constrained by priorities. We argue that model-based methods are especially of interest in the context of distributed embedded system due to their inherent complexity. Our three-phase method's input is a model specified in terms of a set of behavioural components that interact through a set of high-level synchronization primitives (e.g., rendezvous and broadcasts) and priority rules for scheduling purposes. Our technique, first, transforms the input model into a model that has no priorities. Then, it transforms the deprioritized model into another model that resolves distributed conflicts by incorporating a solution to the committee coordination problem. Finally, it generates distributed code using asynchronous point-to-point send/receive primitives. All transformations preserve the properties of their input model by ensuring observational equivalence. The transformations are implemented and our experiments validate their effectiveness.