Search
Now showing items 1-2 of 2
Automata Constructions for LTL with Past
(Department of Computer Science and Engineering University of Gothenburg | Chalmers University of Technology, 2024)
Linear temporal logic (LTL) is a popular language in formal verification,
especially in the domains of model checking and reactive synthesis. Because
its semantics is defined in terms of infinite sequences of symbols ...
Faster and Smaller Solutions of Obliging Games
(35th International Conference on Concurrency Theory (CONCUR 2024), 2024)
Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system and the environment. Previous approaches to ...