Bibliografía

Complexity of LTL Model-Checking for Safe Object Nets

Michael Köhler-Bußmeier and Frank Heitmann.
Complexity of LTL model-checking for safe object nets.
In B. Farwer, editor, Proceedings of the International Workshop on Logic, Agents, and Mobilitty (LAM 2010), 2010.

Resumen: In this paper we present recently obtained results from [14] concerning the complexity of LTL model checking of safe Elementary Object Nets (EOS) in a novel and more algorithmic oriented way. 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. Due to these two modelling levels object nets are very suited to model the mobility of e.g. active objects or agents. The well known p/t nets can be viewed 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.

BibTeX registro

@InProceedings{Koehler+10b,
  author =   {K{\"o}hler-Bu{\ss}meier, Michael and Heitmann, Frank},
  title =  {Complexity of {LTL} Model-Checking  for Safe Object Nets},
  editor = {Farwer, B.},
  booktitle =  {Proceedings of the International Workshop
     on Logic, Agents, and Mobilitty (LAM 2010)},
  year =  {2010},
  abstract ={In this paper we present recently obtained results from [14] concerning the complexity of LTL
model checking of safe Elementary Object Nets (EOS) in a novel and more algorithmic oriented way.
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. Due
to these two modelling levels object nets are very suited to model the mobility of e.g. active objects
or agents. The well known p/t nets can be viewed 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.}
}

Copyright Notice

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.