References

  1. S. Abramsky (1994): Proofs as processes. Theoretical Computer Science 135(1), pp. 5–9, doi:10.1016/0304-3975(94)00103-0.
  2. T. Andrews, F. Curbera, H. Dholakia, Y. Goland, J. Klein, F. Leymann, K. Liu, D. Roller, D. Smith & S. Thatte (2003): Business process execution language for web services, version 1.1. Standards proposal by BEA Systems, International Business Machines Corporation, and Microsoft Corporation.
  3. G. Bellin & PJ Scott (1994): On the π-calculus and linear logic. Theoretical Computer Science 135(1), pp. 11–65, doi:10.1016/0304-3975(94)00104-9.
  4. A. Bog & F. Puhlmann (2006): A Tool for the Simulation of π-Calculus Systems. Open. BPM.
  5. F. Casati, S. Ilnicki, L.J. Jin, V. Krishnamoorthy & M.C. Shan (2000): eFlow: a platform for developing and managing composite e-services. HP Laboratories Technical Report HPL.
  6. E. Christensen, F. Curbera, G. Meredith & S. Weerawarana (2001): Web services description language (WSDL) 1.1. http://www.w3.org/TR/wsdl.
  7. D.S. Coalition, A. Ankolekar, M. Burstein & J.R. Hobbs (2002): DAML-S: Web service description for the semantic Web. In: First International Semantic Web Conference, Sardinia, Italy. Springer.
  8. J.Y. Girard (1995): Linear logic: its syntax and semantics. Advances in linear logic 222, pp. 1–42, doi:10.1017/CBO9780511629150.002.
  9. J. Harrison (1996): Optimizing proof search in model elimination. Lecture Notes in Computer Science 1104, pp. 313–327.
  10. John Harrison (1996): HOL Light: A tutorial introduction. In: Formal Methods in Computer-Aided Design, Lecture Notes in Computer Science 1166. Springer Berlin / Heidelberg, pp. 265–269, doi:10.1007/BFb0031814.
  11. J.A. Hendler, A. Tate & M. Drummond (1990): AI planning: Systems and techniques. AI magazine 11(2), pp. 61.
  12. W.A. Howard (1980): The formulae-as-types notion of construction. To HB Curry: essays on combinatory logic, lambda calculus and formalism, pp. 479–490.
  13. P.L. John, J. Mitchell, A. Scedrov & N. Shankar (1992): Decision problems for propositional linear logic. Annals of Pure and Applied Logic 56(1-3), pp. 239–311.
  14. S. Lämmermann, Institutionen för mikroelektronik och informationsteknik & Kungliga tekniska högskolan (2002): Runtime service composition via logic-based program synthesis. Department of Microelectronics and Information Technology.
  15. D. Martin, M. Burstein, J. Hobbs, O. Lassila, D. McDermott, S. McIlraith, S. Narayanan, M. Paolucci, B. Parsia & T.R. Payne (2004): OWL-S: Semantic markup for web services. http://www.w3.org/Submission/OWL-S/.
  16. T. F. Melham (1994): A Mechanized Theory of the π-calculus in HOL. Nordic Journal of Computing Volume 1, pp. 50–76.
  17. R. Milner (1999): Communicating and mobile systems: the π-calculus. Cambridge Univ Pr.
  18. T. Murata (1989): Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), pp. 541–580. Doi:10.1109/5.24143.
  19. L.C. Paulson (1990): Logic and computation: interactive proof with Cambridge LCF. Cambridge Univ Pr.
  20. S.R. Ponnekanti & A. Fox (2002): Sword: A developer toolkit for web service composition. In: Proc. of the Eleventh International World Wide Web Conference, Honolulu, HI.
  21. J. Power, C. Webster, C. Maynooth & I. Kildare (1999): Working with Linear Logic in Coq. In: 12th International Conference on Theorem Proving in Higher Order Logics, Work-in-Progress Report, Nice, France.
  22. J. Rao (2004): Semantic web service composition via logic-based program synthesis. Dr. Ing Thesis, Norwegian Uinversity of Science and Technology, Trondheim.
  23. J. Rao, P. Küngas & M. Matskin (2006): Composition of semantic web services using linear logic theorem proving. Information Systems 31(4-5), pp. 340–360, doi:10.1016/j.is.2005.02.005.
  24. D. Robertson (2004): A lightweight coordination calculus for agent systems. Declarative Agent Languages and Technologies 1, pp. 183–197.
  25. M. Sadrzadeh (2003): Modal linear logic in higher order logic: An experiment with Coq. In: In Emerging Trends TPHOLS, pp. 75–93.
  26. D. Sangiorgi (1996): A theory of bisimulation for the π-calculus. Acta informatica 33(1), pp. 69–97, doi:10.1007/s002360050036.
  27. M.E. Stickel, R.J. Waldinger & V.K. Chaudhri (2000): A guide to SNARK. SRI International, Menlo Park, CA.
  28. Naoyuki Tamura (1998): User's Guide of a Linear Logic Theorem Prover (llprover). Technical Report. Kobe University, Japan.
  29. Björn Victor & Faron Moller (1994): The Mobility Workbench — A Tool for the π-Calculus. In: David Dill: CAV'94: Computer Aided Verification, Lecture Notes in Computer Science 818. Springer-Verlag, pp. 428–440.
  30. Richard Waldinger (2001): Web Agents Cooperating Deductively. In: Formal Approaches to Agent-Based Systems, Lecture Notes in Computer Science 1871. Springer Berlin / Heidelberg, pp. 250–262, doi:10.1007/3-540-45484-5_20.
  31. M. Wirsing, A. Clark, S. Gilmore, M. Hölzl, A. Knapp, N. Koch & A. Schroeder (2006): Semantic-based development of service-oriented systems. Formal Techniques for Networked and Distributed Systems-FORTE 2006, pp. 24–45.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org