Abstract
Because of their self-x properties Organic Computing systems are hard to verify. Nevertheless in safety critical domains one may want to give behavioral guarantees. One technique to reduce complexity of the overall verification task is applying composition theorem. In this paper we present a technique for formal specification and compositional verification of Organic Computing systems. Separation of self-x and functional behavior has amongst others, advantages for the formal specification. We present how the specification of self-x behavior can be integrated into an approach for compositional verification of concurrent systems, based on Interval Temporal Logic. The presented approach has full tool support with the KIV interactive theorem prover.
This work is partly sponsored by the German Research Foundation (DFG) in the special priority program SPP 1183 “Organic Computing”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Lamport, L.: Conjoining specifications. ACM Trans. Program. Lang. Syst. 17(3), 507–535 (1995)
Alpern, B., Schneider, F.B.: Recognizing safety and liveness. Distributed Computing 2(3) (1987)
MohammadReza, M.: PobSAM: Policy-based managing of actors in self-adaptive systems. ENTCS. Elsevier Science B.V., Eindhoven (2009)
Balser, M.: Verifying Concurrent System with Symbolic Execution – Temporal Reasoning is Symbolic Execution with a Little Induction. PhD thesis, University of Augsburg, Germany (2005)
Balser, M., Reif, W., Schellhorn, G., Stenzel, K.: KIV 3.0 for Provably Correct Systems. In: Hutter, D., Traverso, P. (eds.) FM-Trends 1998. LNCS, vol. 1641, pp. 330–337. Springer, Heidelberg (1999)
Bäumler, S., Balser, M., Nafz, F., Reif, W., Schellhorn, G.: Interactive verification of concurrent systems using symbolic execution. AI Communications 23(2-3), 285–307 (2010)
Bäumler, S., Nafz, F., Balser, M., Reif, W.: Compositional proofs with symbolic execution. Ceur Workshop Proceedings, vol. 372 (2008)
Brazier, F.M.T., Cornelissen, F., Gustavsson, R., Jonker, C.M., Lindeberg, O., Polak, B., Treur, J.: Compositional verification of a multi-agent system for one-to-many negotiation. Applied Intelligence 20(2), 95–117 (2004)
Cau, A., Moszkowski, B., Zedan, H.: ITL – Interval Temporal Logic. Software Technology Research Laboratory, SERCentre, De Montfort University, The Gateway, Leicester LE1 9BH, UK (2002), http://www.cse.dmu.ac.uk/STRL/ITL/
Cau, A., Collette, P.: Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency. Acta Inf. 33(2), 153–176 (1996)
Cheng, B.H.C., Giese, H., Inverardi, P., Magee, J., de Lemos, R.: 08031 – software engineering for self-adaptive systems: A research road map. In: Software Engineering for Self-Adaptive Systems (2008)
Engelfriet, J., Jonker, C.M., Treur, J.: Compositional verification of multi-agent systems in temporal multi-epistemic logic. In: Rao, A.S., Singh, M.P., Müller, J.P. (eds.) ATAL 1998. LNCS (LNAI), vol. 1555, pp. 177–193. Springer, Heidelberg (1999)
Fisher, M., Wooldridge, M.: On the formal specification and verification of multi-agent systems. Int. J. Cooperative Inf. Syst. 6(1), 37–66 (1997)
Güdemann, M., Nafz, F., Ortmeier, F., Seebach, H., Reif, W.: A specification and construction paradigm for Organic Computing systems, pp. 233–242. IEEE Computer Society Press, Los Alamitos (2008)
Güdemann, M., Ortmeier, F., Reif, W.: Formal modeling and verification of systems with self-x properties. In: Yang, L.T., et al. (eds.) ATC 2006. LNCS, vol. 4158, pp. 38–47. Springer, Heidelberg (2006)
Harel, D.: Dynamic logic. In: Gabbay, D., Guenther, F. (eds.) Handbook of Philosophical Logic, vol. 2, pp. 496–604. Reidel, Dordrechtz (1984)
Heisel, M., Reif, W., Stephan, W.: A Dynamic Logic for Program Verification. In: Meyer, A.R., Taitslin, M.A. (eds.) Logic at Botik 1989. LNCS, vol. 363, pp. 134–145. Springer, Heidelberg (1989)
Jones, C.B.: Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst. 5(4), 596–619 (1983)
Jonker, C.M., Treur, J.: Compositional verification of multi-agent systems: a formal analysis of pro-activeness and reactiveness. In: International Journal of Cooperative Information Systems, pp. 51–92. Springer, Heidelberg (1998)
King, J.C.: Symbolic execution and program testing. Commun. ACM 19(7), 385–394 (1976)
Manna, Z., Pnueli, A.: Temporal verification diagrams. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol. 789, pp. 726–765. Springer, Heidelberg (1994)
Misra, J., Mani Chandi, K.: Proofs of networks of processes. IEEE Transactions of Software Engineering (1981)
Moszkowski, B.: Executing Temporal Logic Programs. Cambridge University Press, Cambridge (1986)
Müller-Schloer, C., von der Malsburg, C., Würtz, R.P.: Organic computing. Informatik Spektrum 27(4), 332–336 (2004)
Nafz, F., Ortmeier, F., Seebach, H., Steghöfer, J.-P., Reif, W.: A Universal Self-Organization Mechanism for Role-Based Organic Computing Systems. In: González Nieto, J., Reif, W., Wang, G., Indulska, J. (eds.) ATC 2009. LNCS, vol. 5586, pp. 17–31. Springer, Heidelberg (2009)
Seebach, H., Nafz, F., Steghöfer, J.-P., Reif, W.: A software engineering guideline for self-organizing resource-flow systems. In: Proceedings of IEEE SASO 2010, IEEE Computer Society Press, Los Alamitos (2010)
Smith, G., Sanders, J.W.: Formal development of self-organising systems, pp. 90–104. Springer, Heidelberg (2009)
Solanki, M., Cau, A., Zedan, H.: Augmenting semantic web service descriptions with compositional specification. In: Feldman, S.I., Uretsky, M., Najork, M., Wills, C.E. (eds.) Proc. of 13th int. conference on World Wide Web, pp. 544–552. ACM, New York (2004)
Vassev, E., Paquet, J.: Assl - autonomic system specification language. In: Software Engineering Workshop, Annual IEEE/NASA Goddard, pp. 300–309 (2007)
Wooldridge, M., Dunne, P.E.: The computational complexity of agent verification (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nafz, F., Seebach, H., Steghöfer, JP., Bäumler, S., Reif, W. (2010). A Formal Framework for Compositional Verification of Organic Computing Systems. In: Xie, B., Branke, J., Sadjadi, S.M., Zhang, D., Zhou, X. (eds) Autonomic and Trusted Computing. ATC 2010. Lecture Notes in Computer Science, vol 6407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16576-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-16576-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16575-7
Online ISBN: 978-3-642-16576-4
eBook Packages: Computer ScienceComputer Science (R0)