Eliminating queues from RT UML model representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2469, Issue , 2002, Pages 375-393

  Damm, Werner ^a,b   Jonsson, Bengt ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Protocol verification; Real time distributed systems; RT UML; Verification of infinite state systems

Indexed keywords

DISTRIBUTED DATABASE SYSTEMS; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; UNIFIED MODELING LANGUAGE;

AUTOMATIC VERIFICATION; DISTRIBUTED REAL TIME SYSTEM; EVENT BASED COMMUNICATION; PROTOCOL VERIFICATION; REAL TIME DISTRIBUTED SYSTEMS; RT UML; SYNCHRONOUS OPERATIONS; VERIFICATION OF INFINITE-STATE SYSTEMS;

REAL TIME SYSTEMS;

EID: 84974694545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45739-9_22     Document Type: Conference Paper

References (15)

1. Euro-Interlocking Requirements, September 2001, see www.eurolock.org
2. W. Damm and J. Klose. Verification of a Radio-based Signaling System Using the Statemate Verification Environment. Formal Methods in System Design, Vol 19(2), 2001.
3. D. Harel and E. Gery. Executable Object Modelling with Statecharts. IEEE Computer, July 1997, 31-42
4. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 2(5): 323--342, April 1983.
5. A.P. Sistla and L.D. Zuck. Automatic temporal verification of buffer systems. in Larsen and Skou, editors, Proc.3rd Int. Conf. on Computer Aided Verification, volume 575 of Lecture Notes in Computer Science, Springer Verlag, 1991.
6. M.G. Gouda, E.M. Gurari, T.-H. Lai, and L.E. Rosier. On deadlock detection in systems of communicating finite state machines. Computers and Artificial Intelligence, 6(3): 209-228, 1987.
7. J.K. Pachl. Protocol description and analysis based on a state transition model with channel expressions. In Protocol Specification, Testing, and Verification VII, May 1987.
8. P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 305-318, 1998.
9. W. Peng and S. Purushothaman. Data flow analysis of communicating finite state machines. ACM Trans. on Progr. Languages and Systems 13(3): 399-442, July 1991.
10. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite statespaces using QDDs. In Alur and Henzinger, editors, Proc. 8th Int. Conf. on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, 1996.
11. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. 4th Int. Static Analysis Symposium, Lecture Notes in Computer Science. Springer Verlag, 1997.
12. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFO channel systems with nonregular sets of configurations. in Proc. ICALP 97, volume 1256 of Lecture Notes in Computer Science, 1997.
13. P.A. Abdulla and B. Jonsson. Channel representations in protocol verification. in Proc. CONCUR 2001, 12th int. Conf. on Concurrency Theory, volume 2154 of Lecture Notes in Computer Science, pages 1-15, 2001.
14. B. Westphal Exploiting Object Symmetry in Verification of UML-Designs, Diplomarbeit, Carl von Ossietzky Universität, 2001
15. W. Damm and A. Pnueli. An Active Object Model. Technical Report, OFFIS, Oldenburg, FRG, 2002.