Binary Reachability Characterization for Pushdown Timed Automata: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:1203:12, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,446 bytes +2,446‎ Created page with "Title: Binary Reachability Characterization for Pushdown Timed Automata Abstract: This research focuses on pushdown timed automata (PTAs), a powerful system that combines both dense clocks and unbounded discrete variables. The main goal is to find a decidable characterization for the binary reachability of PTAs, which is a set of all pairs of configurations that can reach each other. This characterization is crucial for verifying a class of non-region properties that we..."
Retrieved from "https://simplesci.org/wiki/Binary_Reachability_Characterization_for_Pushdown_Timed_Automata"