Compatibility Between Shared Variable Valuations in Timed Automaton Network Model-Checking

Authors:
Zhao Jianhua;Zhou Xiuyi;Li Xuandong;Zheng Guoliang
Affiliations:
Nanjing University, Jiangsu, P.R. China;Nanjing University, Jiangsu, P.R. China;Nanjing University, Jiangsu, P.R. China;Nanjing University, Jiangsu, P.R. China
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03
Year:
2005

Citing 8
Cited 0

Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
The tool KRONOS

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking

Symbolic Model Checking
An improvement in formal verification

Proceedings of the 7th IFIP WG6.1 International Conference on Formal Description Techniques VII
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many real-time systems are modelled as timed automaton networks, which are parallel compositions of timed automata. Those timed automata interact with each other through shared variables and/or communication channels. In the literate, symbolic states with different shared variable valuations are treated as distinct ones. This paper presents a compatibility relation between shared variable valuations. Using this relation, the reachability analysis algorithm can avoid exploring all the states with different shared variable valuations. An algorithm is presented in this paper to detect compatible shared variable valuations. A compact data structure is also proposed to record the shared variable valuation sets found by this algorithm. Based on these results, an optimized reachability analysis algorithm is presented. Case studies show that our technique improves the space-efficiency of reachability analysis significantly.