Modeling concurrency with partial orders
International Journal of Parallel Programming
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication and Concurrency
The Vision of Autonomic Computing
Computer
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
| Hi-index | 0.00 |
Dynamic adaptation according to situational variety requires the employment of planning algorithms for reactive and proactive dealing with detected or predicted conditions. The complexity of large scaled, distributed systems however prohibits planning strategies acting on the granularity of single components because (a) a local system view from the perspective of singular components is usually not sufficient, and (b) the synthesis (or a-priory definition) of a global perspective is far beyond feasibility. We therefore propose the use of dynamic abstraction mechanisms to generate planning models of a suitable degree of granularity. The framework of Abstract Interpretation is used to define both a reactive planning algorithm and a pro-active prediction.