1. Luca de Alfaro & Thomas A. Henzinger (2001): Interface Automata. SIGSOFT Softw. Eng. Notes 26(5), pp. 109–120, doi:10.1145/503271.503226.
  2. Hubert Baumeister, Florian Hacklinger, Rolf Hennicker, Alexander Knapp & Martin Wirsing (2006): A Component Model for Architectural Programming. Electr. Notes Theor. Comput. Sci. 160, pp. 75–96, doi:10.1016/j.entcs.2006.05.015.
  3. Saddek Bensalem, Marius Bozga, Joseph Sifakis & Thanh-Hung Nguyen (2008): Compositional Verification for Component-Based Systems and Application. In: Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis, ATVA '08. Springer-Verlag, Berlin, Heidelberg, pp. 64–79, doi:10.1007/978-3-540-88387-6_7.
  4. Marco Bernardo, Paolo Ciancarini & Lorenzo Donatiello (2002): Architecting Families of Software Systems with Process Algebras. ACM Trans. Softw. Eng. Methodol. 11(4), pp. 386–426, doi:10.1145/606612.606614.
  5. Borzoo Bonakdarpour, Marius Bozga & Gregor Goessler (2011): A Theory of Fault Recovery for Component-Based Models. In: Proceedings of the 2011 IEEE 30th International Symposium on Reliable Distributed Systems, SRDS '11. IEEE Computer Society, Washington, DC, USA, pp. 265–270, doi:10.1109/SRDS.2011.39.
  6. Stephen D. Brookes & A. W. Roscoe (1991): Deadlock Analysis in Networks of Communicating Processes. Distributed Computing 4, pp. 209–230, doi:10.1007/BF01784721.
  7. Allan Cheng, Javier Esparza & Jens Palsberg (1993): Complexity results for 1-safe nets. In: Proceedings of FSTTCS'93, LNCS 761, pp. 326–337, doi:10.1007/3-540-57529-4_66.
  8. Michael R. Garey & David S. Johnson (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
  9. Gregor Gössler, Sussane Graf, Mila Majster-Cederbaum, M. Martens & Joseph Sifakis (2007): An Approach to Modelling and Verification of Component Based Systems. In: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, SOFSEM '07. Springer-Verlag, Berlin, Heidelberg, pp. 295–308, doi:10.1007/978-3-540-69507-3_24.
  10. Gregor Gössler & Joseph Sifakis (2005): Composition for Component-Based Modeling. Sci. Comput. Program. 55(1-3), pp. 161–183, doi:10.1016/j.scico.2004.05.014.
  11. Rolf Hennicker, Stephan Janisch & Alexander Knapp (2010): On the Observable Behaviour of Composite Components. Electron. Notes Theor. Comput. Sci. 260, pp. 125–153, doi:10.1016/j.entcs.2009.12.035.
  12. Charles A. R. Hoare (1985): Communicating Sequential Processes. Prentice-Hall International series in computer science, Englewood Cliffs, NJ [u.a.].
  13. Neil D. Jones, Lawrence H. Landweber & Y. Edmund Lien (1977): Complexity of Some Problems in Petri Nets. Theor. Comput. Sci. 4(3), pp. 277–299, doi:10.1016/0304-3975(77)90014-7.
  14. Christian Lambertz (2009): Exploiting Architectural Constraints and Branching Bisimulation Equivalences in Component-Based Systems. In: Proceedings of the Doctoral Symposium on FM2009, University of Eindhoven Technical Report 0915, pp. 1–7. Available at
  15. Christian Lambertz & Mila Majster-Cederbaum (2012): Analyzing Component-Based Systems on the Basis of Architectural Constraints. In: Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering, FSEN'11. Springer-Verlag, Berlin, Heidelberg, pp. 64–79, doi:10.1007/978-3-642-29320-7_5.
  16. Mila Majster-Cederbaum & Moritz Martens (2008): Compositional Analysis of Deadlock-Freedom for Tree-Like Component Architectures. In: Proceedings of the 8th ACM international conference on Embedded software, EMSOFT '08. ACM, New York, NY, USA, pp. 199–206, doi:10.1145/1450058.1450085.
  17. Mila Majster-Cederbaum & Christoph Minnameier (2008): Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. In: Proceedings of the 34th conference on Current trends in theory and practice of computer science, SOFSEM'08. Springer-Verlag, Berlin, Heidelberg, pp. 352–363, doi:10.1007/978-3-540-77566-9_30.
  18. Mila Majster-Cederbaum & Christoph Minnameier (2008): Everything Is PSPACE-Complete in Interaction Systems. In: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing. Springer-Verlag, Berlin, Heidelberg, pp. 216–227, doi:10.1007/978-3-540-85762-4_15.
  19. Mila Majster-Cederbaum & Nils Semmelrock (2010): Reachability in Tree-Like Component Systems is PSPACE-Complete. Electron. Notes Theor. Comput. Sci. 263, pp. 197–210, doi:10.1016/j.entcs.2010.05.012.
  20. Moritz Martens & Mila Majster-Cederbaum (2009): Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation. In: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE '09. IEEE Computer Society, Washington, DC, USA, pp. 225–232, doi:10.1109/TASE.2009.18.

Comments and questions to:
For website issues: