全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Synthesis of Petri Nets with Localities

Full-Text   Cite this paper   Add to My Lib

Abstract:

Automated synthesis from behavioural specifications is an attractiveway of constructing computational systems. In this paper, welook at a specific instance of this approach which aims at constructingGALS (globally asynchronous locally synchronous) systems. GALSsystems are represented by Petri nets with localities, each localitydefining a set of co-located actions, and specifications are given interms of transition systems with arcs labelled by steps of executed actions.The proposed synthesis procedures are based on the regions oftransition systems, and work without knowing which actions are to beco-located.We consider two basic classes of Petri nets, viz. Elementary NetSystem with Localities (ENL-system) and Place/Transition nets withlocalities (PTL-nets). In particular, we discuss ENL-systems wherethere is no conflict between events coming from different localities.In such a case, the synthesis problem reduces to checking just oneco-location relation. This result is then extended to PTL-nets.Keywords: concurrency, Petri nets, localities, GALS, net synthesis,step sequence semantics, transition systems, theory of regions, conflict.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133