Papers
Topics
Authors
Recent
Search
2000 character limit reached

Strong Priority and Determinacy in Timed CCS

Published 7 Mar 2024 in cs.PL and cs.CL | (2403.04618v3)

Abstract: Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinacy-by-construction for multi-cast concurrent communication with shared memory. In the technical setting of CCS extended by clocks and priorities, we prove for a large class of "coherent" processes a confluence property for constructive reductions. We show that under some restrictions, called "pivotability", coherence is preserved by the operators of prefix, summation, parallel composition, restriction and hiding. Since this permits memory and sharing, we are able to cover a strictly larger class of processes compared to those in Milner's classical confluence theory for CCS without priorities.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (36)
  1. H. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, revised edition, 1984.
  2. G. Barrett. The semantics of priority and fairness in OCCAM. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Proc. MFPS’89, 1989.
  3. G. Berry. The Constructive Semantics of Pure Esterel. Draft Book, 1999. ftp://ftp-sop.inria.fr/esterel/pub/papers/constructiveness3.ps.
  4. G. Berry. The Foundations of Esterel. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 425–454. MIT Press, 2000.
  5. G. Berry and G. Boudol. The chemical abstract machine. Theor. Comput. Sci., 96(1):217–248, 1992. URL: https://doi.org/10.1016/0304-3975(92)90185-I, doi:10.1016/0304-3975(92)90185-I.
  6. Parallel programming must be deterministic by default. In Proceedings of the First USENIX conference on Hot topics in parallelism, pages 4–4, 2009.
  7. J. Camilleri and G. Winskel. CCS with priority choice. Information and Computation, 116(1):26–37, 1995.
  8. An algebraic theory of multiple clocks. In A. Mazurkiewicz and J. Winkowski, editors, Proceedings of the International Conference on Concurrency Theory CONCUR’97, pages 166–180. Springer, 1997. LNCS 1243.
  9. V. Dieckert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.
  10. S. A. Edwards. On determinism. In M. Lohstroh et. al., editor, Lee Festschrift, pages 240–253. Springer, 2018.
  11. Programming real time applications with SIGNAL. In Proceedings of the IEEE, volume 79, pages 1321–1336. IEEE Press, September 1991.
  12. M. Mendler H. R. Andersen. An asynchronous process algebra with multiple clocks. In D. Sannella, editor, In Proc. ESOP’94, pages 58–73, 1994.
  13. The synchronous data-flow programming language LUSTRE. Proceedings of the IEEE, 79(9):1305–1320, September 1991.
  14. On the formal semantics of Statecharts. In Logic in Computer Science (LICS’87), pages 54–64. IEEE Press, 1987.
  15. M. Hennessy and T. Regan. A process algebra for timed system. Information and Computation, 117:221–239, 1995.
  16. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985. 256 pages.
  17. Formal Semantics for VHDL. Kluwer, 1995.
  18. J. W. Klop. Combinatory reduction systems. PhD thesis, Univ. Utrecht, 1980.
  19. E. A. Lee. The problem with threads. Computer, 39(5):33–42, 2006.
  20. Dataflow process networks. In Proceedings of the IEEE, pages 773–799, May 1995.
  21. G. Lüttgen and M. Mendler. When 1 clock is not enough. In L. Aceto and A.D. Gordon, editors, Algebraic Process Calculi: The First Twenty Five Years and Beyond (PA’05), number NS-05-03 in BRICS Notes Series, pages 155–158, June 2005.
  22. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
  23. R. Milner. Functions as processes. Math. Struct. Comput. Sci., 2(2):119–141, 1992. URL: https://doi.org/10.1017/S0960129500001407, doi:10.1017/S0960129500001407.
  24. A calculus of mobile processes, I. Inf. Comput., 100(1):1–40, 1992. URL: https://doi.org/10.1016/0890-5401(92)90008-4, doi:10.1016/0890-5401(92)90008-4.
  25. A calculus of mobile processes, II. Inf. Comput., 100(1):41–77, 1992. URL: https://doi.org/10.1016/0890-5401(92)90009-5, doi:10.1016/0890-5401(92)90009-5.
  26. A compositional semantic theory for component-based synchronous design. In R. Amadio and D. Lugiez, editors, Int’l Conf. on Concurrency Theory (CONCUR’2003), pages 461–476, Marseille, September 2003. Springer LNCS 2761.
  27. I. Phillips. CCS with priority guards. In K. G. Larsen and M. Nielsen, editors, Proc. Concur 2001, pages 305–320, 2001.
  28. G. D. Plotkin. The origins of structural operational semantics. J. Log. Algebraic Methods Program., 60-61:3–15, 2004. URL: https://doi.org/10.1016/j.jlap.2004.03.009, doi:10.1016/J.JLAP.2004.03.009.
  29. G. D. Plotkin. A structural approach to operational semantics. J. Log. Algebraic Methods Program., 60-61:17–139, 2004.
  30. V. Natarajan R. Cleaveland, G. Lüettgen. Handbook of Process Agebra, chapter Priority in Process Algebra. Elsevier, 2001.
  31. K. Schneider. The synchronous programming language Quartz. Internal Report 375, Department of Computer Science, University of Kaiserslautern, Kaiserslautern, Germany, December 2009.
  32. Esterel Technologies. The Esterel v7 reference manual version v7_30 – initial IEEE standardization proposal. Technical report, Esterel Technologies, 679 av. Dr. J. Lefebvre, 06270 Villeneuve-Loubet, France, November 2005.
  33. S.H. Unger. Asynchronous sequential switching circuits with unrestricted input changes. IEEE Transactions on Computers, C-20(12):1437–1444, 1971. doi:10.1109/T-C.1971.223155.
  34. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103–111, 1990. URL: https://doi.org/10.1145/79173.79181, doi:10.1145/79173.79181.
  35. R. J. van Glabbeek. Notes on the methodology of CCS and CSP. Theor. Comput. Sci., 177(2):329–349, 1997. URL: https://doi.org/10.1016/S0304-3975(96)00251-4, doi:10.1016/S0304-3975(96)00251-4.
  36. SCCharts: Sequentially Constructive Statecharts for safety-critical applications. In Proc. PLDI’14, Edinburgh, UK, June 2014. ACM.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up