Liveness in Interaction Systems

Electronic Notes in Theoretical Computer Science

Volumn 215, Issue C, 2008, Pages 57-74

  Majster Cederbaum, Mila ^a   Martens, Moritz ^a   Minnameier, Christoph ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

Component based Modeling; Interaction Systems; Liveness

Indexed keywords

ALUMINUM; NUCLEAR PROPULSION;

(N-1) CRITERION; COMPONENT-BASED SYSTEMS; ELSEVIER (CO); INTERACTION SYSTEMS; LIVENESS; LOCAL INFORMATION; NP-HARD; POLYNOMIAL-TIME; PROPERTY (S);

FLOW INTERACTIONS;

EID: 46049109708     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.06.021     Document Type: Article

References (41)

1. Allen R., and Garlan D. A Formal Basis for Architectural Connection. ACM Trans. Softw. Eng. Methodol. 6 3 (1997) 213-249
2. Arbab F. Abstract Behavior Types: A Foundation Model for Components and Their Composition. Formal Methods for Components and Objects. (FMCO 02). LNCS volume 2852 (2003) 339-360
3. Bastide R., and Barboni E. Software Components: A Formal Semantics Based on Coloured Petri Nets. Proceedings of the International Workshop on Formal Aspects of Component Software. (FACS 05). ENTCS (2005)
4. A. Basu, M. Bozga, and J. Sifakis. Modeling Heterogeneous Real-time Systems in BIP. In Proceedings of the Third IEEE Conference on Software Engineering and Formal Methods (SEFM 2006), pages 3-12, 2006
5. Baumeister H., Hacklinger F., Hennicker R., Knapp A., and Wirsing M. A Component Model for Architectural Programming. Proc. 2nd Int. Wsh. Formal Aspects of Component Software. (FACS 05). Elect. Notes Theo. Comp. Sci. 160 (2006) 75-96
6. M. Bozga, O.Constant, B. Josko, Q. Ma, and M. Skipper. SPEEDS metamodel syntax and static semantics, January 2007. Deliverable D2.1b
7. Broy M. Towards a Logical Basis of Software Engineering. In: Broy M., and Steinbrüggen R. (Eds). Calculational System Design. NATO ASI Series, Series F: Computer and System Sciences volume 158 (1999), IOS 101-131
8. Cheng A., Esparza J., and Palsberg J. Complexity Results for 1-safe Nets. Proceedings of Foundations of Software Technology and Theoretical Computer Science. (FSTTSC 93). LNCS volume 761 (1993) 326-337
9. Chouali S., Heisel M., and Souquières J. Proving Component Interoperability with B Refinement. Proc. 2nd Int. Wsh. Formal Aspects of Component Software. (FACS 05). Elect. Notes Theo. Comp. Sci. 160 (2006) 67-84
10. Luca de Alfaro and Thomas A. Henzinger. Interface Automata. In Proceedings of the Ninth Annual Symposium on Foundations of Software Engineering (FSE 01), pages 109-120, 2001
11. Gary M.R., and Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
12. Gössler G., Graf S., Majster-Cederbaum M., Martens M., and Sifakis J. An Approach to Modelling and Verification of Component Based Systems. Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science. (SOFSEM 07). LNCS volume 4362 (2007) 295-308
13. Gregor Gössler. Component-based Design of Heterogeneous Reactive Systems in Prometheus. Technical report 6057, INRIA, December 2006
14. Gössler G., Graf S., Majster-Cederbaum M., Martens M., and Sifakis J. Ensuring Properties of Interaction Systems. Program Analysis and Computation, Theory and Practice. LNCS volume 4444 (2007) 201-224
15. Gössler G., and Sifakis J. Component-based construction of Deadlock-free Systems. Proceedings of Foundations of Software Technology and Theoretical Computer Science. (FSTTCS 03). LNCS volume 2914 (2003) 420-433
16. Gössler G., and Sifakis J. Composition for Component-Based Modeling. Formal Methods for Components and Objects. (FMCO 02). LNCS volume 2852 (2003) 443-466
17. Gössler G., and Sifakis J. Priority Systems. Formal Methods for Components and Objects. (FMCO 03). LNCS (2004) 314-329
18. Gössler G., and Sifakis J. Composition for component-based modeling. Sci. Comput. Program. 55 1-3 (2005) 161-183
19. Graf S., and Quinton S. Contracts for BIP: Hierarchical Interaction Models for Compositional Verification. Proceedings of FORTE'07. LNCS volume 4574 (2007), Springer 1-18
20. Hardin R.H., Kurshan R.P., Shukla S.K., and Vardi M.Y. A New Heuristic for Bad Cycle Detection Using BDDs. Proceedings of CAV'97. LNCS volume 1254 (1997) 268-278
21. Inverardi P., and Uchitel S. Proving Deadlock Freedom in Component-Based Programming. Proceedings of the 4th International Conference on Fundamental Approaches to Software Engineering. (FASE 01). LNCS volume 2029 (2001) 60-75
22. Bernd J. Krämer, Heinz W. Schmidt, Iman H. Poernomo, and Ralf H. Reussner. Predictable Component Architectures Using Dependent Finite State Machines. In Radical Innovations of Software and Systems Engineering in the Future, 9th International Workshop (RISSEF 2002), pages 310-324, 2002
23. Lynch N.A., and Tuttle M.R. An Introduction to Input/Output Automata. CWI-Quarterly 2 3 (September 1989) 219-246
24. Majster-Cederbaum M., and Martens M. Robustness in Interaction Systems. Proceedings of the 27th International Conference on Formal Methods for Networked and Distributed Systems. (FORTE 07). LNCS volume 4574 (2007) 325-340
25. Majster-Cederbaum M., Martens M., and Minnameier C. A Polynomial-Time-Checkable Sufficient Condition for Deadlock-freeness of Component Based Systems. Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science. (SOFSEM 07). LNCS volume 4362 (2007) 888-899
26. M. Majster-Cederbaum and C. Minnameier. Deriving Complexity Results for Interaction Systems from 1-safe Petri Nets., 2007. Submitted for publication
27. Majster-Cederbaum M., Semmelrock N., and Wolf V. Interaction Models for Biochemical Reactions. Proceedings of BIOCOMP 07 (2007), CSREA Press
28. M. Martens, C. Minnameier, and M. Majster-Cederbaum. Deciding Liveness in Component-Based Systems is NP-hard. Technical report TR-2006-017, University of Mannheim, Fakultät Mathematik und Informatik, 2006. http://madoc.bib.unimannheim.de/madoc/portal/inst_inf/index.php
29. Moritz Martens. Liveness in Interaction Systems - An Application to the Problem of the Dining Philosophers., 2006. Nordic Workshop on Programming Theory 2006
30. Moritz Martens. Liveness in Interaction Systems. Technical report TR-2007-001, University of Mannheim, 2007. http://madoc.bib.uni-mannheim.de/madoc/portal/inst_inf/index.php
31. Moritz Martens. Using Interaction Systems to Model a Bank System, 2007. Internal Report
32. Minnameier C. Deadlock-Detection in Component-Based Systems is NP-hard. Information Processing Letters 3630 (2007)
33. Moschoyiannis S., and Shields M.W. Component-Based Design: Towards Guided Composition. Proceedings of Application of Concurrency to System Design. (ACSD'03) (2003), IEEE Computer Society 122-131
34. Nierstrasz O., and Achermann F. A Calculus for Modeling Software Components. Formal Methods for Components and Objects. (FMCO 02). LNCS volume 2852 (2003) 339-360
35. Plášil F., Bálek D., and Janeček R. SOFA/DCUP: Architecture for Component Trading and Dynamic Updating. CDS '98: Proceedings of the International Conference on Configurable Distributed Systems (1998), IEEE Computer Society, Washington, DC, USA 43
36. Reussner R.H., Schmidt H.W., and Poernomo I. Reliability Prediction for Component-Based Software Architectures. Journal of Systems and Software - Special Issue of Software Architecture - Engineering Quality Attributes 66 3 (2003)
37. Schmidt H.W. Compatibility of Interoperable Objects. In: Krämer B., Papazoglou M.P., and Schmidt H.W. (Eds). Information Systems Interoperability (1998), Research Studies Press
38. Schmidt H.W. Architecture-Based Reasoning About Performability in Component-Based Systems. Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science. (SOFSEM 07). LNCS volume 4362 (2007) 130-137
39. J. Sifakis. The Algebra of Connectors Structuring Interaction in BIP. In Proceedings of FMCO'07, LNCS. Springer, 2007. To appear
40. Joseph Sifakis. Modeling Real-time Systems. In IEEE Real-Time Symposium (RTSS04), pages 5-6, 2004
41. Joseph Sifakis. A Framework for Component-based Construction. In IEEE Conference on Software Engineering and Formal Methods (SEFM 05), pages 293-300, 2005