Results 1 to 10 of about 1,692 (124)
Safe reinforcement learning under temporal logic with reward design and quantum action selection [PDF]
Scientific Reports, 2023 This paper proposes an advanced Reinforcement Learning (RL) method, incorporating reward-shaping, safety value functions, and a quantum action selection algorithm. The method is model-free and can synthesize a finite policy that maximizes the probability
Mingyu Cai +3 more
doaj +2 more sources
Fast and Adaptive Multi-Agent Planning under Collaborative Temporal Logic Tasks via Poset Products [PDF]
ResearchEfficient coordination and planning is essential for large-scale multi-agent systems that collaborate in a shared dynamic environment. Heuristic search methods or learning-based approaches often lack the guarantee on correctness and performance. Moreover,
Zesen Liu +3 more
doaj +2 more sources
Discrete Mathematics & Theoretical Computer Science, 2007 In his thesis Baire defined functions of Baire class 1. A function f is of Baire class 1 if it is the pointwise limit of a sequence of continuous functions. Baire proves the following theorem.
Pierre Simonnet, Benoit Cagnard
doaj +3 more sources
Describing Weighted Safety with Weighted LTL over Product omega-valuation Monoids
Scientific Annals of Computer Science, 2023 We define the notion of k-safe infinitary series over idempotent ordered totally generalized product omega-valuation monoids that satisfy specific properties. For each element k of the underlying structure (different from the neutral elements of
Eleni Mandrali
doaj +1 more source
Regular omega-Languages with an Informative Right Congruence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be recognized by a DFA isomorphic to the automaton corresponding to its right congruence, henceforth the Rightcon automaton. The same
Dana Angluin, Dana Fisman
doaj +1 more source
A Translation of Weighted LTL Formulas to Weighted Buchi Automata over omega-valuation Monoids
Scientific Annals of Computer Science, 2021 In this paper we introduce a weighted LTL over product omega-valuation monoids that satisfy specific properties. We also introduce weighted generalized Buchi automata with epsilon-transitions, as well as weighted Buchi automata with epsilon-transitions ...
Eleni Mandrali
doaj +1 more source
Profile Trees for Büchi Word Automata, with Application to Determinization [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 The determinization of Buchi automata is a celebrated problem, with applications in synthesis, probabilistic verification, and multi-agent systems. Since the 1960s, there has been a steady progress of constructions: by McNaughton, Safra, Piterman, Schewe,
Seth Fogarty +3 more
doaj +1 more source
Visibly Pushdown Modular Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Games on recursive game graphs can be used to reason about the control flow of sequential programs with recursion. In games over recursive game graphs, the most natural notion of strategy is the modular strategy, i.e., a strategy that is local to a ...
Ilaria De Crescenzo +2 more
doaj +1 more source
Learn with SAT to Minimize Büchi Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that
Stephan Barth, Martin Hofmann
doaj +1 more source
State Space Reduction For Parity Automata [PDF]
, 2020 Exact minimization of ?-automata is a difficult problem and heuristic algorithms are a subject of current research. We propose several new approaches to reduce the state space of deterministic parity automata.
core +1 more source