The complexity of searching a graph
Journal of the ACM (JACM)
Theoretical Computer Science
Multiagent Systems: A Theoretical Framework for Intentions, Know-how, and Communications
Multiagent Systems: A Theoretical Framework for Intentions, Know-how, and Communications
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Mode Switching Synthesis for Reachability Specifications
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Controllers for reachability specifications for hybrid systems
Automatica (Journal of IFAC)
A framework for comparing models of computation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Decomposition of Information for Plant Collaborative Design and Set-Up
CDVE '08 Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering
| Hi-index | 0.00 |
In this paper, a hierarchical system architecture for singleagent multi-modal systems is proposed. The layered system is designed to promote proof obligations so that system specification at one level of granularity conforms with that at another level and vice versa. The design principle for the construction of the hierarchy is based on bisimulation with respect to reachability specifications. Therefore, a higher-level system and a lower-level system are bisimilar. Our approach is illustrated by designing a system architecture for controlling an autonomous agent.