Zur Kurzanzeige

dc.contributor.authorSpeck, Andreas
dc.contributor.authorWitt, Sören
dc.contributor.authorFeja, Sven
dc.contributor.editorHeiß, Hans-Ulrich
dc.contributor.editorPepper, Peter
dc.contributor.editorSchlingloff, Holger
dc.contributor.editorSchneider, Jörg
dc.date.accessioned2018-11-27T09:59:13Z
dc.date.available2018-11-27T09:59:13Z
dc.date.issued2011
dc.identifier.isbn978-88579-286-4
dc.identifier.issn1617-5468
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/18658
dc.description.abstractProtocols are formal models which may be used to define the interactions within processes. Moreover, protocols may be the base of process improvement e.g. by applying game theory. In the paper we focus on models of interactions between system components (which we name versions) and the possibilities to verify that the version systems fulfill the rules (specifications) of the protocols. First, we consider the static relationships between the versions as base. Second, we discuss the dynamic interactions between these versions and present a model checking-based approach to verify the interaction specifications of the protocols. Such verified interaction sequences (or processes) are a starting point of optimizations by game theory approaches.en
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofINFORMATIK 2011 – Informatik schafft Communities
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-192
dc.titleDescription of protocol rulesen
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages308-308
mci.conference.sessiontitleRegular Research Papers
mci.conference.locationBerlin
mci.conference.date4.-7. Oktober 2011


Dateien zu dieser Ressource

Thumbnail

Zur Kurzanzeige