Imagen de Portada

Stuttering Equivalence for Parity Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cranen, Sjoerd, Keiren, Jeroen J. A., Willemse, Tim A. C.
Formato:	Preprint
Publicado:	2011
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Benchmarks for Parity Games (extended version)
por: Keiren, Jeroen J. A.
Publicado: (2014)

Structural Analysis of Boolean Equation Systems
por: Keiren, Jeroen, et al.
Publicado: (2010)

Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
por: Keiren, Jeroen J. A., et al.
Publicado: (2013)

Efficient Evidence Generation for Modal $μ$-Calculus Model Checking (extended version)
por: Stramaglia, Anna, et al.
Publicado: (2025)

Tutorial: Designing Distributed Software in mCRL2
por: Groote, Jan Friso, et al.
Publicado: (2021)

Expressiveness Results for Timed Modal Mu-Calculi
por: Cleaveland, Rance, et al.
Publicado: (2023)

Deadlock in packet switching networks
por: Stramaglia, Anna, et al.
Publicado: (2021)

A simpler O(m log n) algorithm for branching bisimilarity on labelled transition systems
por: Jansen, David N., et al.
Publicado: (2019)

Fair Mutual Exclusion for N Processes (extended version)
por: Hafidi, Yousra, et al.
Publicado: (2021)

Progress, Justness and Fairness in Modal $μ$-Calculus Formulae
por: Spronck, Myrthe, et al.
Publicado: (2024)

The Algebra of Parity Games
por: Piedeleu, Robin
Publicado: (2025)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
por: Regaud, Gaëtan, et al.
Publicado: (2025)

A Zone-Based Algorithm for Timed Parity Games
por: Geeraerts, Gilles, et al.
Publicado: (2025)

Graded Monads and Behavioural Equivalence Games
por: Ford, Chase, et al.
Publicado: (2022)

Pareto Fronts for Compositionally Solving String Diagrams of Parity Games
por: Watanabe, Kazuki
Publicado: (2024)

Modelling the Raft Distributed Consensus Protocol in mCRL2
por: Bora, Parth, et al.
Publicado: (2024)

Parity Games on Temporal Graphs
por: Austin, Pete, et al.
Publicado: (2023)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
por: Doyen, Laurent, et al.
Publicado: (2026)

Constructing Weakly Terminating Interface Protocols
por: Bera, Debjyoti, et al.
Publicado: (2026)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
por: Regaud, Gaëtan, et al.
Publicado: (2025)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
por: Seppelt, Tim
Publicado: (2023)

The Value Problem for Multiple-Environment MDPs with Parity Objective
por: Chatterjee, Krishnendu, et al.
Publicado: (2025)

Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control
por: Phalakarn, Kittiphon, et al.
Publicado: (2024)

Equivalence and Conditional Independence in Atomic Sheaf Logic
por: Simpson, Alex
Publicado: (2024)

Unifying Sequent Systems for Gödel-Löb Provability Logic via Syntactic Transformations
por: Lyon, Tim S.
Publicado: (2024)

On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic Logic
por: Lyon, Tim S.
Publicado: (2024)

Nested Sequents for Intermediate Logics: The Case of Gödel-Dummett Logics
por: Lyon, Tim S.
Publicado: (2023)

Realizing the Maximal Analytic Display Fragment of Labeled Sequent Calculi for Tense Logics
por: Lyon, Tim S.
Publicado: (2024)

Logical GANs: Adversarial Learning through Ehrenfeucht Fraisse Games
por: Mannucci, Mirco A.
Publicado: (2025)

Nested Sequents for Horn-Characterizable Quantified Modal Logics with Equality via Reachability Rules
por: Lyon, Tim S., et al.
Publicado: (2026)

The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
por: Pacheco, Leonardo
Publicado: (2026)

A Unifying Approach to Probabilistic Testing Equivalences
por: Chen, Weijun, et al.
Publicado: (2025)

Towards Term-based Verification of Diagrammatic Equivalence
por: Cailler, Julie, et al.
Publicado: (2026)

Decidability of Quasi-Dense Modal Logics
por: Ostropolski-Nalewaja, Piotr, et al.
Publicado: (2024)

Proof Theory and Decision Procedures for Deontic STIT Logics
por: Lyon, Tim S., et al.
Publicado: (2024)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
por: Koh, Zhuan Khye, et al.
Publicado: (2021)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
por: Lyon, Tim S., et al.
Publicado: (2024)

Towards Counting Markov Equivalence Classes with Logical Constraints
por: Bizzaro, Davide, et al.
Publicado: (2024)

Automating Bitvector and Finite Field Equivalence Proofs in Lean
por: Pertseva, Elizaveta, et al.
Publicado: (2026)

Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
por: Vehlken, Fabian, et al.
Publicado: (2026)