Towards a bisimulation theory for open synchronized networks of automata

作     者：Eric MADELAINE Min ZHANG 

作者机构：INRIA 2004 rte des Lucioles Shanghai Key Laboratory of Trustworthy Computing MOE IntalJoint Laboratory of Trustworthy SoftwareECNU 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2016年第59卷第5期

页      面：21-23页

核心收录：

学科分类：0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 081202[工学-计算机软件与理论] 

主　　题：Towards a bisimulation theory for open synchronized networks of automata 

摘      要：Dear editor,Open parameterised Networks of synchronized automata(p Nets)are new semantic objects that we propose for defining the semantics of simple or complex composition operators for distributed *** p Nets have an operational semantics,using open transitions that include symbolic hypotheses on the behavior of the p Netsholes.We discuss when this semantics can be finite and how to compute it *** define bisimulation equivalences between open p Nets,and we explore under which hypotheses these equivalences are compatible with composition and are decidable.