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.

Model checking of non-finite state processes by finite approximations

Fantechi A;Gnesi S;
1993

Abstract

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.
1993
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
CCS
Software/Program Verification
File in questo prodotto:
File Dimensione Formato  
prod_411541-doc_144928.pdf

accesso aperto

Descrizione: Model checking of non-finite state processes by finite approximations
Dimensione 1.74 MB
Formato Adobe PDF
1.74 MB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/360515
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact