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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on software engineering Ročník 36; číslo 3; s. 390 - 408
Hlavní autoři:	Bollig, Benedikt, Katoen, Joost-Pieter, Kern, Carsten, Leucker, Martin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.05.2010 IEEE Computer Society Institute of Electrical and Electronics Engineers
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!