Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...
Although informative, the semantic definition proposed for the most standard agent communication language (FIPA ACL 1997) is complicated and contentious, while published interact...
Shamimabi Paurobally, Jim Cunningham, Nicholas R. ...
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
ion for Stochastic Systems by Erlang's Method of Stages Joost-Pieter Katoen1 , Daniel Klink1 , Martin Leucker2 , and Verena Wolf3 1 RWTH Aachen University 2 TU Munich 3 EPF La...
Joost-Pieter Katoen, Daniel Klink, Martin Leucker,...
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...