Change search
ReferencesLink to record
Permanent link

Direct link
State space representation for verification of open systems
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
2006 (English)Licentiate thesis, monograph (Other scientific)
Abstract [en]

When designing an open system, there might be no implementation available for cer- tain components at verification time. For such systems, verification has to be based on assumptions on the underspecified components. In this thesis, we present a framework for the verification of open systems through explicit state space representation.

We propose Extended Modal Transition Systems (EMTS) as a suitable structure for representing the state space of open systems when assumptions on components are writ- ten in the modal μ-calculus. EMTSs are based on the Modal Transition Systems (MTS) of Larsen. This representation supports state space exploration based verification tech- niques, and provides an alternative formalism for graphical specification. In interactive verification, it enables proof reuse and facilitates visualization for the user guiding the verification process.

We present a two-phase construction from process algebraic open system descriptions to such state space representations. The first phase deals with component assumptions, and is essentially a maximal model construction for the modal μ-calculus that makes use of a powerset construction for the fixed point cases. In the second phase, the models obtained are combined according to the structure of the open system to form the complete state space. The construction is sound and complete for systems with a single unknown component and sound for those without dynamic process creation. We suggest a tableau-based proof system for establishing open system properties of the state space representation. The proof system is sound and it is complete for modal μ-calculus formulae with only prime subformulae.

A complete framework based on the state space representation is offered for the auto- matic verification of open systems. The process begins with specifying the open system by a process algebraic term with assumptions. Then, the state space representation is ex- tracted from this description using the construction described above. Finally, open system properties can be checked on this representation using the proof system.

Place, publisher, year, edition, pages
Stockholm: Numerisk analys och datalogi , 2006. , viii, 100 p.
Trita-CSC-A, ISSN 1653-5723 ; 2006:3
National Category
Computer Science
URN: urn:nbn:se:kth:diva-3973ISBN: 91-7178-341-5OAI: diva2:10232
2006-05-31, E3, KTH, Osquars Backe 14, Stockholm, 10:00
QC 20101108Available from: 2006-05-17 Created: 2006-05-17 Last updated: 2010-11-08Bibliographically approved

Open Access in DiVA

fulltext(732 kB)336 downloads
File information
File name FULLTEXT01.pdfFile size 732 kBChecksum SHA-1
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Aktug, Irem
By organisation
Numerical Analysis and Computer Science, NADA
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 336 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 669 hits
ReferencesLink to record
Permanent link

Direct link