摘要
创新点
本文为分布式语言提出一个表达能力较强的模型-同步自动机的参数化网络。 通过定义开放式自动机给出了此模型的行为语义, 并在此基础上给出了一种特殊的等价关系--规范假设互模拟等价。 我们讨论了这种等价关系在规范假设条件下的可复合性和可判定性。
This is a preview of subscription content, log in via an institution to check access.
References
Lin H M. Symbolic transition graph with assignment. In: Proceedings of 7th International Conference on Concurrency Theory, Pisa, 1996. 50–65
Rathke J. Symbolic techniques for value-passing calculi. Dissertation for the Doctoral Degree. University of Sussex, 1997
de Simone R. Higher-level synchronizing devices in Meije-SCCS. Theor Comput Sci, 1985, 37: 245–267
Resink A. Bisimilarity of open terms. In: Proceedings of 4th Workshop on Expressiveness in Concurrency, Santa Margherita Ligure, 1997. 262–285
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–496
Arnold A. Finite Transition Systems: Semantics of Communicating Systems. Hertfordshire: Prentice-Hall, 1994
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–203
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Madelaine, E., Zhang, M. Towards a bisimulation theory for open synchronized networks of automata. Sci. China Inf. Sci. 59, 050107 (2016). https://doi.org/10.1007/s11432-016-5557-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-016-5557-1