Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Madnani, Khushraj Nanik"'
We investigate the decidability of the ${0,\infty}$ fragment of Timed Propositional Temporal Logic (TPTL). We show that the satisfiability checking of TPTL$^{0,\infty}$ is PSPACE-complete. Moreover, even its 1-variable fragment (1-TPTL$^{0,\infty}$)
Externí odkaz:
http://arxiv.org/abs/2309.00386
This paper studies the reduction (abstraction) of finite-state transition systems for control synthesis problems. We revisit the notion of alternating simulation equivalence (ASE), a more relaxed condition than alternating bisimulations, to relate sy
Externí odkaz:
http://arxiv.org/abs/2203.01672
In this paper, we study the extension of 1-clock Alternating Timed Automata (1-ATA) with the ability to read in both forward and backward direction, the 2-Way 1-clock Alternating Timed Automata (2-Way 1-ATA). We show that subclass of 2-Way 1-ATA with
Externí odkaz:
http://arxiv.org/abs/2107.12986