Image de couverture de livre

Fairness and promptness in Muller formulas

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Busatto-Gaston, Damien, Oualhadj, Youssouf, Tible, Léo, Varacca, Daniele
Format:	Preprint
Publié:	2022
Sujets:	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

Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards
par: Barbot, Benoît, et autres
Publié: (2024)

Deciding the synthesis problem for hybrid games through bisimulation
par: Dima, Catalin, et autres
Publié: (2024)

Arena-Independent Finite-Memory Determinacy in Stochastic Games
par: Bouyer, Patricia, et autres
Publié: (2021)

An abstract fixed-point theorem for Horn formula equations
par: Hetzl, Stefan, et autres
Publié: (2025)

Boolean basis, formula size, and number of modal operators
par: Berkholz, Christoph, et autres
Publié: (2024)

String Diagrams for Monoidal Categories, in Rocq
par: Pous, Damien
Publié: (2026)

Finitely accessible arboreal adjunctions and Hintikka formulae
par: Reggio, Luca, et autres
Publié: (2023)

Policies for Fair Exchanges of Resources
par: Ceragioli, Lorenzo, et autres
Publié: (2024)

On Tools for Completeness of Kleene Algebra with Hypotheses
par: Pous, Damien, et autres
Publié: (2022)

Continuous Algebras with Hypotheses
par: Mulder, Lukas, et autres
Publié: (2026)

A finite presentation of graphs of treewidth at most three
par: Doumane, Amina, et autres
Publié: (2024)

Adhesive category theory for graph rewriting in Rocq
par: Arsac, Samuel, et autres
Publié: (2025)

Deciding characteristic formulae: A journey in the branching-time spectrum
par: Aceto, Luca, et autres
Publié: (2025)

The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
par: Aceto, Luca, et autres
Publié: (2024)

Progress, Justness and Fairness in Modal $μ$-Calculus Formulae
par: Spronck, Myrthe, et autres
Publié: (2024)

Runtime Verification of Interactions Using Automata
par: Weil-Kennedy, Chana, et autres
Publié: (2025)

The unstable formula theorem revisited via algorithms
par: Malliaris, Maryanthe, et autres
Publié: (2022)

Hardness of monadic second-order formulae over succinct graphs
par: Gamard, Guilhem, et autres
Publié: (2023)

An implicit function theorem for the stream calculus
par: Boreale, Michele, et autres
Publié: (2023)

Principal Typing for Intersection Types, Forty-Five Years Later
par: Pautasso, Daniele, et autres
Publié: (2026)

Fully Abstract Encodings of $λ$-Calculus in HOcore through Abstract Machines
par: Biernacka, Małgorzata, et autres
Publié: (2022)

Nominal Equational Narrowing: Rewriting for Unification in Languages with Binders
par: Fernández, Maribel, et autres
Publié: (2025)

Enumerating Minimal Unsatisfiable Cores of LTLf formulas
par: Ielo, Antonio, et autres
Publié: (2024)

A C++ reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

An optimized KE-tableau-based system for reasoning in the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

A set-based reasoner for the description logic $\mathcal{DL}_{\mathbf{D}}^{4,\!\times}$ (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2018)

A set-theoretical approach for ABox reasoning services (Extended Version)
par: Cantone, Domenico, et autres
Publié: (2017)

Restricted Chase Termination: You Want More than Fairness
par: Carral, David, et autres
Publié: (2025)

Fair Asynchronous Session Subtyping
par: Bravetti, Mario, et autres
Publié: (2021)

Equational Reasoning Modulo Commutativity in Languages with Binders (Extended Version)
par: Caires-Santos, Ali K., et autres
Publié: (2025)

Strong Nominal Semantics for Fixed-Point Constraints
par: Caires-Santos, Ali K., et autres
Publié: (2024)

Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories
par: Nantes-Sobrinho, Daniele, et autres
Publié: (2025)

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)
par: Paulus, Joseph W. N., et autres
Publié: (2021)

Sequent Calculi for Data-Aware Modal Logics
par: Areces, Carlos, et autres
Publié: (2025)

Validity of contextual formulas (extended version)
par: Esparza, Javier, et autres
Publié: (2024)

Countability constraints in order-theoretic approaches to computability
par: Hack, Pedro, et autres
Publié: (2022)

Strong negation in the theory of computable functionals TCF
par: Köpp, Nils, et autres
Publié: (2022)

Rethinking the notion of oracle: A prequel to Lawvere-Tierney topologies for computability theorists
par: Kihara, Takayuki
Publié: (2022)

Dependence Logics in Temporal Settings
par: Baltag, Alexandru, et autres
Publié: (2022)

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
par: Lichter, Moritz
Publié: (2022)