|
Titre :
|
Advances in Verification of Time Petri Nets and Timed Automata A Temporal Logic Approach
|
|
Auteurs :
|
W. Penczek ;
A. Pólrola
|
|
Type de document :
|
ouvrage
|
|
Editeur :
|
London [GB] : Springer, 2006
|
|
Collection :
|
Studies in Computational Intelligence, ISSN 1860-949X
|
|
ISBN/ISSN/EAN :
|
978-3-540-32869-8
|
|
Format :
|
257 pages
|
|
Note générale :
|
Diffusion tous publics
|
|
Langues:
|
= Anglais
|
|
Catégories :
|
SPI9 - INFORMATIQUE
SPI9.4 - RESEAUX
|
|
Mots-clés:
|
CALCUL DE RESEAUX
;
LOGIQUE MATHEMATIQUE
|
|
Résumé :
|
This monograph presents a comprehensive introduction to timed automata (TA) and time Petri nets (TPNs) which belong to the most widely used models of real-time systems. Some of the existing methods of translating time Petri nets to timed automata are presented, with a focus on the translations that correspond to the semantics of time Petri nets, associating clocks with various components of the nets. "Advances in Verification of Time Petri Nets and Timed Automata A Temporal Logic Approach" introduces timed and untimed temporal specification languages and gives model abstraction methods based on state class approaches for TPNs and on partition refinement for TA. Moreover, the monograph presents a recent progress in the development of two model checking methods, based on either exploiting abstract state spaces or on application of SAT-based symbolic techniques.
|
