Sound Code Generation from Communicating Hybrid Models

Hur, Yerang; Kim, Jesung; Lee, Insup; Choi, Jin

doi:10.1007/978-3-540-24743-2_29

Cited by 11 publications

(26 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was extended to multithreaded models accounting for faulty transitions in [14] and unirate distributed systems with no delays in [4]. To guarantee value and time determinism in the discretized code, we use an E machine approach [13] with the concept of logical execution time in our on-going prototype.…”

Section: Related Workmentioning

confidence: 99%

“…The guarantees for faithful implementation are given with respect to this model. In [14], the authors provide a rigorous definition of system of communicating agents and their semantics.…”

Section: Definition 1 (Dcha) Given a System Of Communicating Hy-mentioning

confidence: 99%

“…In [14], we have proposed a scheme to prevent faulty transitions by shrinking the guard set to account for the errors due to mixed sampling times. However, introducing such a margin into the guard in turn increases the chances of a missed transition, since it reduces the time interval during which a transition must be taken.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed-code generation from hybrid systems models for time-delayed multirate systems

Anand

Fischmeister

Kim

et al. 2005

Proceedings of the 5th ACM International Conference on Embedded Software

Self Cite

View full text Add to dashboard Cite

Hybrid systems are an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. A simple extension, a network of communicating hybrid automata, allows for modeling distributed embedded systems. Although it is possible to generate code from such models, it is difficult to provide formal guarantees in the code with respect to the model. One of the reasons for this is that, the model is set in continuous time and concurrent execution with instantaneous communication, whereas the generated code is set in discrete time with delayed communication. This can introduce semantic differences between the model and the code such as missed transitions, faulty transitions, and altered continuous behavior. The goal of faithful code generation is to minimize these differences.In this paper, we propose a relaxed criteria of relative faithful implementation. Based on this criteria, we propose dynamically adjusting the guard at runtime using estimates of errors for preventing faulty transitions. We also identify a sufficient condition to ensure no missed transitions in the code. ABSTRACTHybrid systems are an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. A simple extension, a network of communicating hybrid automata, allows for modeling distributed embedded systems. Although it is possible to generate code from such models, it is difficult to provide formal guarantees in the code with respect to the model. One of the reasons for this is that, the model is set in continuous time and concurrent execution with instantaneous communication, whereas the generated code is set in discrete time with delayed communication. This can introduce semantic differences between the model and the code such as missed transitions, faulty transitions, and altered continuous behavior. The goal of faithful code generation is to minimize these differences. In this paper, we propose a relaxed criteria of faithfulness, coined relative faithful implementation. Based on this criteria, we propose dynamically adjusting the guard at runtime using estimates of errors for preventing faulty transitions. We also identify a sufficient condition to ensure no missed transitions in the code.

show abstract

Section: Related Workmentioning

confidence: 99%

“…The guarantees for faithful implementation are given with respect to this model. In [14], the authors provide a rigorous definition of system of communicating agents and their semantics.…”

Section: Definition 1 (Dcha) Given a System Of Communicating Hy-mentioning

confidence: 99%

See 1 more Smart Citation

Distributed-code generation from hybrid systems models for time-delayed multirate systems

Anand

Fischmeister

Kim

et al. 2005

Proceedings of the 5th ACM International Conference on Embedded Software

Self Cite

View full text Add to dashboard Cite

show abstract

“…The problem of generating code from hybrid automata has been considered in Alur et al (2003) and Hur et al (2004), but the focus has been on choosing the sampling period so as to avoid errors due to switching and communication. Automaton-based scheduling of control systems was introduced in Alur and Weiss (2008).…”

Section: Introductionmentioning

confidence: 99%

Computing Schedules for Time-Triggered Control using Genetic Algorithms

Nghiem

Fainekos

2011

IFAC Proceedings Volumes

View full text Add to dashboard Cite

In this work, we study the optimal scheduling problem for embedded control systems. Given a number of numerical computation tasks that must be executed on an embedded computer, the goal is to find a periodic schedule that minimizes the error of the implementation with respect to the ideal system. In this paper, we pose two open problems: the decidability of the optimal scheduling problem for timed-triggered controllers (OSTTC) and the time complexity of the corresponding bounded version of the problem. We conjecture that the former is undecidable and that the latter is NP-Complete. In view of the previous conjectures, we present a Genetic Algorithm (GA) for the OSTTC problem. Initial experimental results of GA-OSTTC are very promising when compared to random search and exhaustive bounded search.

show abstract

“…Recently, the problem of generating code from timed and hybrid automata has been considered in [2, 11,18], but the focus has been on choosing the sampling period so as to avoid errors due to switching and communication. The work on mapping Simulink blocks to Lustre focuses on signal dependencies [6].…”

Section: Introductionmentioning

confidence: 99%

Time-triggered implementations of dynamic controllers

Nghiem

Pappas

Alur

et al. 2006

Proceedings of the 6th ACM &Amp; IEEE International Conference on Embedded Software - EMSOFT '06

View full text Add to dashboard Cite

Bridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control systems that interact with an environment, a variety of errors due to quantization, delays, and scheduling policies may generate executable code that does not faithfully implement the model-based design. In this paper, we show that the performance gap between the model-level semantics of proportional-integral-derivative (PID) controllers and their implementation-level semantics can be rigorously quantified if the controller implementation is executed on a predictable time-triggered architecture. Our technical approach uses lifting techniques for periodic, timevarying linear systems in order to compute the exact error between the model semantics and the execution semantics. Explicitly computing the impact of the implementation on overall system performance allows us to compare and partially order different implementations with various scheduling or timing characteristics. Disciplines Computer SciencesThis conference paper is available at ScholarlyCommons: http://repository.upenn.edu/cis_papers/500 ABSTRACTBridging the gap between model-based design and platformbased implementation is one of the critical challenges for embedded software systems. In the context of embedded control systems that interact with an environment, a variety of errors due to quantization, delays, and scheduling policies may generate executable code that does not faithfully implement the model-based design. In this paper, we show that the performance gap between the model-level semantics of proportional-integral-derivative (PID) controllers and their implementation-level semantics can be rigorously quantified if the controller implementation is executed on a predictable time-triggered architecture. Our technical approach uses lifting techniques for periodic, time-varying linear systems in order to compute the exact error between the model semantics and the execution semantics. Explicitly computing the impact of the implementation on overall system performance allows us to compare and partially order different implementations with various scheduling or timing characteristics.

show abstract

Sound Code Generation from Communicating Hybrid Models

Cited by 11 publications

References 10 publications

Distributed-code generation from hybrid systems models for time-delayed multirate systems

Distributed-code generation from hybrid systems models for time-delayed multirate systems

Computing Schedules for Time-Triggered Control using Genetic Algorithms

Time-triggered implementations of dynamic controllers

Contact Info

Product

Resources

About