Actors: a model of concurrent computation in distributed systems
Actors: a model of concurrent computation in distributed systems
Actor languages. their syntax, semantics, translation, and equivalence
Theoretical Computer Science
Actors: a model for reasoning about open distributed systems
Formal methods for distributed processing
Introduction to Algorithms
Composable Semantic Models for Actor Theories
Higher-Order and Symbolic Computation
Towards a Theory of Actor Computation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Efficient Run-Time Monitoring of Timing Constraints
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Foundations of Actor Semantics
Foundations of Actor Semantics
A foundation for actor computation
Journal of Functional Programming
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
The Preservation of Interleaving Equivalences
ICECCS '05 Proceedings of the 10th IEEE International Conference on Engineering of Complex Computer Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Monitoring of Timing Constraints with Confidence Threshold Requirements
IEEE Transactions on Computers
Concurrent semantics without the notions of state or state transitions
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Actors, roles and coordinators — a coordination model for open distributed and embedded systems
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Hi-index | 0.00 |
When a distributed system contains only causal relations from input events to output events, an interaction diagram (id) provides a convenient mechanism to study observable behaviors of the system as all events can be mapped to a set of global times that preserve the initial causal relations. However, the interaction diagram focuses only on causal orders among distributed events, which is not sufficient for most real-time applications. Furthermore, in real-time context, a feasible interaction is the one that satisfies not only causal constraints and precedence constraints, but also real-time constraints. However, feasibility checking for a given set of real-time constraints is asymptotically harder than for causal or precedence constraints. In this paper, we first extend the interaction diagram with precedence constraints and develop a mechanism that allows order preserving composition of the extended interaction diagram (eid) with timing constraint graph (tcg). The composition of the extended interaction diagram and timing constraining graph is called timed interaction diagram (tid). To reduce the time complexity differences between the two different feasibility checkings, event bundling is introduced to partition timed interaction diagrams. We show that a lattice of bundled interaction diagrams (bid) can be derived from a given timed interaction diagram to improve the efficiency of feasibility checking for arbitrary real-time constraints.