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

  • Authors:
  • Tarek Sadani;Marc Boyer;Pierre de Saqui-Sannes;Jean-Pierre Courtiat

  • Affiliations:
  • LAAS-CNRS, Toulouse Cedex 04, France;IRIT-CNRS/ENSEEIHT, Toulouse, France;LAAS-CNRS, Toulouse Cedex 04, France;LAAS-CNRS, Toulouse Cedex 04, France

  • Venue:
  • FORTE'06 Proceedings of the 26th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.