Security and Consistency of IT and Business Models at Credit Suisse realized by Graph Constraints, Transformation and Integration using Algebraic Graph Theory

Brandt, Christoph; Hermann, Frank; Engel, Thomas

doi:10.1007/978-3-642-01862-6_28

Reference : Security and Consistency of IT and Business Models at Credit Suisse realized by Graph...


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/5604

Title :	Security and Consistency of IT and Business Models at Credit Suisse realized by Graph Constraints, Transformation and Integration using Algebraic Graph Theory
Language :	English
Author, co-author :	Brandt, Christoph [> >]
	Hermann, Frank [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Engel, Thomas [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2009
Main document title :	Proc. Int. Conf. on Exploring Modeling Methods in Systems Analysis and Design 2009 (EMMSAD'09)
Publisher :	Springer Verlag
Collection and collection volume :	Vol. 29 of Lecture Notes in Business Information Processing (LNBIP)
Pages :	339-352
Peer reviewed :	Yes
City :	Heidelberg
Event name :	Int. Conf. on Exploring Modeling Methods in Systems Analysis and Design 2009 (EMMSAD'09)
Event date :	2009
Abstract :	[en] This paper shows typical security and consistency challenges regarding the models of the business and the IT universe of the dynamic service-, process- and rule-based environment at Credit Suisse. It presents a theoretical solution for enterprise engineering that is implementable, and fits smoothly with the daily needs and constraints of the people in the scenario. It further enables decentralized modeling based on cognitive and mathematical or logical concepts. Normative aspects of the models are analyzed by graph constraint checks, while consistency is checked and ensured by model integration and transformation. To cope with theoretical and practical necessities, the presented solution is kept sound and usable as well as extensible and scalable. All techniques are based on one theoretical framework: algebraic graph theory. Therefore, the techniques are compatible with each other.
Permalink :	http://hdl.handle.net/10993/5604
DOI :	10.1007/978-3-642-01862-6_28
Other URL :	http://dx.doi.org/10.1007/978-3-642-01862-6_28

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	10.1007_978-3-642-01862-6_28.pdf		Publisher postprint	535.21 kB	Request a copy

All documents in ORBi^lu are protected by a user license.

University of Luxembourg Library | Feedback | Legal notices