Image de couverture de livre

Reactive Synthesis for Expected Impacts

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chini, Emanuele, Sala, Pietro, Simonetti, Andrea, Zare, Omid
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science Computer Science and Game Theory F.1.2; F.1.1;
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Probabilistic Shoenfield Machines
par: Bujok, Maksymilian, et autres
Publié: (2024)

Constructing Weakly Terminating Interface Protocols
par: Bera, Debjyoti, et autres
Publié: (2026)

Imperative process algebra and models of computation
par: Middelburg, C. A.
Publié: (2022)

Distributed Places and Safe Net Reduction
par: Khomenko, Victor, et autres
Publié: (2025)

On the formalization of the notion of a concurrent algorithm
par: Middelburg, C. A.
Publié: (2024)

Formalizing the notions of non-interactive and interactive algorithms
par: Middelburg, C. A.
Publié: (2024)

A Resolution-Based Interactive Proof System for UNSAT
par: Czerner, Philipp, et autres
Publié: (2024)

Chronology as a Consistency Invariant in Composable Information Systems
par: Calvo, Anherutowa, et autres
Publié: (2026)

Implicit Knowledge in Unawareness Structures
par: Belardinelli, Gaia, et autres
Publié: (2023)

Linear-Time--Branching-Time Spectroscopy Accounting for Silent Steps
par: Bisping, Benjamin, et autres
Publié: (2023)

EGGs are adhesive!
par: Biondo, Roberto, et autres
Publié: (2025)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
par: Lin, Yi, et autres
Publié: (2025)

Branching Bisimilarity for Processes with Time-outs
par: Reghem, Gaspard, et autres
Publié: (2024)

Concrete Branching Bisimilarity for Processes with Time-outs
par: Reghem, Gaspard, et autres
Publié: (2024)

Formal Verification of Diffusion Auctions
par: Galimullin, Rustam, et autres
Publié: (2025)

On the Reachability Problem for One-Dimensional Thin Grammar Vector Addition Systems
par: Xue, Chengfeng, et autres
Publié: (2026)

Functions Definable by Numerical Set-Expressions
par: Pratt-Hartmann, Ian, et autres
Publié: (2009)

Complex Algebras of Arithmetic
par: Düntsch, Ivo, et autres
Publié: (2009)

Reversible computations are computations
par: Aubert, Clément, et autres
Publié: (2025)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
par: Japaridze, Giorgi
Publié: (2026)

Neural networks as fuzzy logic formulas
par: Heiman, Damian, et autres
Publié: (2026)

A LOCAL View of the Polynomial Hierarchy
par: Reiter, Fabian
Publié: (2023)

How to Verify a Turing Machine with Dafny
par: Lederer, Edgar F. A.
Publié: (2026)

On the Counting Complexity of the Skolem Problem
par: Jindal, Gorav, et autres
Publié: (2024)

Hardness of busy beaver value BB(15)
par: Stérin, Tristan, et autres
Publié: (2021)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
par: Grabmayer, Clemens
Publié: (2024)

Turing machines deciders, part I
par: The bbchallenge Collaboration, et autres
Publié: (2025)

A propositional cirquent calculus for computability logic
par: Japaridze, Giorgi
Publié: (2024)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

The Directed Van Kampen Theorem in Lean
par: Basold, Henning, et autres
Publié: (2023)

Ordinal Folding Index: A Computable Metric for Self-Referential Semantics
par: Alpay, Faruk, et autres
Publié: (2025)

Satisfiability of Context-free String Constraints with Subword-ordering and Transducers
par: Aiswarya, C, et autres
Publié: (2024)

Edit Distance of Finite State Transducers
par: Aiswarya, C., et autres
Publié: (2024)

Edit Distance of Finite-Valued Transducers
par: Mathew, Prince, et autres
Publié: (2026)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
par: Guttenberg, Roland, et autres
Publié: (2025)

Complementing an imperative process algebra with a rely/guarantee logic
par: Middelburg, C. A.
Publié: (2025)

Probabilistic imperative process algebra
par: Middelburg, C. A.
Publié: (2026)

Towards Bug-Free Distributed Go Programs
par: Koo, Zhengqun
Publié: (2025)

Orbit-finite linear programming
par: Ghosh, Arka, et autres
Publié: (2023)