Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets

  • Mila Majster-Cederbaum
  • Christoph Minnameier
Conference paper

DOI: 10.1007/978-3-540-77566-9_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4910)
Cite this paper as:
Majster-Cederbaum M., Minnameier C. (2008) Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. In: Geffert V., Karhumäki J., Bertoni A., Preneel B., Návrat P., Bieliková M. (eds) SOFSEM 2008: Theory and Practice of Computer Science. SOFSEM 2008. Lecture Notes in Computer Science, vol 4910. Springer, Berlin, Heidelberg

Abstract

Interaction systems are a formal model for component-based systems, where components are combined via connectors to form more complex systems. We compare interaction systems (IS) to the well-studied model of 1-safe Petri nets (1SN) by giving a translation map1: 1SNIS and a translation map2: IS1SN, so that a 1-safe Petri net (an interaction system) and its according interaction system (1-safe Petri net) defined by the respective mapping are isomorphic up to some label relation R. So in some sense both models share the same expressiveness. Also, the encoding \(\textit{map}_1\) is polynomial and can be used to reduce the problems of reachability, deadlock and liveness in 1SN to the problems of reachability, deadlock and liveness in IS, yielding PSPACE-hardness for these questions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Mila Majster-Cederbaum
    • 1
  • Christoph Minnameier
    • 1
  1. 1.Institut für InformatikUniversität MannheimGermany

Personalised recommendations