Generating FSMs from Interworkings

L.M.G. Feijs

doi:10.1007/s004460050053

Generating FSMs from Interworkings

L.M.G. Feijs

Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

Abstract

A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (synchronous sequence charts) is described. This is useful for obtaining feedback from a set of scenarios during a system's definition phase or test phase. It is sound in the sense that the generated FSM only exhibits traces that correspond to one of the interworkings from the given set. It preserves deadlock freedom in the sense that no behaviours are lost. The concrete syntax of SDL is used to represent the resulting FSMs.

Original language	English
Pages (from-to)	31-40
Number of pages	10
Journal	Distributed Computing
Volume	12
Issue number	1
DOIs	https://doi.org/10.1007/s004460050053
Publication status	Published - 1999

Access to Document

10.1007/s004460050053

Cite this

@article{255b886bc43945bdb3a7486321565fa3,

title = "Generating FSMs from Interworkings",

abstract = "A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (synchronous sequence charts) is described. This is useful for obtaining feedback from a set of scenarios during a system's definition phase or test phase. It is sound in the sense that the generated FSM only exhibits traces that correspond to one of the interworkings from the given set. It preserves deadlock freedom in the sense that no behaviours are lost. The concrete syntax of SDL is used to represent the resulting FSMs.",

author = "L.M.G. Feijs",

year = "1999",

doi = "10.1007/s004460050053",

language = "English",

volume = "12",

pages = "31--40",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Generating FSMs from Interworkings

AU - Feijs, L.M.G.

PY - 1999

Y1 - 1999

N2 - A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (synchronous sequence charts) is described. This is useful for obtaining feedback from a set of scenarios during a system's definition phase or test phase. It is sound in the sense that the generated FSM only exhibits traces that correspond to one of the interworkings from the given set. It preserves deadlock freedom in the sense that no behaviours are lost. The concrete syntax of SDL is used to represent the resulting FSMs.

AB - A technique for the automated synthesis of FSMs (finite state machines) from sets of interworkings (synchronous sequence charts) is described. This is useful for obtaining feedback from a set of scenarios during a system's definition phase or test phase. It is sound in the sense that the generated FSM only exhibits traces that correspond to one of the interworkings from the given set. It preserves deadlock freedom in the sense that no behaviours are lost. The concrete syntax of SDL is used to represent the resulting FSMs.

U2 - 10.1007/s004460050053

DO - 10.1007/s004460050053

M3 - Article

SN - 0178-2770

VL - 12

SP - 31

EP - 40

JO - Distributed Computing

JF - Distributed Computing

IS - 1

ER -

Generating FSMs from Interworkings

Abstract

Access to Document

Fingerprint

Cite this