Image de couverture de livre

Model-Free Learning of Safe yet Effective Controllers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bozkurt, Alper Kamil, Wang, Yu, Pajic, Miroslav
Format:	Preprint
Publié:	2021
Sujets:	Robotics Formal Languages and Automata Theory Machine Learning Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
par: Yang, Andy, et autres
Publié: (2023)

Learning Quantitative Automata Modulo Theories
par: Hsiung, Eric, et autres
Publié: (2024)

On the Expressiveness of State Space Models via Temporal Logics
par: Alsmann, Eric, et autres
Publié: (2026)

Transformers are Inherently Succinct
par: Bergsträßer, Pascal, et autres
Publié: (2025)

Synthesis and Verification of Transformer Programs (Technical Report)
par: Jiang, Hongjian, et autres
Publié: (2026)

RNN Generalization to Omega-Regular Languages
par: Pert, Charles, et autres
Publié: (2025)

Length Generalization Bounds for Transformers
par: Yang, Andy, et autres
Publié: (2026)

Softmax Transformers are Turing-Complete
par: Jiang, Hongjian, et autres
Publié: (2025)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
par: Bueri, Lucas, et autres
Publié: (2024)

Random Graph Generation in Context-Free Graph Languages
par: Vastarini, Federico, et autres
Publié: (2024)

Learning Verified Monitors for Hidden Markov Models
par: van der Maas, Luko, et autres
Publié: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
par: Iosif, Radu, et autres
Publié: (2023)

Formal Evidence Generation for Assurance Cases for Robotic Software Models
par: Yan, Fang, et autres
Publié: (2026)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
par: Zhang, Yuanrui, et autres
Publié: (2023)

The Role of Logic and Automata in Understanding Transformers
par: Lin, Anthony W., et autres
Publié: (2025)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
par: Yang, Andy, et autres
Publié: (2024)

What Formal Languages Can Transformers Express? A Survey
par: Strobl, Lena, et autres
Publié: (2023)

Feasability of Learning Weighted Automata on a Semiring
par: Daviaud, Laure, et autres
Publié: (2023)

Towards A Catalogue of Requirement Patterns for Space Robotic Missions
par: Etumi, Mahdi, et autres
Publié: (2025)

Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policies
par: Rahmani, Hazhar, et autres
Publié: (2024)

On the Impact of the Communication Model on Realisability
par: Di Giusto, Cinzia, et autres
Publié: (2025)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
par: Doveri, Kyveli, et autres
Publié: (2026)

Model Checking Temporal Properties of Recursive Probabilistic Programs
par: Winkler, Tobias, et autres
Publié: (2021)

Simplifying LTL Model Checking Given Prior Knowledge
par: Duret-Lutz, Alexandre, et autres
Publié: (2025)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
par: Tsai, Wei-Lun, et autres
Publié: (2026)

DTMC Model Checking by Path Abstraction Revisited (extended version)
par: Hartmanns, Arnd, et autres
Publié: (2025)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
par: Finkbeiner, Bernd, et autres
Publié: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
par: Rooduijn, Jan, et autres
Publié: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
par: Das, Anupam, et autres
Publié: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Positive First-order Logic on Words and Graphs
par: Kuperberg, Denis
Publié: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
par: Das, Anupam, et autres
Publié: (2025)

Function spaces for orbit-finite sets
par: Bojańczyk, Mikołaj, et autres
Publié: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

Cyclic system for an algebraic theory of alternating parity automata
par: Das, Anupam, et autres
Publié: (2025)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
par: Winter, Sarah, et autres
Publié: (2024)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
par: Chen, Yu-Fang, et autres
Publié: (2025)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
par: De Giacomo, Giuseppe, et autres
Publié: (2025)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
par: Li, Shuo, et autres
Publié: (2023)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond $\forall^*\exists^*$
par: Winter, Sarah, et autres
Publié: (2025)