References

  1. Manish Kumar Anand, Shawn Bowers & Bertram Ludäscher (2010): Techniques for efficiently querying scientific workflow provenance graphs. In: EDBT '10. ACM, pp. 287–298, doi:10.1145/1739041.1739078.
  2. Christian Bizer, Tom Heath & Tim Berners-Lee (2009): Linked Data — The Story So Far. International Journal on Semantic Web and Information Systems 5(3), pp. 1–22, doi:10.4018/jswis.2009081901.
  3. Gérard Boudol & Ilaria Castellani (1989): Permutation of transitions: An event structure semantics for CCS and SCCS. In: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354. Springer, pp. 411–427, doi:10.1007/BFb0013028.
  4. Peter Buneman, Adriane Chapman & James Cheney (2006): Provenance management in curated databases.. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 539–550, doi:10.1145/1142473.1142534.
  5. Jeremy J. Carroll, Christian Bizer, Pat Hayes & Patrick Stickler (2005): Named graphs. Web Semantics: Science, Services and Agents on the World Wide Web 3(4), pp. 247–267, doi:10.1016/j.websem.2005.09.001.
  6. James Cheney (2010): Causality and the Semantics of Provenance. In: Developments in Computational Models, pp. 63–74, doi:10.4204/EPTCS.26.6.
  7. James Cheney, Laura Chiticariu & Wang-Chiew Tan (2009): Provenance in Databases: Why, How, and Where. Found. Trends databases 1(4), pp. 379–474, doi:10.1561/1900000006.
  8. Mariangiola Dezani, Ross Horne & Vladimiro Sassone (2012): Tracing where and who provenance in Linked Data: a calculus. Theoretical Computer Science, doi:10.1016/j.tcs.2012.06.020.
  9. Jay L. Gischer (1988): The equational theory of pomsets. Theoretical Computer Science 61(2-3), pp. 199–224, doi:10.1016/0304-3975(88)90124-7.
  10. Todd J. Green, Grigoris Karvounarakis & Val Tannen (2007): Provenance semirings. In: PODS '07. ACM, pp. 31–40, doi:10.1145/1265530.1265535.
  11. Alessio Guglielmi (2007): A system of interaction and structure. ACM Transactions on Compututational Logic 8, doi:10.1145/1182613.1182614.
  12. Tony Hoare, Bernhard Möller, Georg Struth & Ian Wehrman (2011): Concurrent Kleene Algebra and its Foundations. Journal of Logic and Algebraic Programming 80(6), pp. 266–296, doi:10.1016/j.jlap.2011.04.005.
  13. Ross Horne & Vladimiro Sassone (2011): A Verified Algebra for Linked Data. In: FOCLASA, pp. 20–33, doi:10.4204/EPTCS.58.2.
  14. Naoki Kobayashi & Akinori Yonezawa (1993): ACL – A Concurrent Linear Logic Programming Paradigm. In: Proceedings of the 1993 International Logic Programming Symposium. MIT Press, pp. 279–294. Available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.34.2776&rep=rep1&type=pdf.
  15. Luc Moreau, Ben Clifford, Juliana Freire, Joe Futrelle, Yolanda Gil, Paul Groth, Natalia Kwasnikowska, Simon Miles, Paolo Missier, Jim Myers, Beth Plale, Yogesh Simmhan, Eric Stephan & Jan Van den Bussche (2011): The Open Provenance Model core specification (v1.1). Future Gener. Comput. Syst. 27(6), pp. 743–756, doi:10.1016/j.future.2010.07.005.
  16. Vaughan Pratt (1986): Modeling concurrency with partial orders. International Journal of Parallel Programming 15(1), pp. 33–71, doi:10.1007/BF01379149.
  17. Cristian Prisacariu (2010): Synchronous Kleene algebra. Journal of Logic and Algebraic Programming 79(7), pp. 608–635, doi:10.1016/j.jlap.2010.07.009.
  18. Issam Souilah, Adrian Francalanza & Vladimiro Sassone (2009): A Formal Model of Provenance in Distributed Systems. In: Workshop on the Theory and Practice of Provenance, pp. 1–11. Available at http://static.usenix.org/events/tapp09/tech/full_papers/souilah/souilah.pdf.
  19. Jacobo Valdes, Robert E. Tarjan & Eugene L. Lawler (1979): The recognition of Series Parallel digraphs. In: STOC '79. ACM, pp. 1–12, doi:10.1145/800135.804393.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org