PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
De Francesco N., Fantechi A., Gnesi S., Inverardi P. Model checking of non-finite state processes by finite approximations. In: TACAS '95 - Tools and Algorithms for the Construction and Analysis of Systems : First International Workshop (Aarhus, Denmark, 1920 may 1995). Proceedings, pp. 195 - 215. G. Goos, J. Hartmanis and J. van Leeuwen (eds.). (Lecture Notes in Computer Science, vol. 1019). Springer, 1995.
 
 
Abstract
(English)
In this paper we present a verification methodology, using an action-based logic, able to check properties for full CCS terms, allowing also verification on infinite state systems. Obviously, for some properties we are only able to give a semidecision procedure. The idea is to use (a sequence of) finite state transition systems which approximate the, possibly infinite state, transition system corresponding to a term. To this end we define a particular notion of approximation, which is stronger than simulation, suitable to define and prove liveness and safety properties of the process terms.
DOI: 10.1007/3-540-60630-0_10
Subject Model checking
D.2.4 Software/Program Verification


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional