Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

Active group members and developers should subscribe to:

pretsy-devel mailinglist

 

...

Papers:

[DATE’13]

Sequentially Constructive Concurrency: A Conservative Extension of the Synchronous Model of Computation.

...

Abstract. This is a journal extended version of [DATE’13] which includes in addition ...

 

...

Workshops/Seminars:

[PTCONF’13]

Sequentially Constructive Charts (SCCharts). (poster)

C. Motika, S. Smyth, R. von Hanxleden, M. Mendler.

...

PRET Day (PDAY'13), INRIA Grenoble France, March 2013.

Summary: We ask this question by means of examples constructed from a game-theoretic approach for the semantics of Esterel combined with an interface algebra for timing analysis.

It has been recognised that the synchronous model of computation together with a suitable execution platform (precision-timed, or PRET architectures) facilitates system-level timing predictability. This talk discusses a logical and game-theoretic framework for capturing worst-case reaction time (WCRT) for Esterel-style synchronous reactive programming. This framework will provide a formal grounding for the WCRT problem, and allow to improving upon earlier heuristics by accurately and modularly characterising timing interfaces. This approach will not only allows verifying the correctness of WCRT analyses methods, but also will allow capturing functionality and timing together.

 

[PDAY’13-2]

 Constructive Boolean Networks and the Exactness of Timed Ternary Simulation. (slides)

M. Mendler.

PRET Day (PDAY'13), INRIA Grenoble France, March 2013.

Summary: Cyclic boolean systems, such as those arising in asynchronous circuits the semantics of synchronous programming languages, do not admit a unique canonical execution semantics. Instead, different approaches impose different restrictions on their stabilization behavior. This talk concerns the class of constructive circuits, for which signals settle to a unique value in bounded time, for any input, under a simple conservative delay model, called the up-bounded non-inertial (UN) delay. The main result is that ternary simulation decides the class of constructive circuits. It shows that three-valued algebra is able to maintain correct and exact stabilization information under the UN-delay model, which thus provides an adequate electrical interpretation of ternary algebra, which has been missing in the literature. Previous work on combinational circuits used the up-bounded inertial (UI) delay to justify ternary simulation. It can be shown that the match is not exact and that stabilization under the UI-model, in general, cannot be decided by ternary simulation. As the corner-stone of our main results we introduce UN-Logic, an axiomatic specification language for UN-delay circuits that mediates between the real-time behavior and its abstract simulation in the ternary domain. We present a symbolic simulation calculus for circuit theories expressed in UN-logic and prove it sound and complete for the UN-model. This provides, for the first time, a correctness and exactness result for the timing analysis of cyclic circuits such as the timed extension of Malik's or Brzozowski and Seger's pure ternary algorithm or the timed algorithm proposed by Riedel and Bruck, which were not formally linked with real-time execution models.

 

[SYNCHRON’13-1]

Compiling SCCharts (and other Sequentially Constructive Programs) to Hardware and Software.

...