Preemptive Systems are systems whose tasks are timely constrained and which can be suspended for a while and resumed afterwards. In order to check for their reliability, formal methods are applied to model and to analyze their behaviors. This is achieved by computing their state spaces that can be abstracted and encoded as graphs. We present in this paper an algorithm allowing an efficient computation of a DBM over-approximation of the state space of preemptive systems modeled by using Time Petri Nets with inhibitor arcs. For this effect, each class of this graph is expressed as a pair (M, D), where M is a marking and D is the system of DBM inequalities. In [1] we have defined an algorithm to compute the system D straightforwardly in its normal form, without requiring computing the intermediary polyhedron. We explore for this abstraction a suitable equivalence relation that contracts yet more the graphs. Experimental results comparing our algorithm with other approaches are reported.
목차
Abstract 1. Introduction 2. Time Petri nets with Inhibitor Arcs 3. ITPN state space construction 4. Experimental Results 5. Conclusion References
키워드
Preemptive systemsTime Petri netsInhibitors arcsState class graphDBM.
보안공학연구지원센터(IJAST) [Science & Engineering Research Support Center, Republic of Korea(IJAST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Advanced Science and Technology
간기
월간
pISSN
2005-4238
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Advanced Science and Technology vol.27