Composition and refinement of discrete real-time systems

Monographs in Theoretical Computer Science. An EATCS Series

Morzenti

et al. 2012

The increasing relevance of areas such as real-time and embedded systems, pervasive computing, hybrid systems control, and biological and social systems modeling is bringing a growing attention to the temporal aspects of computing, not only in the computer science domain, but also in more traditional fields of engineering.This article surveys various approaches to the formal modeling and analysis of the temporal features of computer-based systems, with a level of detail that is also suitable for nonspecialists. In doing so, it provides a unifying framework, rather than just a comprehensive list of formalisms.The article first lays out some key dimensions along which the various formalisms can be evaluated and compared. Then, a significant sample of formalisms for time modeling in computing are presented and discussed according to these dimensions. The adopted perspective is, to some extent, historical, going from "traditional" models and formalisms to more modern ones.

Section: Dual Language Approachesmentioning

confidence: 99%

Modeling Time in Computing

Monographs in Theoretical Computer Science. An EATCS Series

Morzenti

et al. 2012

“…A noticeable exception is Ostroff in [27], where the metric temporal logic RTTL is embedded in a compositional framework. Ostroff's work is also valuable in providing an overall framework, which includes an inference rule as well as a usable methodology.…”

Section: Related Workmentioning

confidence: 99%

Automated compositional proofs for real-time systems

Rossi

Theoretical Computer Science

et al. 2007

We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, realtime system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a methodology concerning the integration of the different parts into a whole system. The reference specification language is the TRIO metric linear temporal logic.The novelty of our approach with respect to existing compositional frameworks -most of which do not deal explicitly with real-time requirements -consists mainly in its generality and abstraction from any assumptions about the underlying computational model and from any semantic characterizations of the temporal logic language used in the specification. Moreover, the framework deals equally well with continuous and discrete time. It is supported by a tool, implemented on top of the proof-checker PVS, to perform deduction-based verification through theorem-proving of modular real-time axiom systems.As an example of application, we show the verification of a real-time version of the old-fashioned but still relevant "benchmark" of the dining philosophers problem.

“…A first noticeable exception is Ostroff in [17], where the metric temporal logic RTTL is embedded in a compositional framework. Nonetheless, the approach is rather different from ours, being focused on refinement aspects rather than on a posteriori composition that exploits reuse.…”

Section: Related Workmentioning

confidence: 99%

Automated Compositional Proofs for Real-Time Systems

Rossi

Fundamental Approaches to Software Engineering

et al. 2005

Abstract. We present a framework for formally proving that the composition of the behaviors of the different parts of a complex, real-time system ensures a desired global specification of the overall system. The framework is based on a simple compositional rely/guarantee circular inference rule, plus a small set of conditions concerning the integration of the different parts into a whole system. The reference specification language is the TRIO metric linear temporal logic.The novelty of our approach with respect to existing compositional frameworks -most of which do not deal explicitly with real-time requirements -consists mainly in its generality and abstraction from any assumptions about the underlying computational model and from any semantic characterizations of the temporal logic language used in the specification. Moreover, the framework deals equally well with continuous and discrete time. It is supported by a tool, implemented on top of the proof-checker PVS, to perform deduction-based verification through theorem-proving of modular real-time axiom systems.As an example of application, we show the verification of a real-time version of the old-fashioned but still relevant "benchmark" of the dining philosophers problem.