Description of protocol rules
| dc.contributor.author | Speck, Andreas | |
| dc.contributor.author | Witt, Sören | |
| dc.contributor.author | Feja, Sven | |
| dc.contributor.editor | Heiß, Hans-Ulrich | |
| dc.contributor.editor | Pepper, Peter | |
| dc.contributor.editor | Schlingloff, Holger | |
| dc.contributor.editor | Schneider, Jörg | |
| dc.date.accessioned | 2018-11-27T09:59:13Z | |
| dc.date.available | 2018-11-27T09:59:13Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | Protocols 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.identifier.isbn | 978-88579-286-4 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/18658 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | INFORMATIK 2011 – Informatik schafft Communities | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-192 | |
| dc.title | Description of protocol rules | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 308 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 308 | |
| gi.conference.date | 4.-7. Oktober 2011 | |
| gi.conference.location | Berlin | |
| gi.conference.sessiontitle | Regular Research Papers |
Dateien
Originalbündel
1 - 1 von 1