canonical transition set semantics for petri nets

	canonical transition set semantics for petri nets
	Wang Yunhe; Jiao Li
	2010
会议名称	31st International Conference on Appliations and Theory of Petri Nets and Other Models of Concurrency
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	84-103
会议日期	JUN 21-25,
会议地点	Braga, PORTUGAL
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS
ISSN	0302-9743
ISBN	978-3-642-13674-0
部门归属	Wang, Yunhe; Jiao, Li Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China.
摘要	A new partial order semantics called canonical transition set (CTS for short) semantics is proposed for P/T nets. We first prove that it is well-defined, sound and complete, and then give a state space exploring method based on it. CTS semantics provides a compressed representation for the interleaving transition sequences of finite length. Compared with other methods, the state space exploration based on CTS semantics can avoid many redundant branches and reach all states in less steps. Furthermore, we show that CTS semantics coincides with step semantics in Foata normal form 8 for pure 1-safe nets, which gives an experimental support that CTS semantics is more efficient for state space exploration. As for a special property, deadlock, we show that all deadlocks can be detected by a method combining CTS semantics with persistent set method.
关键词	Petri Nets Partial Order Reduction Canonical Transition Set Semantics State Space Exploration Step Semantics
主办者	Inst Polytecn Beja
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/8684
专题	基础软件与系统重点实验室
推荐引用方式 GB/T 7714	Wang Yunhe,Jiao Li. canonical transition set semantics for petri nets[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:APPLICATIONS AND THEORY OF PETRI NETS, PROCEEDINGS,2010:84-103.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
canonical transition（306KB）			开放获取	--	请求全文