Author:Marais, Laurette; Van Zijl, LDate:Sep 2017Previously, self-verifying symmetric difference automata were defined and a tight bound of 2^n-1-1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n at least 2, there is a regular ...Read more
Author:Seotsanyana, MDate:Jan 2010In this paper, a critical review on temporal logic motion planning is presented. The review paper aims to address the following problems: (a) In a realistic situation, the motion planning problem is carried out in real-time, in a dynamic, ...Read more
Author:Ongoma, EAN; Keet, CM; Meyer, TDate:Jul 2014Representing temporal data in conceptual data models and ontologies is required by various application domains. For it to be useful for modellers to represent the information precisely and reason over it, it is essential to have a language ...Read more