Generating FSMs from interworkings

Distributed Computing

Volumn 12, Issue 1, 1999, Pages 31-40

  Feijs, L M G ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; FEEDBACK; FINITE AUTOMATA;

FINITE STATE MACHINES (FSM);

SEQUENTIAL MACHINES;

EID: 0033279664     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050053     Document Type: Article

References (26)

1. Baeten JCM, Mauw S: Delayed choice: an operator for joining message sequence charts. Computing Science Reports 94-35, Eindhoven University of Technoloy 1994
2. Baeten JCM, Weijland WP: Process algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990
3. Bergstra JA, Klop JW: Process algebra for synchronous communication. Infand Control 60:109-137 (1984)
4. Bierman AW, Baum RI, Petry FE: Speeding up the synthesis of programs from traces. IEEE Trans Comput C-24(2):122-136 (1975)
5. Brunekreef JJ: On modular algebraic protocol specification. PhD Thesis University of Amsterdam, ILLC dissertation series 1995-1, 1995
6. CCITT: Recommendation Z100, Specification and description language (SDL). Document APIX-35-E, International Telegraph and Telephone Consultative Committee, Geneva 1988
7. Clocksin WF, Mellish CS: Programming in Prolog. (2nd edn), Berlin Heidelberg New York: Springer 1984
8. Cockbum AAR, Citrin W, Hauser R, von Kanel J; Interactive prototyping of communication-intensive systems. In: Winkler S (ed) 1st Int Workshop Rapid System Prototyping. IEEE Comput Soc 1991, p 34
9. Drira K, Azema P: Verifying communication protocols via testing projection. In: Proc AMAST, 3d Int Conf Algebraic Methodology and Software Technology. 1993, pp 249-252
10. Feijs LMG: Generating FSMs from interworkings. Philips IST report RWB-510-re-95002, 1995
11. Feijs LMG: Generating FSMs from Interworkings. In: Ponse A, Verhoef C, Van Vlijmen S (eds) ACP'95, Computing Science Report 95/14. Eindhoven University of Technology 1995, pp 387-411
12. Ichikawa H, Itoh M, Shibasaki M: Protocol-oriented service specifications and their transformation into CCITT specification and description language. Transactions of the IECE of Japan E69(4):524-535 (1986)
13. Karjoth G: A LISP based LOTOS environment. In: Turner KJ (ed), Proceedings of the first international conference on Formal Description Techniques, pp 73-77. Amsterdam: Elsevier 1989
14. Karjoth G: A compilation of algebraic processes based on extended action derivation. In: Quemada J, Mañas J, Vázquez E (eds) FORTE '90, pp 127-140. Amsterdam: Elsevier 1990
15. Karjoth G: Dynamic state machines with multiway synchronisation, channels and shared variables. In: Danthine A, Leduc G, Wolper P (eds) Protocol Specification, Testing and Verification XIII (C-16). pp 61-76. Amsterdam: Elsevier 1993
16. Karjoth G: Generating transition graphs from LOTOS specifications. In: Diaz M, Groz R (eds), Formal Description Techniques V (C-10). pp 281-294. Amsterdam: Elsevier 1993
17. Klop JW: Term rewriting systems. CWI report CS-R9073, Centre for Mathematics and Computer Science, Amsterdam 1990
18. Ladkin P, Leue S: Interpreting Message Flow Graphs. Formal Aspects of Computing 7(5):473-509 (1995)
19. Leue S, Ladkin P: Implementing and Verifying Message Sequence Chart Specifications Using Promela/XSpin. To appear in the Proceedings of the 2nd SPIN Workshop, Rutgers, NJ, DIMACS Series, American Mathematical Society Press 1996
20. Mauw S, Van Wijk M, Winter T: A formal semantics of synchronous interworkings. In: Færgemand O and Sarma A (eds) SDL'93 using objects, pp 167-178. Amsterdam: Elsevier 1993
21. Milner R: Calculus of communicating processes. LNCS 92. Berlin Heidelberg New York: Springer 1980
22. Rudolph E, Graubmann P, Grabowski J: Towards an SDL design methodology using sequence chart segments. In: Færgemand Oand Reed R (eds) SDL '91, evolving methods, pp 237-252. Amsterdam: Elsevier 1991
23. Saracco R, Smith JRW, Reed R: Telecommunications systems engineering using SDL. Amsterdam: Elsevier 1989
24. Smith DC, Cypher A, Spohrer J: KidSim: programming agents without a programming language. CACM 37(7):55-67 (1994)
25. van Vlijmen SFM, van Waveren A: On generating synchronous interworkings from PSF process traces. University of Amsterdam technical report P9304 (1993)
26. Walters HR: On equal terms, implementing algebraic specifications. PhD thesis, University of Amsterdam 1991