Execution-time opacity problems in one-clock parametric timed automata

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	André, Étienne, Arcile, Johan, Lefaucheux, Engel
Format:	Preprint
Published:	2024
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

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

The Bright Side of Timed Opacity
by: André, Étienne, et al.
Published: (2024)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

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

State estimation of timed automata under partial observation [Draft version]
by: Gao, Chao, et al.
Published: (2024)

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

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

Database-assisted automata learning
by: Walinga, Hielke, et al.
Published: (2024)

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

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

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

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

Cerny type automata and rank conjecture
by: Rystsov, Igor
Published: (2025)

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

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

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

Execution and monitoring of HOA automata with HOAX
by: Di Stefano, Luca
Published: (2025)

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

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

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

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

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

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

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

Cluster automata
by: Kornai, András
Published: (2025)

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

Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)

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

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

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

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

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

Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)

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

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

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

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

A Linear-time Simulation of Deterministic $d$-Limited Automata
by: Rubtsov, Alexander
Published: (2023)

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

Structural Reductions and Stutter Sensitive Properties
by: Paviot-Adet, Emmanuel, et al.
Published: (2022)