中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
handling synchronization problem in petri net-based system design by property-preserving transition-reduction

文献类型:期刊论文

作者Jiao L ; Cheung TY ; Lu WM
刊名COMPUTER JOURNAL
出版日期2005
卷号48期号:6页码:692-701
关键词Flexible manufacturing systems Mathematical models Matrix algebra Set theory Synchronization
ISSN号0010-4620
学科主题Computer Science, Hardware & Architecture; Computer Science, Information Systems; Computer Science, Software Engineering
收录类别SCI ; ACM ; EI
语种英语
公开日期2011-07-28
附注Synchronizations frequently occur in the modeling and design of distributed and concurrent systems. Designing a correct system from subsystems by considering the synchronizations of events is a difficult and complex task because it often destroys some desirable properties of subsystems and induces the whole system deadlocks. This paper formulates a property-preserving transition-reduction transformation to handle the synchronization problem in Petri net-based system design. It starts by designing correct subsystems without taking transition-reduction consideration. Synchronizations are then introduced by merging transitions of subsystems. Depending on the structure of transitions, two classes of transition-reductions are investigated. For each class, this paper shows that many structural and behavior properties can be preserved.
源URL[http://124.16.136.157/handle/311060/12488]  
专题软件研究所_软件所图书馆_期刊论文
推荐引用方式
GB/T 7714
Jiao L,Cheung TY,Lu WM. handling synchronization problem in petri net-based system design by property-preserving transition-reduction[J]. COMPUTER JOURNAL,2005,48(6):692-701.
APA Jiao L,Cheung TY,&Lu WM.(2005).handling synchronization problem in petri net-based system design by property-preserving transition-reduction.COMPUTER JOURNAL,48(6),692-701.
MLA Jiao L,et al."handling synchronization problem in petri net-based system design by property-preserving transition-reduction".COMPUTER JOURNAL 48.6(2005):692-701.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。