On the fly model-checking of TPN: TCTLΔh

  • Naima Jbeli
  • , Zohra Sbai
  • , Rahma Ben Ayed

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Temporal logic provides a fundamental framework for formally specifying systems and reasoning about them. Furthermore, model checking techniques lead to the automatic verification of some temporal logic specification that a finite state model of a system should satisfy. In this paper, we adapt the extended logic TCTLΔh; presented in our previous work [9, 10]; to deal with GMECs (Generalized Mutual Exclusion Constraints: specification of Petri net markings) instead of atomic properties. This leads to an extension of TCTL (Timed Computational Tree Logic) on time Petri nets (TPN) called TPN - TCTLΔh. Then, we prove the PSPACE-completeness of this new logic on bounded TPNs. Finally, we propose symbolic verification algorithms which are based on the concept of on the fly verification and implement them using Romeo tool.

Original languageEnglish
Title of host publicationTrends and Advances in Information Systems and Technologies
EditorsLuis Paulo Reis, Alvaro Rocha, Sandra Costanzo, Hojjat Adeli
PublisherSpringer Verlag
Pages441-451
Number of pages11
ISBN (Print)9783319777115
DOIs
StatePublished - 2018
Externally publishedYes
Event6th World Conference on Information Systems and Technologies, WorldCIST 2018 - Naples, Italy
Duration: 27 Mar 201829 Mar 2018

Publication series

NameAdvances in Intelligent Systems and Computing
Volume746
ISSN (Print)2194-5357

Conference

Conference6th World Conference on Information Systems and Technologies, WorldCIST 2018
Country/TerritoryItaly
CityNaples
Period27/03/1829/03/18

Keywords

  • Complexity
  • Decidability
  • Model checking
  • TCTL
  • Time constraints
  • Time petri nets
  • TPN-TCTL

Fingerprint

Dive into the research topics of 'On the fly model-checking of TPN: TCTLΔh'. Together they form a unique fingerprint.

Cite this