Segev Shlomov, Avi Yaeli
CHI 2024
The most natural, compositional, way of modeling real-time systems uses a dense domain for time. The satisfiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable. We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete. This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics.
Segev Shlomov, Avi Yaeli
CHI 2024
Bing Zhang, Mikio Takeuchi, et al.
NAACL 2025
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence