on detecting regular predicates in distributed systems

ISCAS OpenIR > 2009年期刊/会议论文

	on detecting regular predicates in distributed systems
	Huang Hongtao
	2009
会议名称	7th International Symposium on Automated Technology for Verification and Analysis
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	397-411
会议日期	OCT 13-16,
会议地点	Macao, PEOPLES R CHINA
收录类别	istp,ei,acm
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS
ISSN	0302-9743
ISBN	978-3-642-04760-2
部门归属	Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China.
摘要	Given a distributed computation and a predicate, detection of the predicate in Definitely modality means checking whether in every path from the least state to the greatest state in the state space generated from the computation, there exists a state satisfying the predicate. It is well known that the state space is a lattice. The regular predicate is a class of predicates. All the states satisfying a regular predicate form a sublattice of the lattice. In this paper, we prove that detection of a regular predicate in Definitely modality is coNP-complete.
主办者	United Natl Univ, Int Inst Software Technol, Macao Post, Macao Polytech Inst, Formal Methods Europe
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8294
专题	2009年期刊/会议论文
推荐引用方式 GB/T 7714	Huang Hongtao. on detecting regular predicates in distributed systems[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, PROCEEDINGS,2009:397-411.