Eliminating Queues from RT UML Model Representations

作者: Werner Damm , Bengt Jonsson

DOI: 10.1007/3-540-45739-9_22

关键词:

摘要: This paper concerns analyzing UML based models of distributed real time systems involving multiple active agents. In order to avoid the time-penalties incurred by execution synchronous operation calls, it is typically recommended restrict inter-task communication event-based through unbounded FIFO buffers. means that such potentially have an infinite number states, making them out reach for analysis techniques intended finite-state systems. We present a symbolic technique systems, which can be tuned give finite, possibly inexact representation state-space. The central idea eliminate buffers completely, and represent their contents implicitly, effect on receiving agent. propose natural class protocols we call mode separated, this both finite exact. result has impact responsiveness predictability end-to-end latencies, as well protocol verification, enabling automatic verification methods applied.

参考文章(15)
Bernard Boigelot, Patrice Godefroid, Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) computer aided verification. ,vol. 1102, pp. 1- 12 ,(1996) , 10.1007/3-540-61474-5_53
Patrice Godefroid, Bernard Boigelot, Bernard Willems, Pierre Wolper, The Power of QDDs Lecture Notes in Computer Science. ,vol. 1302, pp. 172- 186 ,(1997)
Bernard Boigelot, Patrice Godefroid, Bernard Willems, Pierre Wolper, The Power of QDDs (Extended Abstract) static analysis symposium. pp. 172- 186 ,(1997) , 10.1007/BFB0032741
A. Prasad Sistla, Lenore D. Zuck, Automatic Temporal Verification of Buffer Systems computer aided verification. pp. 59- 69 ,(1991) , 10.1007/3-540-55179-4_7
Parosh Aziz Abdulla, Bengt Jonsson, Channel Representations in Protocol Verification international conference on concurrency theory. pp. 1- 15 ,(2001) , 10.1007/3-540-44685-0_1
Ahmed Bouajjani, Peter Habermehl, Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract) international colloquium on automata languages and programming. ,vol. 221, pp. 560- 570 ,(1997) , 10.1007/3-540-63165-8_211
Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, None, On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels computer aided verification. ,vol. 1427, pp. 305- 318 ,(1998) , 10.1007/BFB0028754
Louis E. Rosier, Mohamed G. Gouda, T. Lai, E. M. Gurari, On deadlock detection in systems of communicating finite state machines Computing and Informatics \/ Computers and Artificial Intelligence. ,vol. 6, pp. 209- 228 ,(1987)
Bernard Boigelot, Patrice Godefroid, Symbolic Verification of Communication Protocols with Infinite StateSpaces using QDDs formal methods. ,vol. 14, pp. 237- 255 ,(1999) , 10.1023/A:1008719024240