*banner
 

Predictable Timing of Cyber-Physical Systems - Future Research Challenges
David Broman

Citation
David Broman. "Predictable Timing of Cyber-Physical Systems - Future Research Challenges". Talk or presentation, 17, January, 2012.

Abstract
Cyber-physical systems (CPS) is an emerging research field that addresses challenges with systems that combine computation, networking, and physical processes. The concept of time is an inherent property of such a system. Missed deadlines for hard real-time applications, such as avionics and control systems in automobiles, can result in devastating life-threatening consequences. Hence, timing predictability for CPS is a correctness criterion, not a quality factor. Extensive research has been performed on defining high-level modeling languages where time is a fundamental concept (e.g., Ptolemy II, Modelica, Simulink). Moreover, currently a new category of processors called precision timed (PRET) machines is being developed that are both predictable and repeatable regarding time. However, there is a semantic gap between high-level languages and PRET machines. In this talk we present research challenges for a new research project in the Ptolemy group, with the objective of bridging this gap. The aim is to establishing a new formal foundation of timing predictability for the semantics of correct translation/compilation from high-level CPS modeling languages down to machine code for PRET machines. The research includes formal proofs of correctness by utilizing computer-based proof assistants as well as implementation of a prototype compiler for practical testing and evaluation.

Electronic downloads

Citation formats  
  • HTML
    David Broman. <a
    href="http://chess.eecs.berkeley.edu/pubs/885.html"
    ><i>Predictable Timing of Cyber-Physical Systems -
    Future Research Challenges</i></a>, Talk or
    presentation,  17, January, 2012.
  • Plain text
    David Broman. "Predictable Timing of Cyber-Physical
    Systems - Future Research Challenges". Talk or
    presentation,  17, January, 2012.
  • BibTeX
    @presentation{Broman12_PredictableTimingOfCyberPhysicalSystemsFutureResearch,
        author = {David Broman},
        title = {Predictable Timing of Cyber-Physical Systems -
                  Future Research Challenges},
        day = {17},
        month = {January},
        year = {2012},
        abstract = {Cyber-physical systems (CPS) is an emerging
                  research field that addresses challenges with
                  systems that combine computation, networking, and
                  physical processes. The concept of time is an
                  inherent property of such a system. Missed
                  deadlines for hard real-time applications, such as
                  avionics and control systems in automobiles, can
                  result in devastating life-threatening
                  consequences. Hence, timing predictability for CPS
                  is a correctness criterion, not a quality factor.
                  Extensive research has been performed on defining
                  high-level modeling languages where time is a
                  fundamental concept (e.g., Ptolemy II, Modelica,
                  Simulink). Moreover, currently a new category of
                  processors called precision timed (PRET) machines
                  is being developed that are both predictable and
                  repeatable regarding time. However, there is a
                  semantic gap between high-level languages and PRET
                  machines. In this talk we present research
                  challenges for a new research project in the
                  Ptolemy group, with the objective of bridging this
                  gap. The aim is to establishing a new formal
                  foundation of timing predictability for the
                  semantics of correct translation/compilation from
                  high-level CPS modeling languages down to machine
                  code for PRET machines. The research includes
                  formal proofs of correctness by utilizing
                  computer-based proof assistants as well as
                  implementation of a prototype compiler for
                  practical testing and evaluation.},
        URL = {http://chess.eecs.berkeley.edu/pubs/885.html}
    }
    

Posted by Patricia Derler on 19 Jan 2012.
Groups: chessworkshop
For additional information, see the Publications FAQ or contact webmaster at chess eecs berkeley edu.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

©2002-2018 Chess