Towards a bisimulation theory for open synchronized networks of automata

  • Eric Madelaine
  • Min Zhang
Insight Special Focus on Advanced Technology of Software




本文为分布式语言提出一个表达能力较强的模型-同步自动机的参数化网络。 通过定义开放式自动机给出了此模型的行为语义, 并在此基础上给出了一种特殊的等价关系--规范假设互模拟等价。 我们讨论了这种等价关系在规范假设条件下的可复合性和可判定性。


同步自动机的参数化网络 行为语义 规范假设互模拟 


  1. 1.
    Lin H M. Symbolic transition graph with assignment. In: Proceedings of 7th International Conference on Concurrency Theory, Pisa, 1996. 50–65Google Scholar
  2. 2.
    Rathke J. Symbolic techniques for value-passing calculi. Dissertation for the Doctoral Degree. University of Sussex, 1997Google Scholar
  3. 3.
    de Simone R. Higher-level synchronizing devices in Meije-SCCS. Theor Comput Sci, 1985, 37: 245–267CrossRefzbMATHGoogle Scholar
  4. 4.
    Resink A. Bisimilarity of open terms. In: Proceedings of 4th Workshop on Expressiveness in Concurrency, Santa Margherita Ligure, 1997. 262–285Google Scholar
  5. 5.
    Henrio L, Madelaine E, Zhang M. pNets: an expressive model for parameterised networks of processes. In: Proceedings of 23rd Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), Turku, 2015. 492–496Google Scholar
  6. 6.
    Arnold A. Finite Transition Systems: Semantics of Communicating Systems. Hertfordshire: Prentice-Hall, 1994zbMATHGoogle Scholar
  7. 7.
    Cansado A, Madelaine E. Specification and Verification for Grid Component-based Applications: from Models to Tools. In: Proceedings of 7th International Symposium on Formal Methods for Components and Objects, Sophia Antipolis, 2008. 180–203Google Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.INRIA, 2004 rte des LuciolesSophia-AntipolisFrance
  2. 2.Shanghai Key Laboratory of Trustworthy ComputingMOE Intal Joint Laboratory of Trustworthy Software, ECNUShanghaiChina

Personalised recommendations