New Insights into the Decidability of Opacity in Timed Automata

arXiv:2504.00625 · eess.SY, cs.FL, cs.SY · Submitted 2025-04-01 · Read on arXiv

eess.SY, cs.FL, cs.SY

Submitted: 2025-04-01

Updated: 2025-04-01

Terminology

• Verification — 1× in this paper · explained in 2 episodes

Related papers

• One Request, Multiple Experts: LLM Orchestrates Domain Specific Models via Adaptive Task Routing
• A Geometric Decision Procedure for STL Feasibility and Repair
• Scaling up statistical model checking of cyber-physical systems via algorithm ensemble and parallel simulations over HPC infrastructures
• From Asymptotic to Designer-Assigned-Time Control: A Review of Stability Notions, Design Mechanisms, and Controller Architectures
• Battery Second Life: A Review of Experimental Studies
• Submodular Multi-Agent Policy Learning for Online Distributed Task Allocation in Open Multi-Agent Systems