Toggle Main Menu Toggle Search

ePrints

ITL Semantics of Composite Petri Nets

Lookup NU author(s): Professor Maciej Koutny

Downloads


Abstract

Interval Temporal Logic (ITL) and Petri nets are two well developed formalisms for the specification and analysis of concurrent systems.ITL allows one to specify both the system design and correctness requirements within the same logic based on intervals (sequences of states).As a result, verification of system properties can be carried out by checking that the formula describing a system implies the formula describing a requirement.Petri nets, on the other hand, have state based semantics and allow for a direct expression of causality aspects in system behaviour.As a result, verification of system properties can be carried out using partial order reductions or invariant based techniques. In this paper, we aim at providing a basic semantical link between ITL and Petri nets so that, in particular, one would be able to use both kinds of verification techniques of system properties.


Publication metadata

Author(s): Koutny M; Duan Z; Klaudel H

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2011

Pages: 18

Print publication date: 01/11/2011

Source Publication Date: November 2011

Report Number: 1296

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne


Share