arXiv (All)
open access
Checking Timed Bisimilarity with Virtual Clocks
Timed automata are a widely used formalism for specifying the discrete-state/continuous-time behavior of time-critical reactive systems. For the fundamental verification problem of comparing two timed automata, it has been shown that timed trace equivalence is undecidable, while timed bisimulation i
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
- Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor#1123284
- Fixed point certificates for reachability and expected rewards in MDPs#1039242
- Executing Discrete/Continuous Declarative Process Specifications via Complex Event Processing#1105939
- On Synthesis of Metric Interval Temporal Logics#821020
- Diversifying to Verify: When Task-Equivalent Programs Differ in Verifiability#361509
Record · ID 986104
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