Skip to main content
SpringerLink
Log in

A fully abstract semantics for value-passing CCS for trees

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

We propose a fully abstract semantics for value-passing CCS for trees (VCCTS) with the feature that processes are located at the vertices of a graph whose edges describe possible interaction capabilities. The operational semantics is given both in terms of a reduction semantics and in terms of a labelled transition semantics. We develop a theory of behavioral equivalences by introducing both weak barbed congruence and weak bisimilarity. In particular, we show that, on image-finite processes, weak barbed congruence coincides with weak bisimilarity. To illustrate potential applications and the powerful expressiveness of VCCTS, we formally compare VCCTS with some well-known models, e.g., dynamic pushdown networks, top-down tree automata and value-passing CCS.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hoare C A R. Communicating sequential processes. Communications of the ACM, 1983, 26(1): 100–106

    Article  Google Scholar 

  2. Milner R. Communication and Concurrency. New York etc.: Prentice- Hall, Inc., 1989

    MATH  Google Scholar 

  3. Milner R, Parrow J, Walker D. A calculus of mobile processes, I. Information and Computation, 1992, 100(1): 1–40

    Article  MathSciNet  MATH  Google Scholar 

  4. Boudol G, Castellani I, Hennessy M, Nielsen M, Winskel G. Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. Concurrency, Graphs and Models. Springer, Berlin, Heidelberg, 2008, 757–777

    Google Scholar 

  5. Boudol G, Castellani I. A non-interleaving semantics for CCS based on proved transitions. Research Report, 1988

    Google Scholar 

  6. Boudol G, Castellani I, Hennessy M, Kiehn A. A theory of processes with localities. Formal Aspects of Computing, 1994, 6(2): 165–200

    Article  MATH  Google Scholar 

  7. Castellani I. Process algebras with localities. Handbook of Process Algebra, 2001, 945–1045

    Chapter  Google Scholar 

  8. Degano P, De Nicola R, Montanari U. A partial ordering semantics for CCS. Theoretical Computer Science, 1990, 75(3): 223–262

    Article  MathSciNet  MATH  Google Scholar 

  9. Kiehn A. Comparing locality and causality based equivalences. Acta Informatica, 1994, 31(8): 697–718

    Article  MathSciNet  MATH  Google Scholar 

  10. Reisig W. Petri Nets: an Introduction. Springer Science & Business Media, 1985

    Google Scholar 

  11. Winskel G. An introduction to event structures. In: Proceedings of the Workshop of the REX Project Research and Eduction in Concurrent Systems. 1988, 364–397

    Google Scholar 

  12. Ferrari L, Hirsch D, Lanese I, Montanari U, Tuosto E. Synchronised hyperedge replacement as a model for service oriented computing. In: Proceedings of International Symposium on FormalMethods for Components and Objects. 2005, 22–43

    Google Scholar 

  13. König B, Montanari U. Observational equivalence for synchronized graph rewriting with mobility. In: Proceedings of International Symposium on Theoretical Aspects of Computer Software. 2001, 145–164

    Chapter  Google Scholar 

  14. Ehrhard T, Jiang Y. CCS for trees. 2013, arXiv preprint arXiv:1306.1714

    Google Scholar 

  15. Ehrhard T, Jiang Y. A dendroidal process calculus. 2015

    Google Scholar 

  16. Liu S, Jiang Y. Value-passing CCS for trees: a theory for concurrent systems. In: Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering. 2016, 101–108

    Google Scholar 

  17. Milner R, Sangiorgi D. Barbed bisimulation. In: Proceedings of International Colloquium on Automata, Languages, and Programming. 1992, 685–695

    Chapter  Google Scholar 

  18. Bouajjani A, Müller-Olm M, Touili T. Regular symbolic analysis of dynamic networks of pushdown systems. In: Proceedings of International Conference on Concurrency Theory. 2005, 473–487

    Google Scholar 

  19. Lammich P, Müller-Olm M, Wenner A. Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Proceedings of International Conference on Computer Aided Verification. 2009, 525–539

    Chapter  Google Scholar 

  20. Comon H, Dauchet M, Gilleron R. Löding C, Jacquemard F, Lugiez D, Tison S, Tommasi M. Tree automata techniques and applications, 1997

    Google Scholar 

  21. Bartlett A, Scantlebury R A, Wilkinson P T. A note on reliable fullduplex transmission over half-duplex links. Communications of the ACM, 1969, 12(5): 260–261

    Article  Google Scholar 

  22. Sangiorgi D. Introduction to Bisimulation and Coinduction. Cambridge: Cambridge University Press, 2011

    Book  MATH  Google Scholar 

  23. Esparza J, Knoop J. An automata-theoretic approach to interprocedural data-flow analysis. In: Proceedings of International Conference on Foundations of Software Science and Computation Structure. 1999, 14–30

    Chapter  Google Scholar 

  24. Linz P. An Introduction to Formal Languages and Automata. USA: Jones and Bartlett Publishers, Inc., 2011

    MATH  Google Scholar 

  25. Aranda J, Di C, Nielsen M, Valencia F D. CCS with replication in the chomsky hierarchy: the expressive power of divergence. In: Proceedings of Asian Symposium on Programming Languages and Systems. 2007, 383–398

    Chapter  Google Scholar 

  26. Baeten J C M, Bergstra A, Klop J W. Decidability of bisimulation equivalence for process generating context-free languages. Journal of the ACM, 1993, 40(3): 653–682

    Article  MATH  Google Scholar 

  27. Liu S, Jiang Y. Value-passing CCS for trees: A theory for concurrent systems. In: Proceedings of the 10th International Symposium on Theoretical Aspects of Software Engineering. 2016, 101–108

    Google Scholar 

  28. Lanese I, Sangiorgi D. An operational semantics for a calculus for wireless systems. Theoretical Computer Science, 2010, 411(19): 1928–1948

    Article  MathSciNet  MATH  Google Scholar 

  29. Castellani I, Hennessy M. Distributed bisimulations. Journal of the ACM, 1989, 36(4): 887–911

    Article  MathSciNet  MATH  Google Scholar 

  30. Sangiorgi D. Expressing mobility in process algebras: first-order and higher-order paradigms. University of Edinburgh, 1993

    Google Scholar 

  31. Bollig B. Logic for communicating automata with parameterized topology. In: Proceedings of the 23th EACSL Conference on Computer Science Logic. 2014, 18

    Google Scholar 

  32. Merro M. An observational theory for mobile ad hoc networks (full version). Information and Computation, 2009, 207(2): 194–208

    Article  MathSciNet  MATH  Google Scholar 

  33. Nanz S, Hankin C. A framework for security analysis of mobile wireless networks. Theoretical Computer Science, 2006, 367(1): 203–227

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous reviewers for valuable comments. This work has been funded by the CAS-INRIA major project VIP (GJHZ1844) and by the French-Chinese project Locali (NSFC 61161130530 and ANR-11-IS02-00201).

