http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

This paper presents algorithms for the automatic synthesis of real-time controllers by finding a winning strategy for certain games defined by the timed-automata of Alur and Dill. In such games, the outcome depends on the players' actions as well as on their timing. We believe that these results will pave the way for the application of program synthesis techniques to the construction of real-time embedded systems from their specifications.

On the synthesis of discrete controllers for timed systems

https://ir.cwi.nl/pub/25162/1-s2.0-S0167642315002609-main.pdf

Global consensus through local synchronization

Constraint automata with memory cells and their composition

Compatibility of components is an important issue in the quest for systems of systems that guarantee successful communications, free from message loss and indefinite waiting for inputs In this paper, we investigate compatibility in the context of systems consisting of reactive components which may communicate through the synchronised execution of common actions We model such systems in the team automata framework, which does not impose any a priori restrictions on the synchronisation policy followed to combine the components We identify a family of representative synchronisation types based on the number of sending and receiving components participating in synchronisations Then, we provide a generic procedure to derive, for each synchronisation type, requirements for receptiveness and for responsiveness of team automata that prevent that outputs are not accepted and inputs are not provided, respectively Due to the genericity of our approach wrt synchronisation policies, we can capture compatibility notions for various multi-component system models known from the literature

/pdf/communication-requirements-for-team-automata-7842tvl77u.pdf

Communication Requirements for Team Automata

Coordination languages simplify design and development of concurrent systems. Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly. In this paper we establish a formal relation between BI(P) (i.e., BIP without the priority layer) and Reo, by defining transformations between their semantic models. We show that these transformations preserve all properties expressible in a common semantics. This formal relation comprises the basis for a solid comparison and consolidation of the fundamental coordination concepts behind these two languages. Moreover, this basis offers translations that enable users of either language to benefit from the toolchains of the other.

Relating BIP and Reo

Coordination languages simplify design and development of concurrent systems Particularly, exogenous coordination languages, like BIP and Reo, enable system designers to express the interactions among components in a system explicitly In this paper we establish a formal relation between BI(P) (ie, BIP without the priority layer) and Reo, by defining transformations between their semantic models We show that these transformations preserve all properties expressible in a common semantics This formal relation comprises the basis for a solid comparison and consolidation of the fundamental coordination concepts behind these two languages Moreover, this basis offers translations that enable users of either language to benefit from the toolchains of the other

https://scholarlypublications.universiteitleiden.nl/access/item%3A2945992/view

Combine and conquer: Relating BIP and Reo

Constraint automata specify protocols as labeled transition systems that preserve synchronization under composition. They have been used as a basis for tools, such as compilers and model checkers. Unfortunately, composition of transition systems suffers from state space and transition space explosions, which limits scalability of the tools based on constraint automata. In this work, we propose stream constraints as an alternative to constraint automata that avoids state space explosions. We introduce a rule-based form for stream constraints that can avoid transition space explosions. We provide sufficient conditions under which our approach avoids transition space explosions.

/pdf/rule-based-form-for-stream-constraints-26j6qa8b43.pdf

Rule-Based Form for Stream Constraints

A scheduler is an algorithm that assigns at any time a set of processes to a set of processors. Processes usually interact with each other, which introduces dependencies amongst them. Typically, such dependencies induce extra delays that the scheduler needs to avoid. Specific types of applications, like streaming applications, synthesize a scheduler from a formal model that is aware of these interactions. However, such interaction-specific information is not available for general types of applications. In this paper, we propose an interaction aware scheduling framework for generic concurrent applications. We formalize the amount of work performed by an application as constraints. We use these constraints to generate a graph, and view scheduler synthesis as solving a game on this graph that is played between the scheduler and the application. We illustrate that our framework is expressive enough to subsume an established scheduling framework for streaming programs.

/pdf/scheduling-games-for-concurrent-systems-2vr1rjdgza.pdf

Kasper Dokter

Papers

Relating BIP and Reo

Relating BIP and Reo

Combine and conquer: Relating BIP and Reo

Rule-Based Form for Stream Constraints

Scheduling Games for Concurrent Systems