Process Algebra to Model Probabilistic Behavior of Smart IoT
In general, process algebra can be the most suitable formal method to specify IoT systems due to the equivalent notion of processes as things. However there are some limitations to predict smart IoT systems with the properties of distribution, mobility and real-time. For example, Timed pi-Calculus has capability of specifying time property, but is lack of direct specifying both execution time of action and mobility of process at the same time. And d-Calculus has capability of specifying mobility of process itself, but is lack of specifying various time properties of both action and process, such as, ready time, timeout, execution time, deadline, as well as priority and repetition. In order to overcome the limitations, this lecture presents a process algebra, called, dTp-Calculus, extended from d-Calculus, by providing with capability of specifying probabilistic transitions with the set of time properties, as well as priority and repetition. Further the method is implemented as a tool, called SAVE, on the ADOxx meta-modeling platform. It can be considered one of the most practical and innovative approaches to model probabilistic behavior of smart IoT systems.
Lecture at NEMO2019
Date/Time: Wednesday, July 24, 2019 at 09:00