On the Synthesis of Discrete Controllers for Timed Systems? (An ...

Abstract. Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs.







Theory of cellular automata: A survey - IBISC
A pursuit game. system can be described as a product of two timed-automata having two clocks. The first clock x measures the amount of time elapsed ...
Collapsible pushdown automata and labeled recursion schemes ...
Abstract. This article surveys some theoretical aspects of cellular automata CA research. In particular, we discuss classical and new results on ...
Dynamic Observers for the Synthesis of Opaque Systems - LIX
We argue that CPDA are an essential model when working with recursion schemes. First, we give a new proof of the translation of schemes into CPDA that does not.



Autres Cours:

Saturating Automata for Game Semantics