The paper presents a concurrency model, called behavior machine, to describe concurrent systems in a finite representation of recursive behavior and free of interleaving. Thus, the new model alleviates the state explosion problem. After introducing the notion of a behavior machine, the paper shows how a behavior machine can be constructed from a set of communicating finite state machines using the theory of Petri net unfoldings. The concurrency model is finally applied to support test suite derivation for concurrent systems.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- A description model to support test suite derivation for concurrent systems
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA