Learning Communicating Automata from MSCs

This paper is concerned with bridging the gap between requirements and distributed systems. Requirements are defined as basic message sequence charts (MSCs) specifying positive and negative scenarios. Communicating finite-state machines (CFMs), i.e., finite automata that communicate via FIFO buffers...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on software engineering Jg. 36; H. 3; S. 390 - 408
Hauptverfasser:	Bollig, Benedikt, Katoen, Joost-Pieter, Kern, Carsten, Leucker, Martin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.05.2010 IEEE Computer Society Institute of Electrical and Electronics Engineers
Schlagworte:	Algorithms Artificial intelligence Automation Buffers Communicating Communication channels Communications networks Computer Science Computer Society computing methodologies/artificial intelligence/learning/induction Design engineering Design methodology Digital Object Identifier Feasibility Learning Learning automata Mathematical analysis Messages Optimization Optimization techniques Other Requirements Software design Software engineering software engineering/design/design concepts Software engineering/requirements/specifications/elicitation methods Studies System recovery theory of computation/computation by abstract devices/models of computation/automata Unified modeling language
ISSN:	0098-5589, 1939-3520
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!