Programming in Prolog (2nd ed.)
Programming in Prolog (2nd ed.)
Process algebra
KidSim: programming agents without a programming language
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Telecommunications Systems Engineering Using SDL
Telecommunications Systems Engineering Using SDL
Dynamic State Machines with Multiway Synchronization, Channels and Shared Variables
Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Verifying Communication Protocols Via Testing-Projection
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
A LISP-Based LOTOS Environment
Proceedings of the First International Conference on Formal Description Techniques
A Compilation of Algebraic Processes Based on Extended-Action Derivation
FORTE '90 Proceedings of the IFIP TC6/WG6.1 Third International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, III
Generating transition graphs from LOTOS specifications
FORTE '92 Proceedings of the IFIP TC6/WG6.1 Fifth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, V
A hierarchy of communication models for message sequence charts
Science of Computer Programming
Dealing with non-local choice in IEEE 1073.2's standard for remote control
SAM'04 Proceedings of the 4th international SDL and MSC conference on System Analysis and Modeling
| Hi-index | 0.00 |
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.