Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

Abstract

Abstract. The paper describes a transformational approach for the specification and formal verification of concurrent and real-time systems. At upper level, one system is specified using the timed process algebra RT-LOTOS. The output of the proposed transformation is a Time Petri net (TPN). The paper particularly shows how a TPN can be automatically constructed from an RT-LOTOS specification using a compositionally defined mapping. The proof of the translation consistency is sketched in the paper and developed in [1].The RT-LOTOS to TPN translation patterns formalized in the paper are being implemented. in a prototype tool. This enables reusing TPNs verification techniques and tools for the profit of RT-LOTOS.

Comparative study of formal specifications through a case study

“…A transformational approach for the specification and formal verification of concurrent and real-time systems was introduced [7]. At upper level, the system is specified using the timed process algebra RT-LOTOS.…”

Mapping RT-LOTOS Specifications into Time Petri Nets

“…Due to lack of space, the formalization of some patterns is skipped. A complete formal definition can be found in the extended version of this paper [13].…”

“…The operational semantics of [14] relies on intervals intersection to calculate a unique time interval for a synchronized transition. However, this approach is not always satisfactory (see [13]).…”