Validation of protocols with temporal constraints

Computer Communications

Volumn 19, Issue 14, 1996, Pages 1188-1199

  Cacciari, Leo ^a   Rafiq, Omar ^a  

^a UNIVERSITÉ DE PAU ET DES PAYS DE L'ADOUR   (France)

Author keywords

Communication properties; Protocols; Temporal communicating systems; Temporal constraints; Temporal reachability analysis; Transition models; Validation

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL LINGUISTICS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DATA COMMUNICATION SYSTEMS; GRAPH THEORY; SIGNAL INTERFERENCE; SPURIOUS SIGNAL NOISE;

COMMUNICATION PROPERTIES; TEMPORAL COMMUNICATING SYSTEMS; TEMPORAL CONSTRAINTS; TEMPORAL REACHABILITY ANALYSIS; TRANSITION MODELS; VALIDATION;

NETWORK PROTOCOLS;

EID: 0030365406     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(96)01153-X     Document Type: Article

References (19)

1. C.H. West, An automated technique of communications protocol validation, IEEE Trans. Comm., 26 (1978) 1271-1275.
2. D. Brand and P. Zafiropulo, On communicating finite state machines, J. ACM, 30 (1983) 361-371.
3. L. Cacciari and O. Rafiq, On improving reduced reachability analysis, Proc. 5th Int. Conf. on Formal Description Techniques (FORTE'92), North-Holland, 1993, pp. 137-152.
4. L. Cacciari and O. Rafiq, A temporal reachability analysis, Proc. 15th Int. Symp. on Protocol Specification, Testing and Verification (PSTV'95), Chapman & Hall, 1996.
5. D.L. Dill, Timing assumptions and verification of finite state concurrent systems, Proc. Workshop on Automatic Verification Methods for Finite State Systems, LNCS 407, Springer-Verlag, 1989, pp. 197-212.
6. C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, Technical Report 120, MIT, 1974.
7. P. Merlin and D.J. Faber, Recoverability of communication protocols, IEEE Trans. Comm., 24 (1976) 1036-1048.
8. B. Berthomieu and M. Diaz, Modeling and verification of time dependent systems using time Petri nets, IEEE Trans. Soft. Eng., 17 (1991) 259-273.
9. R. Alur and D.L. Dill, Automata for modelling real-time systems, Proc. ICALP'90, LNCS 443, Springer-Verlag, 1990, pp. 323-335.
10. R. Alur and D.L. Dill, A theory of timed automata, Theoretical Computer Science, 126 (1994) 183-235.
11. T.A. Henzinger, Z. Manna and A. Pnueli, Timed transition systems, Proc. REX Workshop, LNCS 600, Springer-Verlag, 1991, pp. 226-251.
12. A.C. Shaw, Communicating real-time state machines, IEEE Trans. Soft. Eng., 18 (1992) 805-816.
13. R. Alur and T.A. Henzinger, Logics and models of real-time: a survey, Proc. REX Workshop, LNCS 600, Springer-Verlag, 1991, pp. 74-106.
14. X. Nicollin and J. Sifakis, An overview and synthesis on timed process algebras, Proc. CAV'91, LNCS 575, Springer-Verlag, 1991, pp. 376-398.
15. G. Leduc and L. Léonard, A timed LOTOS supporting a dense time domain and including new timed operators, Proc. 5th Int. Conf. on Formal Description Techniques (FORTE'92), North-Holland, 1993, pp. 87-102.
16. J.P. Courtiat and R.C. de Oliveira, About time, nondeterminism and exception handling in a temporal extension of LOTOS, Proc. of 14th Int. Symp. on Protocol Specification, Testing and Verification (PSTV'94), Chapman & Hall, 1995, pp. 37-52.
17. G. von Bochmann and J. Vaucher, Adding performance aspects to specification languages, Proc. 8th Int. Symp. on Protocol Specification, Testing and Verification (PSTV'88), North-Holland, 1989, pp. 19-30.
18. F. Bausse and P. Buchholz, Protocol analysis using a timed version of SDL, Proc. 3rd Int. Conf. on Formal Description Techniques (FORTE'90), North-Holland, 1991, pp. 239-254.
19. B. Aspavall and Y. Shiloach, A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality, Proc. 20th Ann. Symp. on Foundation of Computer Science, IEEE, 1979, pp. 205-217.