Effective representation of RT-LOTOS terms by finite time petri nets

Author: A. Baltag, C. Stirling, D. Harel, J. Gerbrandy, J.A. Bergstra, J.F.A.K. Benthem van, L. Caires, L. Caires, L. Cardelli, M. Dam, M. Hennessy, P.F. Syverson, R. Fagin, R. Milner, R. Milner, W. Charatonik, W. Charatonik
Publisher: Springer Science and Business Media LLC

ABOUT BOOK

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

Powered by: