Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
In the Turing test, a computer model is deemed to “think intelligently” if it can generate answers that are not distinguishable from those of a human. This test is limited to t...
Amir Karniel, Ilana Nisky, Guy Avraham, Bat-Chen P...
- Some of manufacturing tasks such as sawing task often requires continuous impulsive motion. In case of sawing task, such impulsive motions can be observed between the teeth of th...
Jae Hoon Lee, Byung-Ju Yi, Sang-Rok Oh, Il Hong Su...
This paper describes an experiment in formal specification and validation performed in the context of an industrial joint project. The project involved an Italian company working...
Stefania Gnesi, Diego Latella, Gabriele Lenzini, C...
This paper proposes efficient algorithms for implementing multicast in heterogeneous workstation/PC clusters. Multicast is an important operation in many scientific and industri...