Ivan Bliznets,Jesper Nederlof
Ivan Bliznets
In the Choosability problem (or list chromatic number problem), for a given graph G, we need to find the smallest k such that G admits a list coloring for any list assignment where all lists contain at least k colors. The problem is tightly...
Hans-Joachim Böckenhauer,Elisabet Burjons,Martin Raszyk et al.
Hans-Joachim Böckenhauer et al.
Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or approximations for problem instances when given solutions to n...
Indecision and delays are the parents of failure-taming them algorithmically by synthesizing delay-resilient control [0.03%]
犹豫和延迟是失败的根源-通过合成抵御延迟的控制来解决它们
Mingshuai Chen,Martin Fränzle,Yangjia Li et al.
Mingshuai Chen et al.
The possible interactions between a controller and its environment can naturally be modelled as the arena of a two-player game, and adding an appropriate winning condition permits to specify desirable behavior. The classical model here is t...
Automated formal synthesis of provably safe digital controllers for continuous plants [0.03%]
自动合成用于连续体的可证明安全的数字控制器
Alessandro Abate,Iury Bessa,Lucas Cordeiro et al.
Alessandro Abate et al.
We present a sound and automated approach to synthesizing safe, digital controllers for physical plants represented as time-invariant models. Models are linear differential equations with inputs, evolving over a continuous state space. The ...
Bernd Finkbeiner,Christopher Hahn,Philip Lukert et al.
Bernd Finkbeiner et al.
We study the reactive synthesis problem for hyperproperties given as formulas of the temporal logic HyperLTL. Hyperproperties generalize trace properties, i.e., sets of traces, to sets of sets of traces. Typical examples are information-flo...
Elizabeth Firman,Shahar Maoz,Jan Oliver Ringert
Elizabeth Firman
Reactive synthesis for the GR(1) fragment of LTL has been implemented and studied in many works. In this work we present and evaluate a list of heuristics to potentially reduce running times for GR(1) synthesis and related algorithms. The l...
Dimitrios Kouzapas,Jorge A Pérez,Nobuko Yoshida
Dimitrios Kouzapas
For higher-order (process) languages, characterising contextual equivalence is a long-standing issue. In the setting of a higher-order π -calculus with session types, we develop characteristic bisimilarity, a typed bisimilarity which f...
Jurriaan Rot
Jurriaan Rot
Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisati...
Compositional schedulability analysis of real-time actor-based systems [0.03%]
基于actor的实时系统的时间表组合分析方法研究
Mohammad Mahdi Jaghoori,Frank de Boer,Delphine Longuet et al.
Mohammad Mahdi Jaghoori et al.
We present an extension of the actor model with real-time, including deadlines associated with messages, and explicit application-level scheduling policies, e.g.,"earliest deadline first" which can be associated with individual actors. Sche...