원문정보
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
With the wide application of probabilistic systems, the research of counterexample generation for probabilistic system with model checking has attracted wide attention. For counterexample of complex parametric system, proposes a counterexample generation algorithm for multiple until constraint formulae of probabilistic computation tree logic act on continuous time probabilistic model and gives another counterexample computation method based on automaton theory. At last, the example analysis is given. The theoretical analysis and example result show that the feasibility and validity of the method.
목차
Abstract
1. Introduction
2. Probability model
3. Temporal logic
4. Counterexample of until Constraint Path Formula
5. Automaton Computation Method
6. Example Analysis
7. Conclusion and Future Work
Acknowledgements
References
1. Introduction
2. Probability model
3. Temporal logic
4. Counterexample of until Constraint Path Formula
5. Automaton Computation Method
6. Example Analysis
7. Conclusion and Future Work
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보
