arXiv (OAI Expanded)
open access
Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor
Timed automata, which extend finite state automata by introducing clock variables, serve as a popular formalism for specifying and analyzing the timed behaviors of real-time systems. Extracting the timed behaviors of a black-box, safety-critical system is crucial for designing and analyzing its real
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Automata Learning to Model Checking: Formal Security Verification of Black-Box Protocols#1070439
- On Synthesis of Metric Interval Temporal Logics#821020
- Checking Timed Bisimilarity with Virtual Clocks#986104
- Static analyzer : a design tool for TROM#1020444
- Fixed point certificates for reachability and expected rewards in MDPs#1039242
Record · ID 1123284
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive