Execution-Time Opacity in (Controllable) Timed Automata is Hard

Authors

Engel Lefaucheux (ORCID: https://orcid.org/0000-0003-0875-300X)
Sarah Dépernet (ORCID: https://orcid.org/0009-0003-8710-7934)

Institutions

Centre National de la Recherche Scientifique (FR)
Institut national de recherche en sciences et technologies du numérique (FR)
Laboratoire Lorrain de Recherche en Informatique et ses Applications (FR)
Université de Lorraine (FR)

Publication Details

Journal: Electronic Proceedings in Theoretical Computer Science
Published: 2026-10-06
DOI: https://doi.org/10.4204/eptcs.454.7
Primary Topic: Formal Methods in Verification
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Execution-Time Opacity in (Controllable) Timed Automata is Hard

Engel Lefaucheux, Sarah Dépernet

Oct 6, 2026

Electronic Proceedings in Theoretical Computer Science

Formal Methods in Verification

article

Execution-Time Opacity in (Controllable) Timed Automata is Hard

Engel Lefaucheux, Sarah Dépernet

October 6, 2026article en

Abstract

No abstract available for this paper.

Electronic Proceedings in Theoretical Computer ScienceVol. 454

Centre National de la Recherche Scientifique (FR), Institut national de recherche en sciences et technologies du numérique (FR), Laboratoire Lorrain de Recherche en Informatique et ses Applications (FR), Université de Lorraine (FR)

Openalex Percentile: Top 25%

Formal Methods in Verification

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.