*banner
 

Using the Principles of Synchronous Languages in Discrete-event and Continuous-time Models
Edward A. Lee

Citation
Edward A. Lee. "Using the Principles of Synchronous Languages in Discrete-event and Continuous-time Models". Talk or presentation, 23, October, 2007; Invited talk, Workshop: Between Control and Software (in honor of Paul Caspi), Grenoble, France.

Abstract
In this talk, I outline semantic models for discrete-event (DE) systems and continuous-time (CT) systems as generalizations of synchronous/reactive (SR) semantics. SR is based on solutions of fixed point equations over a flat partial order at ticks of a global clock. In our version of DE systems, a similar fixed point semantics is used, but there is a notion of the passage of time between ticks of the global clock. Specially, we use superdense time, where a time stamp is a pair (t,n), where t is a non-negative real number, and n is a natural number. SR becomes a special case where t=0. In DE, there is also a premise that for any system component, absent inputs produce absent outputs. This observation leads to an optimization that amounts to the usual event queue scheduling used in discrete-event simulators. For CT models, we use the same superdense model of time (to fully support hybrid systems), but allow values to evolve continuously between discrete times. We describe an ideal-solver semantics that gives a rigorous abstract semantics to such systems, and show how practical ODE solvers approximate this semantics. We show that by building all three semantic models on a common foundation it becomes easy and clean to combine CT, DE, and SR models heterogeneously.

Electronic downloads

Citation formats  
  • HTML
    Edward A. Lee. <a
    href="http://chess.eecs.berkeley.edu/pubs/374.html"
    ><i>Using the Principles of Synchronous Languages
    in Discrete-event and Continuous-time
    Models</i></a>, Talk or presentation,  23,
    October, 2007; Invited talk, Workshop: Between              
     Control and Software (in honor of Paul Caspi), Grenoble,
    France.
  • Plain text
    Edward A. Lee. "Using the Principles of Synchronous
    Languages in Discrete-event and Continuous-time
    Models". Talk or presentation,  23, October, 2007;
    Invited talk, Workshop: Between                Control and
    Software (in honor of Paul Caspi), Grenoble, France.
  • BibTeX
    @presentation{Lee07_UsingPrinciplesOfSynchronousLanguagesInDiscreteevent,
        author = {Edward A. Lee},
        title = {Using the Principles of Synchronous Languages in
                  Discrete-event and Continuous-time Models},
        day = {23},
        month = {October},
        year = {2007},
        note = {Invited talk, Workshop: Between               
                  Control and Software (in honor of Paul Caspi),
                  Grenoble, France},
        abstract = {In this talk, I outline semantic models for
                  discrete-event (DE) systems and continuous-time
                  (CT) systems as generalizations of
                  synchronous/reactive (SR) semantics. SR is based
                  on solutions of fixed point equations over a flat
                  partial order at ticks of a global clock. In our
                  version of DE systems, a similar fixed point
                  semantics is used, but there is a notion of the
                  passage of time between ticks of the global clock.
                  Specially, we use superdense time, where a time
                  stamp is a pair (t,n), where t is a non-negative
                  real number, and n is a natural number. SR becomes
                  a special case where t=0. In DE, there is also a
                  premise that for any system component, absent
                  inputs produce absent outputs. This observation
                  leads to an optimization that amounts to the usual
                  event queue scheduling used in discrete-event
                  simulators. For CT models, we use the same
                  superdense model of time (to fully support hybrid
                  systems), but allow values to evolve continuously
                  between discrete times. We describe an
                  ideal-solver semantics that gives a rigorous
                  abstract semantics to such systems, and show how
                  practical ODE solvers approximate this semantics.
                  We show that by building all three semantic models
                  on a common foundation it becomes easy and clean
                  to combine CT, DE, and SR models heterogeneously.},
        URL = {http://chess.eecs.berkeley.edu/pubs/374.html}
    }
    

Posted by Douglas Densmore on 29 Oct 2007.
Groups: chess
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.

You are not logged in 
©2002-2014 Chess