Assume-Guarantee Reasoning for Hierarchical Hybrid Systems
The assume-guarantee paradigm is a powerful divide-and-conquer mechanism for decomposing a verification task about a system into subtasks about the individual components of the system. The key to assume-guarantee reasoning is to consider each component not in isolation, but in conjunction with assumptions about the context of the component. Assume-guarantee principles are known for purely concurrent contexts, which constrain the input data of a component, as well as for purely sequential contexts, which constrain the entry configurations of a component. We present a model for hierarchical system design which permits the arbitrary nesting of parallel as well as serial composition, and which supports an assume-guarantee principle for mixed parallel-serial contexts. Our model also supports both discrete and continuous processes, and is therefore well-suited for the modeling and analysis of embedded software systems which interact with real-world environments. Using an example of two cooperating robots, we show refinement between a high-level model which specifies continuous timing constraints and an implementation which relies on discrete sampling.
Unable to display preview. Download preview PDF.
- [AG00]R. Alur and R. Grosu. Modular refinement of hierarchic reactive machines. In Principles of Programming Languages, pp. 390–402, ACM Press, 2000.Google Scholar
- [AH97]R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. In Concurrency Theory, LNCS 1243, pp. 74–88, Springer-Verlag, 1997.Google Scholar
- [BRJ98]G. Booch, J. Rumbaugh, and I. Jacobson. The Unified Modeling Language User Guide. Addison-Wesley, 1998.Google Scholar
- [DGH+99]J. Davis, M. Goel, C. Hylands, B. Kienhuis, E.A. Lee, J. Liu, X. Liu, L. Muliadi, S. Neuendorffer, J. Reekie, N. Smyth, J. Tsay, and Y. Xiong. Overview of the Ptolemy project. Tech. Rep. UCB/ERL M99/37, University of California, Berkeley, 1999.Google Scholar
- [Hen96]T.A. Henzinger, The theory of hybrid automata. In Logic in Computer Science, pp. 278–292, IEEE Computer Society Press, 1996.Google Scholar
- [Hen00]T.A. Henzinger. Masaccio: A formal model for embedded components. In Theoretical Computer Science, LNCS 1872, pp. 549–563, Springer Verlag, 2000.Google Scholar
- [McM97]K.L. McMillan. A compositional rule for hardware design refinement. In Computer-aided Verification, LNCS 1254, pp. 24–35, Springer-Verlag, 1997.Google Scholar
- [TAKB96]S. Tasiran, R. Alur, R.P. Kurshan, and R.K. Brayton. Verifying abstractions of timed systems. In Concurrency Theory, LNCS 1119, pp. 546–562, Springer-Verlag, 1996.Google Scholar