Chapter

SOFSEM 2008: Theory and Practice of Computer Science

Volume 4910 of the series Lecture Notes in Computer Science pp 352-363

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

  • Mila Majster-CederbaumAffiliated withInstitut für Informatik, Universität Mannheim
  • , Christoph MinnameierAffiliated withInstitut für Informatik, Universität Mannheim

* Final gross prices may vary according to local VAT.

Get Access

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 map 1: 1SNIS and a translation map 2: 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.