abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the pr...
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
We define a type system for COWS, a formalism for specifying and combining services, while modelling their dynamic behaviour. Our types permit to express policies constraining dat...
Alessandro Lapadula, Rosario Pugliese, Francesco T...
We consider a hierarchy of modal event calculi to represent and reason about partially ordered events. These calculi are based on the model of time and change of Kowalski and Sergo...