Cover Image

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aceto, Luca, Achilleos, Antonis, Chalki, Aggeliki, Ingólfsdóttir, Anna
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Deciding characteristic formulae: A journey in the branching-time spectrum
by: Aceto, Luca, et al.
Published: (2025)

The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
by: Aceto, Luca, et al.
Published: (2024)

Complexity results for modal logic with recursion via translations and tableaux
by: Aceto, Luca, et al.
Published: (2023)

When Are Prime Formulae Characteristic?
by: Aceto, Luca, et al.
Published: (2024)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

A unified rule format for bounded nondeterminism in SOS with terms as labels
by: Aceto, Luca, et al.
Published: (2024)

Logical characterisations, rule formats and compositionality for input-output conformance simulation
by: Aceto, Luca, et al.
Published: (2024)

An Undecidability Proof for the Plan Existence Problem
by: Achilleos, Antonis
Published: (2026)

On the specification of modal systems: A comparison of three frameworks
by: Aceto, Luca, et al.
Published: (2024)

Rule Formats for Nominal Process Calculi
by: Aceto, Luca, et al.
Published: (2024)

Centralized vs Decentralized Monitors for Hyperproperties
by: Aceto, Luca, et al.
Published: (2024)

If At First You Don't Succeed: Extended Monitorability through Multiple Executions
by: Achilleos, Antonis, et al.
Published: (2023)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
by: Achilleos, Antonis, et al.
Published: (2024)

Modulo quantifiers over functional vocabularies extending addition
by: Baskar, A., et al.
Published: (2017)

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
by: Balasubramanian, A. R.
Published: (2024)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

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

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
by: Jung, Jean Christoph, et al.
Published: (2025)

A proof-theoretic approach to abstract interpretation
by: D'Silva, Vijay, et al.
Published: (2026)

Nested Sequents for Quasi-transitive Modal Logics
by: Marin, Sonia, et al.
Published: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

MCSAT Modulo Transcendental Arithmetics
by: Gallego-Hernández, Jorge, et al.
Published: (2026)

Generalized Optimization Modulo Theories
by: Tsiskaridze, Nestan, et al.
Published: (2024)

Congruence Closure Modulo Groups
by: Kim, Dohan
Published: (2023)

An abstract fixed-point theorem for Horn formula equations
by: Hetzl, Stefan, et al.
Published: (2025)

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

On Deciding Constant Runtime of Linear Loops
by: Frohn, Florian, et al.
Published: (2026)

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

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

Decidability of MSO Reparameterization over Countable Chains
by: Rabinovich, Alexander
Published: (2026)

The 2-Dimensional Constraint Loop Problem is Decidable
by: Guilmant, Quentin, et al.
Published: (2024)

Craig Interpolation for Decidable First-Order Fragments
by: Cate, Balder ten, et al.
Published: (2023)

Optimization Modulo Integer Linear-Exponential Programs
by: Hitarth, S, et al.
Published: (2025)