Complexity of LTL Model-Checking for Safe Object Nets

Michael Köhler-Bußmeier; Frank Heitmann

doi:10.29007/hn5h

Download PDF Open PDF in browser

Complexity of LTL Model-Checking for Safe Object Nets

15 pages•Published: May 15, 2012

Michael Köhler-Bußmeier and Frank Heitmann

Abstract

In this paper we discuss the complexity of LTL model checking of safe Elementary Object Nets (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach known as the nets-withinnets paradigm. Object nets are called elementary if the net system has a two levelled structure. The well known p/t nets can be considered as a special case of Eos. For p/t nets the concept of safeness means that there is at most one token on each place. Since object nets have nested markings there are different possibilities to generalise this idea for Eos. In this paper we concentrate on the variant of Eos safeness that guarantees the finiteness of state spaces and show that for safe Eos the LTL model checking problem is PSpace-complete.

Keyphrases: complexity, LTL, Mobile Agents, object nets

In: Berndt Müller (editor). LAM'10. 3rd International Workshop on Logics, Agents, and Mobility, vol 7, pages 37--51

Links:	https://easychair.org/publications/paper/8kSf
	https://doi.org/10.29007/hn5h

BibTeX entry

@inproceedings{LAM'10:Complexity_of_LTL_Model_Checking,
  author    = {Michael K\textbackslash{}"ohler-Bu\{\textbackslash{}ss\}meier and Frank Heitmann},
  title     = {Complexity of LTL Model-Checking for Safe Object Nets},
  booktitle = {LAM'10. 3rd International Workshop on Logics, Agents, and Mobility},
  editor    = {Berndt M\textbackslash{}"uller},
  series    = {EPiC Series in Computing},
  volume    = {7},
  pages     = {37--51},
  year      = {2012},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/8kSf},
  doi       = {10.29007/hn5h}}

Download PDF Open PDF in browser