Alur, Rajeev; Henzinger, Thomas AIST Austria
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee) and hierarchical (stepwise refinement) reasoning. While synchronous models are based on a notion of atomic computation step, and asynchronous models remove that notion by introducing stuttering, our model is based on a flexible notion of what constitutes a computation step: by applying an abstraction operator to a system, arbitrarily many consecutive steps can be collapsed into a single step. The abstraction operator, which may turn an asynchronous system into a synchronous one, allows us to describe systems at various levels of temporal detail. For describing systems at various levels of spatial detail, we use a hiding operator that may turn a synchronous system into an asynchronous one. We illustrate the model with diverse examples from synchronous circuits, asynchronous shared-memory programs, and synchronous message passing
207 - 218
LICS: Logic in Computer Science
Alur R, Henzinger TA. Reactive modules. In: IEEE; 1996:207-218. doi:10.1109/LICS.1996.561320
Alur, R., & Henzinger, T. A. (1996). Reactive modules (pp. 207–218). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.1996.561320
Alur, Rajeev, and Thomas A Henzinger. “Reactive Modules,” 207–18. IEEE, 1996. https://doi.org/10.1109/LICS.1996.561320.
R. Alur and T. A. Henzinger, “Reactive modules,” presented at the LICS: Logic in Computer Science, 1996, pp. 207–218.
Alur R, Henzinger TA. 1996. Reactive modules. LICS: Logic in Computer Science 207–218.
Alur, Rajeev, and Thomas A. Henzinger. Reactive Modules. IEEE, 1996, pp. 207–18, doi:10.1109/LICS.1996.561320.