Author information

Authors and Affiliations

  1. State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China

    Ying Jiang & Shichao Liu

  2. University of Chinese Academy of Sciences, Beijing, 100049, China

    Shichao Liu

  3. CNRS, IRIF, UMR 8243, Univ Paris Diderot, Sorbonne Paris Cité, F-75205, Paris, France

    Thomas Ehrhard

Authors
  1. Ying Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shichao Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Thomas Ehrhard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shichao Liu.

Additional information

Ying Jiang has been a research professor at Institute of Softwares, Chinese Academy of Sciences (ISCAS), China since 1999. She received her PhD degree from the University Paris 7 in 1993. She was responsible for three research grants from NSFC and co-responsible for two Sino French cooperation projects from NSFC-ANR and Ministry of Science and Technology of China, respectively. She is also co-responsible for a CAS-INRIA joint project. Her research interests focus on formalization of concurrent systems and verification of concurrent programs, in particular, on topics such as the connections (1) between model checking and automated theorem proving, (2) between CCS and tree automata, etc. Her research results published in I&C, TCS, The Computer Journal, Archive for Mathematical Logic, C.R.Acad. Sci. etc.

Shichao Liu received his PhD from the Institute of Softwares, Chinese Academy of Sciences (ISCAS), China in 2018. His research includes process calculus, concurrent systems and program semantics. Now he is a software engineer in a software company.

Thomas Ehrhard, CNRS Senior Researcher, University Paris Diderot. PhD in Computer Science from University Paris in 1987. He joined the newly created Laboratory of Discrete Mathematics in Marseille in 1994 and moved in 2005 to the PPS laboratory in Paris. Director of the PPS laboratory in 2009 and then deputy director of the IRIF laboratory in 2016 and 2017. He is a member of the editorial board of MSCS. His research interest is in theoretical computer science and mathematics, covering mainly proof theory and semantics. He has been responsible of the research grants ACI GEOCAL and ANR CHOCO. His research results have been published in prestigious conferences and journals including LICS, POPL, CONCUR, TCS, Information and Computation, JSL, JACM.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, Y., Liu, S. & Ehrhard, T. A fully abstract semantics for value-passing CCS for trees. Front. Comput. Sci. 13, 828–849 (2019). https://doi.org/10.1007/s11704-018-7069-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-018-7069-1

Keywords

Search

Navigation