English
Related papers

Related papers: GenSys: A Scalable Fixed-point Engine for Maximal …

200 papers

Verified controller synthesis uses world models that comprise all potential behaviours of humans, robots, further equipment, and the controller to be synthesised. A world model enables quantitative risk assessment, for example, by…

Software Engineering · Computer Science 2021-10-26 Mario Gleirscher , Jan Peleska

In the synthesis of distributed systems, we automate the development of distributed programs and hardware by automatically deriving correct implementations from formal specifications. For synchronous distributed systems, the synthesis…

Logic in Computer Science · Computer Science 2021-10-19 Bernd Finkbeiner , Manuel Gieseking , Jesko Hecking-Harbusch , Ernst-Rüdiger Olderog

The control of complex systems faces a trade-off between high performance and safety guarantees, which in particular restricts the application of learning-based methods to safety-critical systems. A recently proposed framework to address…

Systems and Control · Computer Science 2020-05-26 Kim P. Wabersich , Melanie N. Zeilinger

The synthesis of reactive systems aims for the automated construction of strategies for systems that interact with their environment. Whereas the synthesis approach has the potential to change the development of reactive systems…

Logic in Computer Science · Computer Science 2026-04-01 Linda Feeken , Martin Fränzle

Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games…

Artificial Intelligence · Computer Science 2026-05-12 Krishnendu Chatterjee , Ehsan Kafshdar Goharshady , Mehrdad Karrabi , Maximilian Seeliger , Đorđe Žikelić

We present a (semi)-algorithm to compute winning strategies for parametric timed games. Previous algorithms only synthesized constraints on the clock parameters for which the game is winning. A new definition of (winning) strategies is…

Formal Languages and Automata Theory · Computer Science 2025-06-19 Mikael Bisgaard Dahlsen-Jensen , Baptiste Fievet , Laure Petrucci , Jaco van de Pol

Automatic software generation based on some specification is known as program synthesis. Most existing approaches formulate program synthesis as a search problem with discrete parameters. In this paper, we present a novel formulation of…

Artificial Intelligence · Computer Science 2023-04-04 Shantanu Mandal , Todd A. Anderson , Javier Turek , Justin Gottschlich , Abdullah Muzahid

We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for…

Computer Science and Game Theory · Computer Science 2015-11-02 Véronique Bruyère , Emmanuel Filiot , Mickael Randour , Jean-François Raskin

Given a set of interacting components with non-deterministic variable update and given safety requirements, the goal of priority synthesis is to restrict, by means of priorities, the set of possible interactions in such a way as to…

Systems and Control · Computer Science 2012-11-28 Chih-Hong Cheng , Rongjie Yan , Saddek Bensalem , Harald Ruess

Control problems for embedded systems like cars and trains can be modeled by two-player hybrid games. Control envelopes, which are families of safe control solutions, correspond to nondeterministic winning policies of hybrid games, where…

Programming Languages · Computer Science 2025-08-11 Aditi Kabra , Jonathan Laurent , Stefan Mitsch , André Platzer

Two-player games on graphs provide the mathematical foundation for the study of reactive systems. In the quantitative framework, an objective assigns a value to every play, and the goal of player 1 is to minimize the value of the objective.…

Logic in Computer Science · Computer Science 2014-04-30 Yaron Velner

This paper considers the problem of co-synthesis in $k$-player games over a finite graph where each player has an individual $\omega$-regular specification $\phi_i$. In this context, a secure equilibrium (SE) is a Nash equilibrium w.r.t.…

Computer Science and Game Theory · Computer Science 2024-01-23 Satya Prakash Nayak , Anne-Kathrin Schmuck

With deep learning becoming a more prominent approach for automatic classification of three-dimensional point cloud data, a key bottleneck is the amount of high quality training data, especially when compared to that available for…

Computer Vision and Pattern Recognition · Computer Science 2019-07-11 David Griffiths , Jan Boehm

Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources.…

Software Engineering · Computer Science 2022-02-24 Hanane Benmaghnia , Matthieu Martel , Yassamine Seladji

The synthesis of reactive systems aims for the automated construction of strategies for systems that interact with their environment. Whereas the synthesis approach has the potential to change the development of reactive systems…

Logic in Computer Science · Computer Science 2024-11-04 Linda Feeken , Martin Fränzle

The synthesis problem asks to construct a reactive finite-state system from an $\omega$-regular specification. Initial specifications are often unrealizable, which means that there is no system that implements the specification. A common…

Computer Science and Game Theory · Computer Science 2008-12-18 Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann

Optimal controller synthesis is a bilinear problem and hence difficult to solve in a computationally efficient manner. We are able to resolve this bilinearity for systems with delay by first convexifying the problem in infinite-dimensions -…

Systems and Control · Computer Science 2018-07-13 Matthew M. Peet

We consider the problem of synthesizing resilient and stochastically stable strategies for systems of cooperating agents striving to minimize the expected time between consecutive visits to selected locations in a known environment. A…

Multiagent Systems · Computer Science 2023-05-18 David Klaška , Antonín Kučera , Martin Kurečka , Vít Musil , Petr Novotný , Vojtěch Řehák

Finite State Machine is a popular modeling notation for various systems, especially software and electronic. Test paths can be automatically generated from the system model to test such systems using a suitable algorithm. This paper…

Software Engineering · Computer Science 2022-07-26 Vaclav Rechtberger , Miroslav Bures , Bestoun S. Ahmed , Hynek Schvach

When designing correct-by-construction controllers for autonomous collectives, three key challenges are the task specification, the modelling, and its use at practical scale. In this paper, we focus on a simple yet useful abstraction for…

Multiagent Systems · Computer Science 2024-11-22 Till Schnittka , Mario Gleirscher