Almost ASAP semantics: from timed models to timed implementations

Wulf, Martin; Doyen, Laurent; Raskin, Jean-François

doi:10.1007/s00165-005-0067-8

Cited by 59 publications

(48 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The timing semantics (called Almost ASAP) of their corresponding realizations can be derived from the relaxation of timing constraints (or guards) in timed automata. There are several differences between the work in (Wulf et al 2005) and our work. An essential one is the different assumptions that are used to relax the timing semantics of the model in the realization.…”

Section: Timing Difference Analysismentioning

confidence: 64%

“…One is based on property preservation in which one tries to find the most relaxed Realization R( ) from the model M such that R( ) can satisfy the desired property P verified in M. The parameter reflects the extend of the relaxation. Typical work in this area is (Wulf et al 2005). The other is property transformation, which simply predicts properties of the realization R from those of the model M according to their timing difference .…”

Section: Timing Difference Analysismentioning

confidence: 99%

“…Note that in this scope, to ensure that R satisfies a property P in the end, we can require that M satisfies a stronger property P so that the relaxation of P is still stronger than P . In the following, we give a more detailed comparison between the property-preservation technique (Wulf et al 2005) and the property-transformation technique (Huang et al 2003).…”

Section: Timing Difference Analysismentioning

confidence: 99%

“…In (Wulf et al 2005), the authors address the differences in timing semantics between a model and its realization. In their work, models of real-time systems are represented by timed automata.…”

Section: Timing Difference Analysismentioning

confidence: 99%

“…. According to the relaxation mechanism proposed in (Wulf et al 2005), the following set of relaxed timed traces {τ | ∀i ∈ N, |t i − t i−1 − (t i − t i−1 )| ≤ ∧ α i = α i } are valid in the realization with relaxation parameter . In contrast, according to the relaxation mechanism proposed in our work, a set of relaxed timed traces {τ | ∀i ∈ N, |t i − t i | ≤ ∧ α i = α i } can be observed in the realization which is absolute [− , ]-close to the model.…”

Section: Timing Difference Analysismentioning

confidence: 99%

See 4 more Smart Citations

Predictable real-time software synthesis

2007

View full text Add to dashboard Cite

Formal theories for real-time systems (such as timed process algebra, timed automata and timed petri nets) have gained great success in the modeling of concurrent timing behavior and in the analysis of real-time properties. However, due to the ineliminable timing differences between a model and its realization, synthesizing a software realization from a model in a predictable way is still a challenging research topic. In this article, we tackle this problem by solving a set of sub-problems. The solution is based on the theoretical results for property prediction proposed in Huang et al. (2003, Real-time property preservation in approximations of timed systems. In: Proceedings of 1st ACM and IEEE international conference on formal methods and models for codesign. IEEE Computer Society, Los Alamitos, pp 163-171) and Huang (2005, Predictability in real-time system design. PhD thesis, Eindhoven University of Technology, The Netherlands), where quantitative property relations are established between two absolute/relative "close" real-time systems. This theory basically implies that if two systems are "close", they enjoy "similar" properties. These results cannot be directly applied in practice though, because a model and its realization typically have infinitely large absolute and relative timing differences. We show that this infinite time gap can be bridged through a sequence of carefully constructed intermediate time domains. Then the property-prediction results can be applied to any pair of adjacent time domains in the sequence. Consequently, real-time properties of the implementation can be predicted from the model. We propose two parameterized hypotheses to characterize the timing differences in the sequence and to guide a correctness-preserving design process. It is shown that these hypotheses can be incorporated in a concrete tool set. We demonstrate the feasibility of the predictable synthesis approach through the design of a railroad crossing system.

show abstract

Section: Timing Difference Analysismentioning

confidence: 64%

Section: Timing Difference Analysismentioning

confidence: 99%

Section: Timing Difference Analysismentioning

confidence: 99%

Section: Timing Difference Analysismentioning

confidence: 99%

Section: Timing Difference Analysismentioning

confidence: 99%

See 3 more Smart Citations