Compositional abstraction in real-time model checking

19Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The idea to use simulations (or refinements) as a compositional abstraction device is well-known, both in untimed and timed settings, and has already been studied theoretically and practically in many papers during the last three decades. Nevertheless, existing approaches do not handle two fundamental modeling concepts which, for instance, are frequently used in the popular Uppaal model checker: (1) a parallel composition operator that supports communication via shared variables as well as synchronization of actions, and (2) committed locations. We describe a framework for compositional abstraction based on simulation relations that does support both concepts, and that is suitable for Uppaal. Our approach is very general and the only essential restriction is that the guards of input transitions do not depend on external variables. We have applied our compositional framework to verify the Zeroconf protocol for an arbitrary number of hosts. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Berendsen, J., & Vaandrager, F. (2008). Compositional abstraction in real-time model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5215 LNCS, pp. 233–249). https://doi.org/10.1007/978-3-540-85778-5_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free