Cover Image

Structural Reductions and Stutter Sensitive Properties

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Paviot-Adet, Emmanuel, Poitrenaud, Denis, Renault, Etienne, Thierry-Mieg, Yann
Format:	Preprint
Published:	2022
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)

Parametric Timed Pattern Matching
by: Waga, Masaki, et al.
Published: (2019)

Execution-time opacity problems in one-clock parametric timed automata
by: André, Étienne, et al.
Published: (2024)

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

Realisability and Complementability of Multiparty Session Types
by: Di Giusto, Cinzia, et al.
Published: (2025)

Explorable Parity Automata
by: Hazard, Emile, et al.
Published: (2024)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

Closure and Decision Properties for Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2023)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

Approximate Problems for Finite Transducers
by: Filiot, Emmanuel, et al.
Published: (2025)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
by: Esparza, Javier, et al.
Published: (2023)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability
by: Cimatti, Alessandro, et al.
Published: (2024)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Structural Abstraction and Refinement for Probabilistic Programs
by: Li, Guanyan, et al.
Published: (2025)

Iterating Non-Aggregative Structure Compositions
by: Bozga, Marius, et al.
Published: (2025)

Counting Abstraction for the Verification of Structured Parameterized Networks
by: Bozga, Marius, et al.
Published: (2025)

Do CFLOBDDs Actually Make Use of Linear Structure?
by: Sistla, Meghana Aparna, et al.
Published: (2026)

Hyper parametric timed CTL
by: Waga, Masaki, et al.
Published: (2024)

Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length
by: Lan, Nur, et al.
Published: (2024)

A Diamond Structure in the Transducer Hierarchy
by: Kaufmann, Noah
Published: (2021)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)

Finite maximal codes and factorizations of cyclic groups
by: De Felice, Clelia
Published: (2022)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
by: Angluin, Dana, et al.
Published: (2022)

History-deterministic Parikh Automata
by: Erlich, Enzo, et al.
Published: (2022)

All about unambiguous polynomial closure
by: Place, Thomas, et al.
Published: (2022)

The Power-Set Construction for Tree Algebras
by: Blumensath, Achim
Published: (2022)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Minimality Notions via Factorization Systems and Examples
by: Wißmann, Thorsten
Published: (2022)

Weighted Tree Automata -- May it be a little more?
by: Fülöp, Zoltán, et al.
Published: (2022)

Composing Copyless Streaming String Transducers
by: Alur, Rajeev, et al.
Published: (2022)

Binary codes that do not preserve primitivity
by: Holub, Štěpán, et al.
Published: (2022)

Waiting Nets: State Classes and Taxonomy
by: Hélouët, Loïc, et al.
Published: (2022)

Simulations for Event-Clock Automata
by: Akshay, S, et al.
Published: (2022)

Deterministic pushdown automata can compress some normal sequences
by: Carton, Olivier, et al.
Published: (2022)

Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)