Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Synthesis of Orchestrations and Choreographies: Bridging the Gap between Supervisory Control and Coordination of Services (1910.00849v4)

Published 2 Oct 2019 in eess.SY, cs.DC, cs.FL, and cs.SY

Abstract: We present a number of contributions to bridging the gap between supervisory control theory and coordination of services in order to explore the frontiers between coordination and control systems. Firstly, we modify the classical synthesis algorithm from supervisory control theory for obtaining the so-called most permissive controller in order to synthesise orchestrations and choreographies of service contracts formalised as contract automata. The key ingredient to make this possible is a novel notion of controllability. Then, we present an abstract parametric synthesis algorithm and show that it generalises the classical synthesis as well as the orchestration and choreography syntheses. Finally, through the novel abstract synthesis, we show that the concrete syntheses are in a refinement order. A running example from the service domain illustrates our contributions.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. Behavioural contracts with request-response operations. Sci. Comp. Program., 78(2):248–267, 2013. doi:10.1016/j.scico.2011.10.007.
  2. R. Alur and D. Dill. A Theory of Timed Automata. Theoret. Comp. Sci., 126(2):183–235, 1994. doi:10.1016/0304-3975(94)90010-8.
  3. Feature-Oriented Software Product Lines: Concepts and Implementation. Springer, 2013. doi:10.1007/978-3-642-37521-7.
  4. Controller Synthesis for Timed Automata. IFAC Proc. Vol., 31(18):447–452, 1998. doi:10.1016/S1474-6670(17)42032-5.
  5. Automated Service Composition Via Supervisory Control Theory. In WODES, pages 28–35. IEEE, 2016. doi:10.1109/WODES.2016.7497822.
  6. Contract automata: An operational view of contracts between interactive parties. Artif. Intell. Law, 24(3):203–243, 2016. doi:10.1007/s10506-016-9185-2.
  7. Compliance in Behavioural Contracts: A Brief Survey. In Programming Languages with Applications to Biology and Security, volume 9465 of LNCS, pages 103–121. Springer, 2015. doi:10.1007/978-3-319-25527-9_9.
  8. Automata for Specifying and Orchestrating Service Contracts. Log. Meth. Comp. Sci., 12(4:6):1–51, 2016. doi:10.2168/LMCS-12(4:6)2016.
  9. Playing with Our CAT and Communication-Centric Applications. In FORTE, volume 9688 of LNCS, pages 62–73. Springer, 2016. doi:10.1007/978-3-319-39570-8_5.
  10. Relating two automata-based models of orchestration and choreography. J. Log. Algebr. Meth. Program., 85(3):425–446, 2016. doi:10.1016/j.jlamp.2015.09.011.
  11. Specifying Variability in Service Contracts. In VaMoS, pages 20–27. ACM, 2017. doi:10.1145/3023956.3023965.
  12. Controller synthesis of service contracts with variability. Science of Computer Programming, 187, 2020. doi:10.1016/j.scico.2019.102344.
  13. Timed service contract automata. Innovations Syst. Softw. Eng., 2020. doi:10.1007/s11334-019-00353-3.
  14. Bridging the Gap Between Supervisory Control and Coordination of Services: Synthesis of Orchestrations and Choreographies. In COORDINATION, volume 11533 of LNCS, pages 129–147. Springer, 2019. doi:10.1007/978-3-030-22397-7_8.
  15. D. S. Batory. Feature Models, Grammars, and Propositional Formulas. In SPLC, volume 3714 of LNCS, pages 7–20. Springer, 2005. doi:10.1007/11554844_3.
  16. A Service Computing Manifesto: The Next 10 Years. Commun. ACM, 60(4):64–72, 2017. doi:10.1145/2983528.
  17. Multiparty Sessions in SOC. In COORDINATION, volume 5052 of LNCS, pages 67–82. Springer, 2008. doi:10.1007/978-3-540-68265-3_5.
  18. C. G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Springer, 2006. doi:10.1007/978-0-387-68612-7.
  19. Efficient On-the-Fly Algorithms for the Analysis of Timed Games. In CONCUR, volume 3653 of LNCS, pages 66–80. Springer, 2005. doi:10.1007/11539452_9.
  20. On Global Types and Multi-Party Sessions. Log. Meth. Comp. Sci., 8(1:24):1–45, 2012. doi:10.2168/LMCS-8(1:24)2012.
  21. A Theory of Contracts for Web Services. ACM Trans. Program. Lang. Syst., 31(5):19:1–19:61, 2009. doi:10.1145/1538917.1538920.
  22. Featured Transition Systems: Foundations for Verifying Variability-Intensive Systems and Their Application to LTL Model Checking. IEEE Trans. Softw. Eng., 39(8):1069–1089, 2013. doi:10.1109/TSE.2012.86.
  23. An Overview of the mCRL2 Toolset and Its Recent Advances. In TACAS, volume 7795 of LNCS, pages 199–213. Springer, 2013. doi:10.1007/978-3-642-36742-7_15.
  24. Supervisory Control for Modal Specifications of Services. IFAC Proc. Vol., 43(12):418–425, 2010. doi:10.3182/20100830-3-DE-4013.00069.
  25. Timed I/O Automata: A Complete Specification Theory for Real-time Systems. In HSCC, pages 91–100. ACM, 2010. doi:10.1145/1755952.1755967.
  26. L. de Alfaro and T. Henzinger. Interface Automata. In ESEC/FSE, pages 109–120. ACM, 2001. doi:10.1145/503209.503226.
  27. M. Dezani-Ciancaglini and U. de’Liguoro. Sessions and Session Types: An Overview. In WS-FM, volume 6194 of LNCS, pages 1–28. Springer, 2010. doi:10.1007/978-3-642-14458-5_1.
  28. G. Feuillade and S. Pinchinat. Modal Specifications for the Control Theory of Discrete Event Systems. Discrete Event Dyn. Syst., 17(2):211–232, 2007. doi:10.1007/s10626-006-0008-6.
  29. Application of supervisory control theory to theme park vehicles. Discrete Event Dyn. Syst., 22(4):511–540, 2012. doi:10.1007/s10626-012-0130-6.
  30. Reducing Adapter Synthesis to Controller Synthesis. IEEE Trans. Services Computing, 5(1):72–85, 2012. doi:10.1109/TSC.2010.57.
  31. P. Gohari and W. M. Wonham. On the complexity of supervisory control design in the RW framework. IEEE Trans. Syst., Man, Cybern. B, Cybern., 30(5):643–652, 2000. doi:10.1109/3477.875441.
  32. Multiparty Asynchronous Session Types. In POPL, pages 273–284. ACM, 2008. doi:10.1145/1328438.1328472.
  33. Foundations of Session Types and Behavioural Contracts. ACM Comput. Surv., 49(1):3:1–3:36, 2016. doi:10.1145/2873052.
  34. Web Services Choreography Description Language v1.0. https://www.w3.org/TR/ws-cdl-10/, 2005.
  35. J. Křetínský. 30 Years of Modal Transition Systems: Survey of Extensions and Analysis. In Models, Algorithms, Logics and Tools, volume 10460 of LNCS, pages 36–74. Springer, 2017. doi:10.1007/978-3-319-63121-9_3.
  36. C. Laneve and L. Padovani. An algebraic theory for web service contracts. Form. Asp. Comp., 27(4):613–640, 2015. doi:10.1007/s00165-015-0334-2.
  37. From Communicating Machines to Graphical Choreographies. In POPL, pages 221–232. ACM, 2015. doi:10.1145/2676726.2676964.
  38. Modal I/O Automata for Interface and Product Line Theories. In ESOP, volume 4421 of LNCS, pages 64–79. Springer, 2007. doi:10.1007/978-3-540-71316-6_6.
  39. N. Lynch and M. Tuttle. An Introduction to Input/Output Automata. CWI Q., 2:219–246, 1989. URL: https://ir.cwi.nl/pub/18164/18164A.pdf.
  40. Session types for safe Web service orchestration. J. Log. Algebr. Program., 82(8):282–310, 2013. doi:10.1016/j.jlap.2013.05.004.
  41. C. Peltz. Web Services Orchestration and Choreography. IEEE Comp., 36(10):46–52, 2003. doi:10.1109/MC.2003.1236471.
  42. Software Product Line Engineering: Foundations, Principles, and Techniques. Springer, 2005. doi:10.1007/3-540-28901-1.
  43. Supervisory control of a class of discrete event processes. SIAM J. Control Optim., 25(1):206–230, 1987. doi:10.1137/0325013.
  44. Web Service Composition Approaches: From Industrial Standards to Formal Methods. In ICIW. IEEE, 2007. doi:10.1109/ICIW.2007.71.
  45. Communication Requirements for Team Automata. In COORDINATION, volume 10319 of LNCS, pages 256–277. Springer, 2017. doi:10.1007/978-3-319-59746-1_14.
  46. Family-Based Model Checking with mCRL2. In FASE, volume 10202 of LNCS, pages 387–405. Springer, 2017. doi:10.1007/978-3-662-54494-5_23.
  47. Modelling and analysing variability in product families: Model checking of modal transition systems with variability constraints. J. Log. Algebr. Meth. Program., 85(2):287–315, 2016. doi:10.1016/j.jlamp.2015.11.006.
  48. Supervisory Controller Synthesis for Product Lines Using CIF 3. In ISoLA, volume 9952 of LNCS, pages 856–873. Springer, 2016. doi:10.1007/978-3-319-47166-2_59.
  49. Improving evolvability of a patient communication control system using state-based supervisory control synthesis. Adv. Eng. Inform., 26(3):502–515, 2012. doi:10.1016/j.aei.2012.02.009.
  50. CIF 3: Model-Based Engineering of Supervisory Controllers. In TACAS, volume 8413 of LNCS, pages 575–580. Springer, 2014. doi:10.1007/978-3-642-54862-8_48.
  51. Deploying and managing Web services: issues, solutions, and directions. VLDB J., 17(3):735–572, 2008. doi:10.1007/s00778-006-0020-3.
Citations (6)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now