핵심 개념
펼침을 이용한 부분 순서 확인의 새로운 방법 제안
초록
이 논문은 펼침을 이용한 부분 순서 확인에 대한 새로운 방법을 제안하고, 선형 시간 속성을 검증하는 방법을 소개합니다. PDNet을 활용한 펼침 생성과 탐색을 통해 LTL 속성을 확인하는 방법을 제시하며, 이를 통해 기존의 펼침 생성의 한계를 극복하고 성능을 향상시킬 수 있습니다.
PDNet Synchronization for LTL
B¨uchi PDNet product N¬ψ is synchronized with PDNet N to verify LTL properties.
Observable places are determined based on LTL propositions.
Visible transitions are defined to preserve concurrency in synchronization.
PDNet Unfolding
Unfolding preserves true-concurrency semantics of Petri nets.
Configuration and cut concepts are introduced to describe behavior.
Cut-off events are identified to terminate unfolding process efficiently.
Partial-Order Checking with Unfolding
Exploration tree is defined to guide PDNet unfolding and avoid exhaustive event combinations.
Conflict transitions are identified to handle dependencies between actions.
New method proposed to verify LTL properties for concurrent programs.
통계
펼침 생성은 NP-complete 문제를 해결해야 함
PDNet을 이용한 새로운 방법 제안
LTL 속성을 확인하기 위한 B¨uchi PDNet product 동기화
인용구
"Our exploration tree can help avoid the enumeration of all possible concurrent event combinations of traditional unfolding generation."
"Conflict transitions are identified to handle dependencies between actions."