1 / 1

New Insights into Timed Automata and Logic: The po2DTA and T-UIL Framework

This paper presents groundbreaking insights into partially ordered 2-way deterministic timed automata (po2DTA) and their equivalence to Timed-Unambiguous Interval Logic (T-UIL). We introduce the concept of a small model for po2DTA, demonstrating that an n-state po2DTA has a model size of at most n^2. We explore the complexities of satisfiability, revealing NP-completeness for T-UIL and PSPACE membership for reversal-bounded structures. Additionally, we address challenges in logical characterizations and undecidability of certain complementations, enriching the understanding of timed automata and their applications in real-time systems.

joshua
Télécharger la présentation

New Insights into Timed Automata and Logic: The po2DTA and T-UIL Framework

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. (Paritosh Pandya, Simoni Shah) NEW INSIGHTS IMPACT STATUS QUO LONG TERM GOALS Unambiguity In Time We introduce Partially Ordered 2-way Deterministic Timed Automata (po2DTA)‏ Timed- Unambiguous Interval Logic (T-UIL)‏ po2DTA ≡ T-UIL po2DTA: Small Model for po2DTA: A po2DTA with n states has a “small model” of size atmost n^2 Satisfiability is NP-complete Timed-UIL : Unambiguous chop- wrt the letter and a time constraint 2-NTA –reversal bounded: Satisfiability is in PSPACE Fully decidable timed automata, and logics in real time PROBLEM We have a 2- way DTA, which is reversal bounded due to partial order NTA- complementation undecidable Equivalent logical characterizations Finding a monadic-logic characterization for the same class. We have a boolean-closed timed automaton and logic with NP-complete satisfiability.

More Related