SCIENCE CHINA Information Sciences, Volume 59 , Issue 5 : 050107(2016) https://doi.org/10.1007/s11432-016-5557-1

Towards a bisimulation theory for open synchronized networks of automata

More info
  • ReceivedNov 5, 2015
  • AcceptedJan 26, 2016
  • PublishedApr 13, 2016



[1] Lin H M. Symbolic transition graph with \mbox{assignment}. In: Proceedings of 7th International Conference on Concurrency Theory, Pisa, 1996. 50--65. Google Scholar

[2] Rathke J. Symbolic techniques for value-passing calculi. Dissertation for the Doctoral Degree. University of Sussex, 1997. Google Scholar

[3] de Simone R. Theor Comput Sci, 1985, 37245-267 Google Scholar

[4] Resink A. Bisimilarity of open terms. In: Proceedings of 4th Workshop on Expressiveness in Concurrency, Santa Margherita Ligure, 1997. 262--285. Google Scholar

[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--496. Google Scholar

[6] Arnold A. Finite Transition Systems: Semantics of Communicating Systems. Hertfordshire: Prentice-Hall, 1994. Google Scholar

[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--203. Google Scholar


Contact and support