Skip Navigation

The Computer Journal 2001 44(6):504-530; doi:10.1093/comjnl/44.6.504
© 2001 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Tsai, J. J. P.
Right arrow Articles by Juan, E. Y. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Modeling and Verification of High-Assurance Properties of Safety-Critical Systems

Jeffrey J. P. Tsai1 and Eric Y. T. Juan2

1 Department of Computer Science, University of Illinois at Chicago, 851 S. Morgan St., Chicago, IL 60607, USA Email: tsai@eecs.uic.edu 2 Department of Information and Computer Engineering, Chung Yuan Christian University, Chung Li, Taiwan

This paper presents a methodology to reduce the high analysis complexity in modeling and verifying high-assurance properties of safety-critical systems. Our new methodology includes a state-space construction mechanism, multiset labeled transition systems, two congruence theorems and a set of condensation rules for the analysis of deadlock states and reachable states. In the new state-space construction mechanism, the state space can hierarchically be generated and simplified for both synchronous and asynchronous processes. In our multiset labeled transition systems, several actions can be performed as an atomic instruction. Our congruence theorems and condensation ules are much more powerful than current compositional-verification techniques since the high interleaved behaviors of asynchronous as well as invisible actions can be eliminated efficiently. Our experimental results on the analysis of the deadlock property show a significant improvement on many systems such as asynchronous-communication models and resource-competition problems.

Received 9 November, 2000. Revised 23 April, 2001.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.