Compositional validation of time-critical systems using communicating time Petri nets

Abstract

An extended Petri Net model which considers modular partitioning along with timing restrictions and environment models is presented. Module constructs permit the specification of a complex system as a set of message passing modules with the timing semantics of Time Petri Nets. The state space of each individual module can be separately enumerated and assessed under the assumption of a partial specification of the intended module operation environment. State spaces of individual modules can be recursively integrated, to permit the assessment of module clusters and of the overall model, and to check the satisfaction of the assumptions made in the separate analysis of elementary component modules. In the intermediate stages between subsequent integration steps, the state spaces of module and module clusters can be projected onto reduced representations concealing local events that are not essential to the purposes of the analysis. The joint use of incremental enumeration and intermediate concealment of local events allows for a flexible management of state explosion, and permits a scalable approach to the validation of complex systems.

A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems

“…The pTPN submodel of the global scheduler of each application comprises a kind of Required Interface [6] accounting for the environment where the local application is embedded. Generalization of the structure of this interface seems a promising way to extend the analysis to more complex schemes of hierarchy that encompass inter-application communication mechanisms as prescribed by the ARINC-653 standard [1].…”

Specification and verification of multimedia synchronization scenarios using time-Estelle

“…It can describe a hierarchically structured system and interchange messages through bidirectional links. Communicating Time Petri Nets (CmTPNs) 10 require huge nets to express a structured system and do not have enough expressive power for specifying the hierarchical multimedia synchronization scenarios. CmTPNs also do not support parallelism and nondeterminism of module instances.…”

Timed Hierarchical Object-Oriented Petri Net

“…An enabled transition in TOPN may or may not fire depending on the additional interpretation (Merlin & Farber, 1976) (Bucci & Vivario, 1995) (Harel & Gery, 1996), and b. The relative time , relative to the absolute enabling time , is not smaller than the earliest firing time (EFT) of transition t i , and not greater than the smallest of the latest firing time (LFT) of all the transitions enabled by marking M (Hong & Bae, 2000): EFT of t i min (LFT of t k ) where k ranges over the set of transitions enabled by M, the same as (Hong & Bae, 2000).…”