We propose an extension of alternating-time temporal logic, that can be used for reasoning about the behavior and abilities of agents under various rationality assumptions. Catego...
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
This article presents a new method to achieve heterogeneous physical simulation, within the same global system, of both deformable and rigid-bodies objects, whatever their intrins...
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...