Imagen de Portada

State estimation of timed automata under partial observation [Draft version]

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gao, Chao, Lefebvre, Dimitri, Seatzu, Carla, Li, Zhiwu, Giua, Alessandro
Formato:	Preprint
Publicado:	2024
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
por: Zhang, Kuize, et al.
Publicado: (2024)

Non-interference analysis of bounded labeled Petri nets
por: Ran, Ning, et al.
Publicado: (2025)

Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems
por: Han, Xiaoguang, et al.
Publicado: (2024)

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

Quantum finite automata and linear context-free languages: a decidable problem
por: Bertoni, A., et al.
Publicado: (2013)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
por: Briones, Laura Brandán, et al.
Publicado: (2025)

Database-assisted automata learning
por: Walinga, Hielke, et al.
Publicado: (2024)

Deterministic Parikh automata on infinite words
por: Grobler, Mario, et al.
Publicado: (2024)

Conway's cosmological theorem and automata theory
por: Lairez, Pierre, et al.
Publicado: (2024)

Cerny type automata and rank conjecture
por: Rystsov, Igor
Publicado: (2025)

The complexity of separability for semilinear sets and Parikh automata
por: Collins, Elias Rojas, et al.
Publicado: (2024)

Non-deterministic asynchronous automata games and their undecidability
por: Adsul, Bharat, et al.
Publicado: (2024)

Diagnosability of labeled $\mathfrak{D_p}$ automata
por: Zhang, Kuize, et al.
Publicado: (2021)

The complexity of reachability problems in strongly connected finite automata
por: Kiefer, Stefan, et al.
Publicado: (2025)

Characterizing normality via automata and random matrix products
por: Bienvenu, Laurent, et al.
Publicado: (2026)

Nondeterminism makes unary 1-limited automata concise
por: Guillon, Bruno, et al.
Publicado: (2025)

Exact descriptional complexity of determinization of input-driven pushdown automata
por: Martynova, Olga
Publicado: (2024)

Two-way affine automata can verify every language
por: Chen, Zeyu, et al.
Publicado: (2025)

Soft state reduction of fuzzy automata over residuated lattices
por: Nguyen, Linh Anh, et al.
Publicado: (2025)

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

Cluster automata
por: Kornai, András
Publicado: (2025)

Saturating automata for game semantics
por: Dixon, Alex, et al.
Publicado: (2023)

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

Completeness for categories of generalized automata
por: Boccali, Guido, et al.
Publicado: (2023)

A study on the composition of elementary cellular automata
por: Castillo-Ramirez, Alonso, et al.
Publicado: (2023)

The Agafonov and Schnorr-Stimm theorems for probabilistic automata
por: Bienvenu, Laurent, et al.
Publicado: (2025)

On the transversals of Latin squares generated by nonlinear bipermutive cellular automata
por: Dennunzio, Alberto, et al.
Publicado: (2026)

Idempotent cellular automata and their natural order
por: Castillo-Ramirez, Alonso, et al.
Publicado: (2024)

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

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
por: Bell, Jason P., et al.
Publicado: (2022)

Equality of cycle lengths in one- and two-dimensional $σ$ automata
por: Vadali, Avi, et al.
Publicado: (2025)

Nondeterministic tree-walking automata are not closed under complementation
por: Martynova, Olga, et al.
Publicado: (2024)

Development of parallel programs on shared data-structures -- Revised version
por: Stølen, Ketil
Publicado: (2024)

Entropy of pebble automata and space complexity
por: Montoya, J. Andres
Publicado: (2026)

Cellular automata can really solve the parity problem
por: Wolnik, Barbara, et al.
Publicado: (2025)

Twinning automata and regular expressions for string static analysis
por: Negrini, Luca, et al.
Publicado: (2020)

Synthesis of State-Attack Strategies for Anonymity and Opacity Violation in Discrete Event Systems
por: Li, Xiaoyan, et al.
Publicado: (2025)

Tahr: The Generative Attribute Grammar Framework
por: Ciccaglione, Matteo, et al.
Publicado: (2025)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
por: Goles, Eric, et al.
Publicado: (2026)

Robust MITL planning under uncertain navigation times
por: Linard, Alexis, et al.
Publicado: (2024)