Symbolic Model Checking of Finite Precision Timed Automata

Yan, Rong; Li, Guangyuan; Tang, Zhongfeng

doi:10.1007/11560647_18

Cited by 2 publications

(4 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, we also presented another formal semantics for Timed Automata (TA), which is a formal model of real-time systems, by combining its continuous semantics with discrete semantics [23]. The new formalism is called Finite Precision Timed Automata (FPTA).…”

Section: Real-time and Hybrid Systemsmentioning

confidence: 99%

Basic research in computer science and software engineering at SKLCS

Zhang

Zhan

et al. 2008

Front. Comput. Sci. China

View full text Add to dashboard Cite

The State Key Laboratory of Computer Science (SKLCS) is committed to basic research in computer science and software engineering. The research topics of the laboratory include: concurrency theory, theory and algorithms for real-time systems, formal specifications based on context-free grammars, semantics of programming languages, model checking, automated reasoning, logic programming, software testing, software process improvement, middleware technology, parallel algorithms and parallel software, computer graphics and human-computer interaction. This paper describes these topics in some detail and summarizes some results obtained in recent years.

show abstract

Section: Real-time and Hybrid Systemsmentioning

confidence: 99%

Basic research in computer science and software engineering at SKLCS

Zhang

Zhan

et al. 2008

Front. Comput. Sci. China

View full text Add to dashboard Cite

show abstract

“…Based on the symbolic representation for integer clock valuations in [17], we apply the symbolic method to record the reachable configurations of CTAs during the verification process. Meanwhile, we use BDD to record the symbolic sets to increase the data sharing and reduce the memory consumption.…”

Section: Reachability Analysis For Ctasmentioning

confidence: 99%

“…Timed automata (TAs) [1] provide a formal framework for the automatic analysis and verification of real-time systems, and in the past few years several tools for the model checking of TAs have been developed and used, including Uppaal [13], Kronos [8], Red [16], Rabbit [6] and FPTA [17], which have implemented the computation for the set of all reachable configurations by reachability analysis. However, the exploding increase of time consumption for the computation and memory consumption for the representation of the reachable configurations is still a main problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improvements for the Symbolic Verification of Timed Automata

Yan

Zhang

et al. 2007

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Based on the equivalence relation for location based reachability between continuous and integer semantics of closed timed automata, Beyer et al. have implemented the verifier Rabbit, with the uniform representation of reachable configurations. However, the growth of maximal constant of clock variables will decline the performance of Rabbit. The paper proposes an improved symbolic method, using binary decision diagrams (BDDs) to store the symbolic representation of discretized states, for the verification of timed systems. Compared with Rabbit, experiments demonstrate that besides the memory reduction, our implementation is also less sensitive to the size of clock domain.

show abstract

Symbolic Model Checking of Finite Precision Timed Automata

Cited by 2 publications

References 23 publications

Basic research in computer science and software engineering at SKLCS

Basic research in computer science and software engineering at SKLCS

Improvements for the Symbolic Verification of Timed Automata

Contact Info

Product

Resources

About