Skip to main content
SpringerLink
Log in

Everything Is PSPACE-Complete in Interaction Systems

  • Conference paper
Theoretical Aspects of Computing - ICTAC 2008 (ICTAC 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5160))

Included in the following conference series:

Abstract

We study complexity issues for interaction systems, a general model for component-based systems that allows for a very flexible interaction mechanism. We present complexity results for important properties of interaction systems such as local/global deadlock-freedom, progress and availability of components.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldini, A., Bernardo, M.: A General Approach to Deadlock Freedom Verification for Software Architectures. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 658–677. Springer, Heidelberg (2003)

    Google Scholar 

  2. Aoumeur, N., Saake, G.: Towards an Object Petri Nets Model for Specifying and Validating Distributed Information Systems. In: Jarke, M., Oberweis, A. (eds.) CAiSE 1999. LNCS, vol. 1626, pp. 381–395. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Aoumeur, N., Saake, G.: A Component-based Petri Net Model for Specifying and Validating Cooperative Information Systems. Data Knowl. Eng. 42(2), 143–187 (2002)

    Article  MATH  Google Scholar 

  4. Bastide, R., Barboni, E.: Component-based Behavioural Modelling with High-Level Petri Nets. In: Proceedings of MOCA 2004, pp. 37–46 (2004)

    Google Scholar 

  5. Bastide, R., Barboni, E.: Software Components: a Formal Semantics Based on Coloured Petri Nets. In: Proceedings of FACS 2005. ENTCS, vol. 160, pp. 57–73 (2006)

    Google Scholar 

  6. Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-time Components in BIP. In: Proceedings of SEFM 2006, pp. 3–12. IEEE Computer Society Press, Los Alamitos (2006)

    Google Scholar 

  7. Bernardo, M., Ciancarini, P., Donatiello, L.: Architecting Families of Software Systems with Process Algebras. ACM Trans. on Software Engineering and Methodology 11, 386–426 (2002)

    Article  Google Scholar 

  8. Baumeister, H., Hacklinger, F., Hennicker, R., Knapp, A., Wirsing, M.: A Component Model for Architectural Programming. In: Proceedings of FACS 2005. ENTCS, vol. 160, pp. 75–96 (2006)

    Google Scholar 

  9. Cheng, A., Esparza, J., Palsberg, J.: Complexity Results for 1-safe Nets. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol. 761, pp. 326–337. Springer, Heidelberg (1993)

    Google Scholar 

  10. de Alfaro, L., Henzinger, T.: Interface Automata. In: Matsui, M. (ed.) FSE 2001. LNCS, vol. 2355, pp. 109–120. Springer, Heidelberg (2002)

    Google Scholar 

  11. Goessler, G., Graf, S., Majster-Cederbaum, M., Martens, M., Sifakis, J.: Ensuring Properties of Interaction Systems. In: Reps, T., Sagiv, M., Bauer, J. (eds.) Wilhelm Festschrift. LNCS, vol. 4444, pp. 201–224. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Graf, S., Ober, I.: Modelling and Validation of Software and Architecture with Omega-UML and the IF Validation Toolbox. In: Genie Logiciel (to appear, 2007), http://www.speeds.eu.com

  13. Goessler, G.: Component-based Design of Heterogeneous Reactive Systems in Prometheus. Technical report 6057, INRIA (December 2006)

    Google Scholar 

  14. Graf, S., Quinton, S.: Contracts for BIP: Hierarchical Interaction Models for Compositional Verification. In: Derrick, J., Vain, J. (eds.) FORTE 2007. LNCS, vol. 4574, pp. 1–18. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Goessler, G., Sifakis, J.: Component-based Construction of Deadlock-free Systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 420–433. Springer, Heidelberg (2003)

    Google Scholar 

  16. Goessler, G., Sifakis, J.: Composition for Component-based Modeling. Sci. Comput. Program. 55(1-3), 161–183 (2005)

    Article  MATH  Google Scholar 

  17. Inverardi, P., Uchitel, S.: Proving Deadlock Freedom in Component-Based Programming. In: Hussmann, H. (ed.) FASE 2001. LNCS, vol. 2029, pp. 60–75. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Lynch, N.A., Tuttle, M.R.: An Introduction to Input/Output Automata. In: CWI-Quarterly, pp. 219–246 (1989)

    Google Scholar 

  19. Majster-Cederbaum, M., Martens, M.: Compositional Analysis of Tree-Like Component Architectures (submitted for publication, 2008)

    Google Scholar 

  20. Majster-Cederbaum, M., Minnameier, C.: 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. LNCS, vol. 4910, pp. 352–363. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  21. Majster-Cederbaum, M., Martens, M., Minnameier, C.: Liveness in Interaction Systems. In: Proceedings of FACS 2007. ENTCS (2007)

    Google Scholar 

  22. Majster-Cederbaum, M., Martens, M., Minnameier, C.: A Polynomial-time Checkable Sufficient Condition for Deadlock-Freedom of Component-based Systems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 888–899. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Padberg, J., Kuessel, U.: A Component-based Verification Approach based on Petri Net Components. In: Proceedings of FORMS/FORMAT 2007, pp. 40–50 (2007)

    Google Scholar 

  24. Savitch, W.: Relationships between Nondeterministic and Deterministic Tape Complexities. Journal of Computer and System Sciences 4, 177–192 (1970)

    MATH  MathSciNet  Google Scholar 

  25. Sifakis, J.: A Framework for Component-based Construction. In: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods, pp. 293–300. IEEE Computer Society Press, Los Alamitos (2005)

    Chapter  Google Scholar 

  26. Sidorova, N., Voorhoeve, M., van der Woude, J.C.S.P.: A Calculus of Petri Net Components. In: Proceedings of MOCA 2001, pp. 121–132 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Mannheim, Germany

    Mila Majster-Cederbaum & Christoph Minnameier

Authors
  1. Mila Majster-Cederbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christoph Minnameier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John S. Fitzgerald Anne E. Haxthausen Husnu Yenigun

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Majster-Cederbaum, M., Minnameier, C. (2008). Everything Is PSPACE-Complete in Interaction Systems. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds) Theoretical Aspects of Computing - ICTAC 2008. ICTAC 2008. Lecture Notes in Computer Science, vol 5160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85762-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85762-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85761-7

  • Online ISBN: 978-3-540-85762-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation