Portable call agent: A model for rapid development and emulation of network services

Bell Labs Technical Journal

Volumn 12, Issue 4, 2008, Pages 159-172

  Viswanathan, Ramesh ^a   Wood, Thomas L ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; GRAPHIC METHODS; TELECOMMUNICATION SERVICES; VOICE/DATA COMMUNICATION SYSTEMS; WELL TESTING;

COMPUTATIONAL PARADIGM; DATA FLOW LANGUAGE; HIGH-LEVEL PROGRAMMING; INTERACTIVE SYSTEM; LABELED TRANSITIONS; LUCENT TECHNOLOGIES; NETWORK SERVICES; VOICE OVER INTERNET PROTOCOL;

FLOW GRAPHS;

EID: 52649150783     PISSN: 10897089     EISSN: 15387305     Source Type: Journal    
DOI: 10.1002/bltj.20273     Document Type: Article

References (18)

1. R. Alur and D. L. Dill, "A Theory of Timed Automata," Theoret. Comput. Sci., 126:2 (1994), 183-235.
2. R. Alur and P. Madhusudan, "Decision Problems for Timed Automata: A Survey," Proc. 4th Internat. School on Formal Methods for Design of Comput., Commun. and Software Systems: Real Time (SFM-RT '04) (Bertinoro, It., 2004), pp. 1-24.
3. G. Berry, "Real Time Programming: Special Purpose or General Purpose Languages," Information Processing 89 (G. X. Ritter, ed.), Elsevier Science, North-Holland, Amsterdam, 1989, pp. 11-18.
4. G. Berry and G. Gonthier, "The ESTEREL Synchronous Programming Language: Design, Semantics, and Implementation," Sci. Comput. Programming, 19:2 (1992), 87-152.
5. G. Berry and R. Sethi, "From Regular Expressions to Deterministic Automata," Theoret. Comput. Sci., 48:1 (1986), 117-126.
6. J. A. Brzozowski, "Derivatives of Regular Expressions," J. ACM, 11:4 (1964), 481-494.
7. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, "The Synchronous Data Flow Programming Language LUSTRE," Proc. IEEE, 79:9 (1991), 1305-1320.
8. D. Harel, "Statecharts: A Visual Formalism for Complex Systems," Sci. Comput. Programming, 8:3 (1987), 231-274.
9. M. Hennessy, Algebraic Theory of Processes, MIT Press, Cambridge, MA, 1988.
10. G. J. Holzmann, The SPIN Model Checker: Primer and Reference Manual, Addison-Wesley, Boston, MA, 2003.
11. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
12. P. Le Guernic, T. Gautier, M. Le Borgne, and C. Le Maire, "Programming Real-Time Applications with SIGNAL," Proc. IEEE, 79:9 (1991), 1321-1336.
13. P. J. McCann and S. Chandra, "Packet Types: Abstract Specification of Network Protocol Messages," SIGCOMM Comput. Commun. Rev., 30:4 (2000), 321-333.
14. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
15. R. Milner, J. Parrow, and D. Walker, "A Calculus of Mobile Processes, Part I," Inform. and Comput., 100:1 (1992), 1-40.
16. R. Milner, J. Parrow, and D. Walker, "A Calculus of Mobile Processes, Pan II," Inform. and Comput., 100:1 (1992), 41-77.
17. P. Odifreddi, Classical Recursion Theory, Studies in Logic and the Foundations of Mathematics, Vol. 125, North-Holland, Amsterdam, 1992.
18. P. G. Whiting and R. S. V. Pascoe, "A History of Data-Flow Languages," IEEE Ann. Hist. Comput., 16:4 (1994), 38-59.