diff --git a/app/specs/guests/prov/prov-invalid.json b/app/specs/guests/prov/prov-invalid.json new file mode 100644 index 00000000..c6568a39 --- /dev/null +++ b/app/specs/guests/prov/prov-invalid.json @@ -0,0 +1,20 @@ +{ + "id": "prov-invalid", + "wasm": "site/prov/guest/prov-invalid.wasm", + "pin": "site/prov/guest.mjs", + "as": "invalid", + "modules": [ + "PrismProv" + ], + "dispatch": "PrismProv::prismProvDispatch", + "vectors": "spec:prov/invalid", + "limits": [ + 4096, + 128, + 8192 + ], + "memory": [ + 16384, + 1048576 + ] +} diff --git a/app/specs/guests/prov/prov-invalid.lock.json b/app/specs/guests/prov/prov-invalid.lock.json new file mode 100644 index 00000000..1b90e9a8 --- /dev/null +++ b/app/specs/guests/prov/prov-invalid.lock.json @@ -0,0 +1,4 @@ +{ + "source": "a8382ad7db97fe9af076b04e61f97ed6260e4fbba10e9aa1d2c4b7c8840f7934", + "wasm": "4c7b6c75300bd636c2d6b880b1645f1e48fe74cc5199c779308a3f56734c12f9" +} diff --git a/app/specs/guests/prov/prov.json b/app/specs/guests/prov/prov.json new file mode 100644 index 00000000..a05381b5 --- /dev/null +++ b/app/specs/guests/prov/prov.json @@ -0,0 +1,20 @@ +{ + "id": "prov", + "wasm": "site/prov/guest/prov.wasm", + "pin": "site/prov/guest.mjs", + "as": "prov", + "modules": [ + "PrismProv" + ], + "dispatch": "PrismProv::prismProvDispatch", + "vectors": "spec:prov", + "limits": [ + 4096, + 128, + 8192 + ], + "memory": [ + 16384, + 1048576 + ] +} diff --git a/app/specs/guests/prov/prov.lock.json b/app/specs/guests/prov/prov.lock.json new file mode 100644 index 00000000..79d1e213 --- /dev/null +++ b/app/specs/guests/prov/prov.lock.json @@ -0,0 +1,4 @@ +{ + "source": "caf479864de64502ad7f6d5d4994cec240d3e25c6059535d62158b0a8ea434ba", + "wasm": "4c7b6c75300bd636c2d6b880b1645f1e48fe74cc5199c779308a3f56734c12f9" +} diff --git a/app/specs/oracle/spec.json b/app/specs/oracle/spec.json index 51e95ef5..cbb18c74 100644 --- a/app/specs/oracle/spec.json +++ b/app/specs/oracle/spec.json @@ -165,6 +165,10 @@ { "kind": "what a Web Annotation selector selects", "why": "The suite tests an annotation's shape only. No published test says what a selector or a refinedBy chain selects in a text, so resolving a citation's selector has no oracle yet." + }, + { + "kind": "provenance rules no W3C case turns on", + "why": "The prov guest is held to the 166 PROV-N cases of W3C's PROV-CONSTRAINTS suite (app/specs/prov/spec.json). Switching a numbered rule off changes a case's verdict only for Inference 19 and Constraints 23 to 29, 42, 45, 52, 54, 55 and 56; the other 42 rules are implemented with no oracle test and are ST-01 debt (app/specs/standards/debt/w3c-prov-constraints.json). No case repeats a bundle identifier or passes the guest's bounds, and no source gives the PROV-N of one of the Prism's own turns." } ], "unsourced": [ diff --git a/app/specs/parts/spec.json b/app/specs/parts/spec.json index e8304461..282a7081 100644 --- a/app/specs/parts/spec.json +++ b/app/specs/parts/spec.json @@ -324,6 +324,14 @@ ], "site/emma/guest.mjs": [ "how" + ], + "app/src/PrismProv.lex.tex": [ + "why", + "when", + "how" + ], + "site/prov/guest.mjs": [ + "how" ] } } diff --git a/app/specs/prov/invalid/spec.json b/app/specs/prov/invalid/spec.json new file mode 100644 index 00000000..8b8613a6 --- /dev/null +++ b/app/specs/prov/invalid/spec.json @@ -0,0 +1,274 @@ +{ + "name": "prov-invalid", + "comment": "The FAIL cases of app/specs/prov/spec.json ('tests' there pins each one), byte for byte as W3C serves them, with the answers that file gives: the acceptance vectors of the guest 'prov-invalid', which is the same module as 'prov'. One guest build carries at most about 110 vectors, so the PASS cases are the vectors of 'prov' and the FAIL cases are this guest's.", + "examples": [ + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nwasDerivedFrom(ex:der2;ex:e1, ex:e2)\nendDocument\n", + "invalid 42" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nspecializationOf(ex:e2,ex:e1)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nwasDerivedFrom(ex:der1;ex:e1, ex:e2)\nendDocument\n", + "invalid 42 45" + ], + [ + "check\ndocument\n default \n prefix ex \n\n activity(def:illustrationActivity,2012-04-03T00:00:00Z,2012-04-03T00:00:25Z)\n entity(def:bar_chart,[prov:type='ex:Chart'])\n wasDerivedFrom(def:bar_chart, def:aggregatedByRegions, -, def:illustration, -)\n wasGeneratedBy(def:illustration;-,def:illustrationActivity,2012-04-03T00:00:11Z,[prov:type='prov:InstantaneousEvent'])\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\n default \n\n entity(proteinSample)\n entity(digestedProteinSample1)\n wasDerivedFrom(digestedProteinSample1, proteinSample, -, u1, -)\n used(u1; -, Trypsin, -,[prov:role='treatmentEnzyme'])\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\n\nprefix ex \n\nentity(ex:e1)\nentity(ex:e2,[prov:type='prov:EmptyCollection'])\nhadMember(ex:e2,ex:e1)\n\nendDocument\n", + "invalid 56" + ], + [ + "check\ndocument\n prefix ex \n\n entity(ex:e1, [prov:type='ex:test1'])\n activity(ex:e1, -, -, [prov:type='ex:test2'])\nendDocument\n", + "invalid 55" + ], + [ + "check\ndocument\n prefix ex \n\n entity(ex:e1, [prov:type='ex:test1'])\n entity(ex:e2, [prov:type='ex:test2'])\n wasGeneratedBy(ex:gen1; ex:e1, ex:e2, -)\nendDocument\n", + "invalid 55" + ], + [ + "check\ndocument\n prefix ex \n\n entity(ex:e1, [prov:type='ex:test1'])\n entity(ex:e2, [prov:type='ex:test2'])\n wasGeneratedBy(ex:e1; ex:e3, ex:a4, -)\nendDocument\n", + "invalid 54" + ], + [ + "check\ndocument\n prefix ex \n\n wasGeneratedBy(ex:gen; ex:e3, ex:a4, -)\n used(ex:gen; ex:a4, ex:e5, -)\nendDocument\n", + "invalid 23 53" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,2012-11-16T17:05:00)\nwasEndedBy(ex:end1;ex:a1,-,-,2111-11-11T11:11:11)\nendDocument\n", + "invalid 29" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,2012-11-16T17:05:00)\nwasStartedBy(ex:start1;ex:a1,-,-,2111-11-11T11:11:11)\nendDocument\n", + "invalid 28" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1-other,ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1-other,ex:ag1,ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1-other)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,-,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;-,ex:ag1,ex:e1)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:del1;ex:e1, -)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:del1;-, ex:e1)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \n\nentity(ex:e2)\n\nbundle ex:bundle1\n activity(ex:e1,-,-)\n entity(ex:e1)\nendBundle\n\nbundle ex:bundle2\n entity(ex:e1,[prov:type='prov:EmptyCollection'])\n hadMember(ex:e1,ex:e2)\nendBundle\n\nendDocument\n", + "invalid 55 56" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:inf1;ex:a1,-)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:inf1;-,ex:a1)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1-other,ex:a2)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:del1;ex:ag2-other,ex:ag1,ex:a2)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2-other)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;-,ex:ag1,ex:a2)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, -)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, ex:use)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1-other,ex:e1,ex:a2,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1-other,ex:a2,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2-other,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:end1-other;ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "invalid 27" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1-other;ex:e1,ex:a1,-)\nendDocument\n", + "invalid 24" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1-other,ex:a1,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1-other,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:e1,ex:a1,2012-11-16T16:05:00)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:e1,ex:a1,2012-11-16T16:05:00)\nwasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00)\nwasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\n prefix ex \n \n wasInfluencedBy(ex:infl1; ex:x1, -)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\n prefix ex \n\n wasInfluencedBy(ex:infl1;-, ex:x1)\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1-other;ex:e1,ex:a1,-)\nendDocument\n", + "invalid 25" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1-other,ex:a1,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1-other,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:e1,ex:a1,2012-11-16T16:05:00)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:e1,ex:a1,2012-11-16T16:05:00)\nwasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00)\nwasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\n\nprefix ex \n\nentity(ex:e1)\nentity(ex:e2)\n\nhadMember(ex:e2, -)\n\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\n\nprefix ex \n\nentity(ex:e1)\nentity(ex:e2)\n\nspecializationOf(ex:e2, -)\n\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\n\nprefix ex \n\nentity(ex:e1)\nentity(ex:e2)\n\nspecializationOf(-, ex:e1)\n\nendDocument\n", + "malformed" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nspecializationOf(ex:e1,ex:e1)\nendDocument\n", + "invalid 52" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nspecializationOf(ex:e2,ex:e1)\nspecializationOf(ex:e1,ex:e2)\nendDocument\n", + "invalid 52" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1-other,ex:e1,ex:a2,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1-other,ex:a2,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2-other,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1-other;ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "invalid 26" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,2012-11-16T16:05:00)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,2013-11-16T16:05:00)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1-other,ex:a1,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1-other,-)\nendDocument\n", + "invalid 23" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,2012-11-16T16:05:00)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "invalid 23" + ] + ] +} diff --git a/app/specs/prov/spec.json b/app/specs/prov/spec.json new file mode 100644 index 00000000..4bd656ac --- /dev/null +++ b/app/specs/prov/spec.json @@ -0,0 +1,1490 @@ +{ + "name": "prov", + "comment": "The Prism's provenance checker (app/src/PrismProv.lex.tex, the guest 'prov') held to W3C's Constraints of the PROV Data Model (PROV-CONSTRAINTS, Recommendation 30 April 2013), reading the PROV-N notation (Recommendation 30 April 2013). The request is 'check', a newline and a PROV-N document; the answer is 'valid', 'invalid' and the numbers of the constraints that do not hold, 'malformed' when the text is not a PROV-N document, or 'unjudged' when normalization would pass the guest's bounds (4,000 statements or 30,000 existential variables in one instance). 'tests' is every PROV-N case of the PROV working group's constraints test suite, as the 'suite' page lists them and as W3C serves them under 'base', each pinned by SHA-256 and kept at app/specs/standards/texts/. A case's file name is W3C's verdict: PASS is a valid document, FAIL is not, and the c numbers are the constraints the case is about; DM marks a case that is not a document of the data model, which this reader refuses as malformed. 'answer' is the guest's answer: W3C gives the verdict, and the numbers in an 'invalid' answer are the checker's own reading, each one among the file name's c numbers except in type-f4-FAIL-c53, where Inference 15 gives the generation and the usage that share an identifier two influences with that identifier, so Constraint 23 fails beside 53. 'examples' carries the PASS cases byte for byte as the guest's acceptance vectors after the verb line, and app/specs/prov/invalid/spec.json carries the FAIL cases the same way for the guest 'prov-invalid' (the same module: one guest build carries at most about 110 vectors); cases W3C serves under two names with the same bytes are one vector; nothing else is an acceptance vector. 'shown' names, for each numbered inference or constraint, the cases whose verdict changes when that one rule is switched off in the checker: those are the rules this suite shows enforced. The suite cannot show the others (its ordering cases outside 42 and 45 are all PASS cases, and no case turns on Inferences 5 to 18, 20 and 21 or Constraints 22, 50, 51 and 53 alone), so they stay in ST-01's debt, and a document with a repeated bundle identifier (section 7.2, answered 'invalid 7.2') has no case at all.", + "standard": { + "url": "https://www.w3.org/TR/2013/REC-prov-constraints-20130430/", + "sha256": "0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287" + }, + "notation": { + "url": "https://www.w3.org/TR/2013/REC-prov-n-20130430/", + "sha256": "c7320ed45cc643eca0819b0616835529dfb35dc819eaf50deaf209ee1e974e49" + }, + "suite": { + "url": "https://dvcs.w3.org/hg/prov/raw-file/default/testcases/process.html", + "sha256": "5a8dd5d121b55cb505f32094ae719ddcda77069486fbe4229ddae087039553ea" + }, + "base": "https://dvcs.w3.org/hg/prov/raw-file/default/testcases/constraints/", + "tests": [ + { + "file": "ordering-activity1-PASS-c30.provn", + "sha256": "1612cee39bcb61f4f831256a33f95d38089e035113e770a6d6bea6c7149739b5", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-activity2-PASS-c33.provn", + "sha256": "58707b1db5ec9e93ae8da7713c0f0afe8c9963c94119bc44206050bfcd89c87a", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-activity3-PASS-c34.provn", + "sha256": "c75b835e5fcf3578e40525b1737fa7fac803f0d67a5e7dea8b8fc12fa19d7f52", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-activity4-PASS-c31.provn", + "sha256": "9fc4a453d5ac211c1d84124a45cb94f499066af8e35c48ed7388915943a2969d", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-activity5-PASS-c32.provn", + "sha256": "7d65b2d3ce0031b21df15d523d8b9289d0738b7cb94383c19b1e2bf978c012be", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-association1-PASS-c47.provn", + "sha256": "ee9f4185a41f2dacd8a849e20d9504e86c096bbb9775a568bdaa24d14e43bb95", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-association2-PASS-c47.provn", + "sha256": "2fee73a4f493a4c63af97adac9729f76abd9842683abbd5fbc8ac526ca9039f4", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-attribution1-PASS-c48.provn", + "sha256": "522b87cef83194166add122afefce5fd92eb58c04fcbe8d9836eaa65a3d03397", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-attribution2-PASS-c48.provn", + "sha256": "1186acd22d39798e821fa259149f517d2c5cf3b9321c4386841fc8ace7a5c7ed", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-communication-PASS-c35.provn", + "sha256": "5472d513ae0db82c2bfd0af969547ff5a959637b43f5561951578c50ae4c3d35", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-delegation1-PASS-c49.provn", + "sha256": "6dcc1d4c48a8439c30852ac4de0a09004b22cb46daa193fff861b9b559fe95cf", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-delegation2-PASS-c49.provn", + "sha256": "2b239635e4fb903b271cf9ee24a628312f7b586b4417cbb29007ae63ecaa432b", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-derivation1-PASS-c42.provn", + "sha256": "ff6ea34b8e4d4945b6353cacd90c8256f65bd0aac98b05d55722e45e5b8b1aea", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-derivation2-FAIL-c42.provn", + "sha256": "4a2d8fcfb41da49f608c99f53894f9ab7b1f5f135b7bace08f794eaed1010341", + "verdict": "FAIL", + "answer": "invalid 42" + }, + { + "file": "ordering-derivation3-PASS-c41-c42.provn", + "sha256": "3a4f6ad74a4b7e0e5912b799efe274c1645cecfbbc5988c25cf92b53867b4aa4", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-ends1-PASS-c44.provn", + "sha256": "ac27e8e8e07bf8784e9075bd2c19e6726ee1380b2ebe36a706e9cec9a19fd456", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-entity1-PASS-c36-c37-c38.provn", + "sha256": "fc7878e9c52596932f8f781c2f1b6a0bf64244fa00226df869c17f6585678e1f", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-entity2-PASS-c36.provn", + "sha256": "cbedef529a44d67b418cec15a7942948dbeca7c8e7084b7377a47b81ffbcaf61", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-entity3-PASS-c39.provn", + "sha256": "9df13cfa38ea166249d17938ec799cdef17c7357ebf31d763793057bbaf602be", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-entity4-PASS-c40.provn", + "sha256": "ddc25ef9066d239990bc14312194a6b809ad2d6db6843cdf75439ca00ad0f446", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-specialization1-PASS-c45.provn", + "sha256": "d77ff8316daf1f19ee7db1ff57704794411c528bfccf566572f3a2e706df52c2", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-specialization2-PASS-c46.provn", + "sha256": "25611268bbae6f00d1b4d5b2a3f46acc7b1adea064963732e40d2c0bb783995e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-specialization3-PASS-c42-c45.provn", + "sha256": "aab23ed9bcd7907000e1a576653e603ef0f05df561062047eaecb1beb7782bb1", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "ordering-specialization4-FAIL-c42-c45.provn", + "sha256": "90df6a1b2d11ee777add7deff5fecf2e3fda7171ac2e02e3c607fad0e3032522", + "verdict": "FAIL", + "answer": "invalid 42 45" + }, + { + "file": "ordering-starts1-PASS-c43.provn", + "sha256": "c11a4d3ceaad5ef8f0c22eaa1d9e2fe4aabeed3653b1a3e84ff5af2fc6b65399", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "prov-o-property-hadGeneration-FAIL-c51-DM.provn", + "sha256": "714ac0371bf32afb9b729a36f49c05a4ca8d04a6c35f92cb505eab71164c60ef", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "prov-o-property-hadUsage-FAIL-c51-DM.provn", + "sha256": "ece2212f6d22a526cd3e33849aec97e3f3b85e0eb8d2c04748f875b8b6fb6b1b", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "type-collection-FAIL-c56.provn", + "sha256": "5e487fbeea147d0f86de7079bce5a2ca249049470deb0ff696b562e6326112d8", + "verdict": "FAIL", + "answer": "invalid 56" + }, + { + "file": "type-f1-FAIL-c50-c55.provn", + "sha256": "fbc7ae4626c042dec6844858429c47fd94c7754b495d92e0907f2fbe71ca12bd", + "verdict": "FAIL", + "answer": "invalid 55" + }, + { + "file": "type-f2-FAIL-c50-c55.provn", + "sha256": "4064f5bef5da086202ae9a5fa4f6d54f6c38ffe936429c1df8d4b205816cf92d", + "verdict": "FAIL", + "answer": "invalid 55" + }, + { + "file": "type-f3-FAIL-c54.provn", + "sha256": "318ae3b5897a8eac3be0a7acef8d1a681727e468b3ce6e36411daf8ed45a5577", + "verdict": "FAIL", + "answer": "invalid 54" + }, + { + "file": "type-f4-FAIL-c53.provn", + "sha256": "0883902b41118c4f22e818f68280285ca0ba9a662ef482c05874198e37b471fd", + "verdict": "FAIL", + "answer": "invalid 23 53" + }, + { + "file": "type-s1-PASS-c50-c55.provn", + "sha256": "092f06030f0ac34bfa4e2a86ca9f5870341749c6b50296222051ff09ecfea127", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "type-s2-PASS-c50-c55.provn", + "sha256": "c480a25f475331dc624788801fb216ec431179f93d38dced9911a73c30bd4a18", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-end-f1-FAIL-c29.provn", + "sha256": "b7983b8e207c91af262e6408337ff123073babda46cb06241e7c5b2b4c2e26cc", + "verdict": "FAIL", + "answer": "invalid 29" + }, + { + "file": "unification-activity-end-s1-PASS-c29.provn", + "sha256": "c6a34dc06a6446a589ed46f871b81972b003b779469904bd23644fc5cfec052f", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-s1-PASS-c22.provn", + "sha256": "7b5744ef3e0ccb44a354897e3af426f8107b3b59bd8527c9c3d6e765a27dde17", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-s2-PASS-c22.provn", + "sha256": "5cd9187cc95f96857990a11e2305ecbb1395277adfb68921aab05822f7c7a6ae", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-s3-PASS-c22.provn", + "sha256": "b820ef751453bb7e4720d36d08f798c7b01f0bf03abda92277932fe2e9b4001f", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-s4-PASS-c22.provn", + "sha256": "b11949051e4f09caa8343a3947c171a6f9f041a0bdf3fb7298ead2e109b88a9f", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-activity-start-f1-FAIL-c28.provn", + "sha256": "286e2e87f774edd00106822c16461590b7f54959f7b629d3521e93234452ea65", + "verdict": "FAIL", + "answer": "invalid 28" + }, + { + "file": "unification-activity-start-s1-PASS-c28.provn", + "sha256": "4997cfc625642dfa70b1482a07a0977cfd6502e0c74e2ed374868a70161c9228", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-association-f1-FAIL-c23.provn", + "sha256": "8a94e38c200ca15ef8c8ae08966c952ef7d75e04cd22ef5fab18c0c891407fea", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-association-f2-FAIL-c23.provn", + "sha256": "18e33158ac4929fc8032312ffea7e8e259d763e735c323e02b7400e1d45a0a7f", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-association-f3-FAIL-c23.provn", + "sha256": "d332b9f131cdef7f1ca464a1a160fd7a8d22d24b0e4be20c804a3b09fd00d468", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-association-f4-FAIL-c23.provn", + "sha256": "e4f9e83af53ca681281d53383ab3da025b73c58ba2c01e33eb4f19708b9fd7c1", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-association-f5-FAIL-c23.provn", + "sha256": "8684b343c888b8de2d72f8d6d0467338dca3b92720d5a255410aff4661bb8c11", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-association-f6-FAIL-DM.provn", + "sha256": "93bc3f4ee29074927490d6ac9d05d40733ec72fcdbe7c15e2e2561df9095e0f6", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-association-s1-PASS-c23.provn", + "sha256": "d1f834c050400d233c963b9e4bf92dd767f8e49379a2a9566ebea575c2bf8886", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-association-s2-PASS-c23.provn", + "sha256": "58d3f37965d94833e17033aa7497fee63f95d69907273239555769a56c35af38", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-association-s3-PASS-c23.provn", + "sha256": "786fca9c9a2d6ab9199dd2ab8351cd64106350de9fd67d6e8ad449f1fe9f6b17", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-association-s4-PASS-c23.provn", + "sha256": "786fca9c9a2d6ab9199dd2ab8351cd64106350de9fd67d6e8ad449f1fe9f6b17", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-association-s5-PASS-c23.provn", + "sha256": "e8905e9d6cf642a1669d9967a33abf38ce0270ff1384c03b28c460222f48a3d9", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-activity-s1-PASS-c22.provn", + "sha256": "5504d694f2ce5d7e6b9f068acd7d599b752cdf0184f3afeddd45017c4ddb41a7", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-end-s1-PASS-c23.provn", + "sha256": "d16e054420d708f81e5eb0d7ddd9057aa4ec899c37ca7f53bd098fa59853bddb", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-end-s2-PASS-c23.provn", + "sha256": "b5ac3b13040273dc900b3c8295697e9bbe093b416268e1af06f777cf82e57a5e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-entity-s1-PASS-c22.provn", + "sha256": "1803e5e900a47113591e0918a965c5fca3f81d1a9078986da639d73937757177", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-start-s1-PASS-c23.provn", + "sha256": "beb4cde4e009efaf3a32f15a2ab98d1e7fab8b264a43fe7c0c819f742a82cea4", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attributes-start-s2-PASS-c23.provn", + "sha256": "9d62962259a9a894590fe4393dc8f83355af51e156331ef1c8363aad17767221", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attribution-f1-FAIL-DM.provn", + "sha256": "c3d71bf1157efdeb0cd8e09853fe8c326e6638ea50a5d2891d2018d8b5704476", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-attribution-f2-FAIL-DM.provn", + "sha256": "464e7e59554659a12d7a41ed16ed5a523e433b86cf45eca3aab84e398e787f9f", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-attribution-s1-PASS-c23.provn", + "sha256": "03f898ae016d4448bbb89b35328e8817786d119758a947a11af229ebcd129963", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attribution-s2-PASS-c23.provn", + "sha256": "51d41d02654fc81a7e4090f774658521087b2915e426dab3f0373b3d01a6157e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attribution-s3-PASS-c23.provn", + "sha256": "e4c6fcd30f9763a16c0cb7552f2298c326e2e41b24a9e8a112f9fb7fb7f7f752", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-attribution-s4-PASS-c23.provn", + "sha256": "de2b097e6602e7ca17eab78743c88aac9da554882679a2bcdb0d9f9b0b938e1a", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-bundle-f1-FAIL-c55-c56.provn", + "sha256": "0f58c6644058f015321626fe788d90840e2e68d31a5fd0d17b52279ed9193d6b", + "verdict": "FAIL", + "answer": "invalid 55 56" + }, + { + "file": "unification-communication-f1-FAIL-DM.provn", + "sha256": "bf58bc4d9c54162ac8611ca8f59a28158693318f6386e94f632ec5ee9f347492", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-communication-f2-FAIL-DM.provn", + "sha256": "1d20f122f14c8b2095e237831dc3ba43ade39e0f1c90370af546724ca796df1d", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-communication-s1-PASS-c23.provn", + "sha256": "db8a8f4d8006860070c7ba1150982d55555c8eb10072369a45785909bbfb8145", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-communication-s2-PASS-c23.provn", + "sha256": "bda78db0dd65cd838c381b49bc5a256ddf24d6d96bb120528fd235a44780be8c", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-communication-s3-PASS-c23.provn", + "sha256": "b84583875d331ed8b823bae8166ddda4914739fb9e48f7c4ca2e26dae82e1ebe", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-communication-s4-PASS-c23.provn", + "sha256": "4d24db589b5595b08edbe03de7678da55addfc013ab20f0bca6f14ff02461718", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-delegation-f1-FAIL-c23.provn", + "sha256": "10d29e4444ccbfbed2ae5335a19e00f4ba69b7c8c081a2b4f21cf10d8f9a8277", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-delegation-f2-FAIL-c23.provn", + "sha256": "7eb7d52d901ad4e8560b3ecbc69148dfd9b9d7589ed4e7db25a0cf66668e841b", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-delegation-f3-FAIL-c23.provn", + "sha256": "4fd4a9ca7de15605d0e54d49776e4a55abbe2c2336809c9d94dd0dc06f113282", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-delegation-f6-FAIL-DM.provn", + "sha256": "eb72569a97a68aedc6f68c28a0878121316f773365f97bc0fbd2da9b15e04a80", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-delegation-s1-PASS-c23.provn", + "sha256": "9d1722a9fc8dcff0e7f98a5aabe117f70a48f969f7e83f6c1f6755f174ba671d", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-delegation-s2-PASS-c23.provn", + "sha256": "dfa30539071ca49283b770da97896acce158bbce322cfc10977a38a09c24f48a", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-delegation-s3-PASS-c23.provn", + "sha256": "f7de0050dadcd95746368050e198b24c65489bd83a3d058d01af5894bd2fc124", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-delegation-s4-PASS-c23.provn", + "sha256": "f7de0050dadcd95746368050e198b24c65489bd83a3d058d01af5894bd2fc124", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-delegation-s5-PASS-c23.provn", + "sha256": "6d7a172ff3e3005efa5467304da09a117bfd90544eb23cc0cc263f4cc3e9e80b", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-derivation-f1-FAIL-c23.provn", + "sha256": "81079667ac7711ed39b5931d152bda1c80637fc1b2f096a5d6012c7c393a878a", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-derivation-f2-FAIL-c23.provn", + "sha256": "b2e39720a2c26b3a710057201ea49b9fd7548703fd78ae90b2b802fa61b63e89", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-derivation-f3-FAIL-c23.provn", + "sha256": "65309533dce5dc8644df38fef08c2dcb144c87661db3e0f83ffb1fd55176afba", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-derivation-f4-FAIL-c23.provn", + "sha256": "cd05ff844edde1c254f4339f0d7a867b621c2407014ffd9afb43496d5e247c98", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-derivation-s1-PASS-c23.provn", + "sha256": "1556b8170d66016a8be6b1444aa7f5ca35f59043a534967c5b51468a87fcd7f1", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-derivation-s2-PASS-c23.provn", + "sha256": "90b2b6ecb858c8dd5e79a90b7f2edb40adf61d56c7ada0853ecb5a7c573a1c8d", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-derivation-s3-PASS-c23.provn", + "sha256": "073de11239b5166e58cc4dc9a4612f698e3b946059f942a8900cf7521274dcfb", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-derivation-s4-PASS-c23.provn", + "sha256": "ad8f5edc67a66b28f5e614c1fd1e1c9231e86f18faa36c0b34798477c866d300", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-derivation-s5-PASS-c23.provn", + "sha256": "e1c54c4d67553b725e3ae87f6ff5b000c339d8b905c969308b21eb712bb054e3", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-f1-FAIL-c23.provn", + "sha256": "be5308551f2e46cee2b3d2bcccb30e94c97a18f77a06d97bc032c8714f9b25f4", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-end-f2-FAIL-c23.provn", + "sha256": "cc15c763caf1d92f51205671d92e3b06d0dd61487192cf55111c8351989f6313", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-end-f3-FAIL-c23.provn", + "sha256": "0852a56aedc5b7366f3cee1cd7f879b0596a2789374f57d519cb1062628afd03", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-end-f4-FAIL-c27.provn", + "sha256": "0f18b22510e50dda46922aba29bb149e65067ff3885362b03ddf2fb2c561c812", + "verdict": "FAIL", + "answer": "invalid 27" + }, + { + "file": "unification-end-f5-FAIL-c23.provn", + "sha256": "77a1708e792eae8392d2f15e8b9bc06c1709f80806c84765073b27b0c76fa13c", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-end-s1-PASS-c27.provn", + "sha256": "2c1271ecb3493f332b0d3b9a440c3a78c184e1688ad4a185ee72b2dc779247f8", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-s2-PASS-c27.provn", + "sha256": "059f177584a2f32b5aff4be1766e172ab138f07792ae042676f1a2f403d7588d", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-s3-PASS-c27.provn", + "sha256": "c842c46d15cdf7e89ee7a310326dcb752484c2596a97b4d130b2ab037e65cf7c", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-s4-PASS-c27.provn", + "sha256": "5688383394621a2c7fbb6d9654a9e5d7636aa891bcd38c1fd62e909bee0dc4f2", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-s5-PASS-c23-c27.provn", + "sha256": "ec5bcb0b29e491fd99a26aa3e9215f68e3a7e3d9ad6f4b361a8932cfc25dde58", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-end-s6-PASS-c23-c27.provn", + "sha256": "82f8e413b9411e0d4f07a3a2258bd8b930d066fd7e66b87f521bfca94a37f9fe", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-f1-FAIL-c24.provn", + "sha256": "c3d5ee966e605dd6e2fc131f1c2fa2af35ea657d9cc238dc365f8c639b93ffd7", + "verdict": "FAIL", + "answer": "invalid 24" + }, + { + "file": "unification-generation-f2-FAIL-c23.provn", + "sha256": "f09ca1ce9a9ac6c57f9c932777ccc7e4de60e0c0f821902dad0fc2c96889a947", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-f3-FAIL-c23.provn", + "sha256": "7767ea6bacaee9ae4f638650d46ed28a63b63796a4382255b6a6800422dc3cd9", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-f4-FAIL-c23.provn", + "sha256": "d26bba26f5bb9ef42bc942b2a4b3a2e3434748e4a750fbf18a5c10aecf4d1354", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-f5-FAIL-c23.provn", + "sha256": "43dd267bbf13154078fe7cbb1ee94216ac0bba07f0562d16e550db7544b2e4bb", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-f6-FAIL-c23.provn", + "sha256": "520b2b2414108b69a27f1ab6c434b51ecb3d241d0a1dc2eefdeb1512436bfc37", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-f7-FAIL-c23.provn", + "sha256": "d5e96e7294465996cbc7b7a16208c795df7d944af6b5f1fa8a69ab7635c4a65c", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-generation-s1-PASS-c23.provn", + "sha256": "de24f9e04c366d1e1e2935ff227291074cede65fb73d986e79801ad69209527b", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s2-PASS-c23.provn", + "sha256": "7a9ace2b6ffced439e843d204f5c2b0e74648d76dab120d0ec66ebef41987465", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s3-PASS-c24.provn", + "sha256": "0b04de38466363205645928ee17b8ec9d55c1dc45d53678da738af324cfc1991", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s5-PASS-c23.provn", + "sha256": "d25d05f739e5dcbbfc60a09e3e5ebfb63b287236a6a462a09b256bfe09e55e1f", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s6-PASS-c23.provn", + "sha256": "bfaafebcb206c3333eb3ebc6de95ec38aec89b20b3bc139892b5cdbedf15d34b", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s7-PASS-c23-c24.provn", + "sha256": "4183792a919d233a95fcfadef2f38b3143c1260722bfcc23e6eb688ae1d71521", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-generation-s8-PASS-c23-c24.provn", + "sha256": "8de237f0da8ab091ae0fcf62c6d0d0bdac84a2a821173541b970d3c160bd9766", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-influence-f1-FAIL-DM.provn", + "sha256": "b5936a35463d2b14cbb1d5f8c835fd2252d36ecd8a76c8a4ad9ee6b76af18596", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-influence-f2-FAIL-DM.provn", + "sha256": "cc20fb3639530a193e83436c763b11addbda1acdcfa0146a3ca5f648dce8ae88", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-influence-s1-PASS-c23.provn", + "sha256": "76382982f3d11b0fa78edd193ec5b5f10926dd39e53b5e05885b201bedd8b3f7", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-f1-FAIL-c25.provn", + "sha256": "803f2ff7a266e8ed00967a412d9586c919a8f4cb9b7691877c8f47488a36783b", + "verdict": "FAIL", + "answer": "invalid 25" + }, + { + "file": "unification-invalidation-f2-FAIL-c23.provn", + "sha256": "ddfac868d8040c349bd2e7742774a6b700cee3ae4d423803c09b0318139d9f73", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-f3-FAIL-c23.provn", + "sha256": "db3235aa9529006383e4b4918c6cd92deca1e582d247d7bda56088fa1ca554cc", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-f4-FAIL-c23.provn", + "sha256": "f8a30421d35a5ea18195b6905e8d622314594f90994ad305c35c2b98c87b8efb", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-f5-FAIL-c23-c25.provn", + "sha256": "420f1d1419283f4aa2635e18bca31b359945bd2cedf9977e04551f45d12089c5", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-f6-FAIL-c23-c25.provn", + "sha256": "e4ce2797f747ab3d6ff898c7bfa3a2625cb6017d1b899e9db64c21e5c077f128", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-f7-FAIL-c23-c25.provn", + "sha256": "70e0cd4aee38b8025986e97c8b2a2086386d5653e50fa99acf8ad151245c58b9", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-invalidation-s1-PASS-c23.provn", + "sha256": "5ea5f005160cda1bf90b729109a4ac1f81c6c5b708dc98a9d41dafc36176a708", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s2-PASS-c23.provn", + "sha256": "b6eac938535ade57951740df3916c49424dd1950d953c27bac93b89989da0f4c", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s3-PASS-c25.provn", + "sha256": "048ff4aa6b33866e470341d143d038131e327d8143677b3efaaebba643bceb78", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s5-PASS-c23.provn", + "sha256": "c73e23899d09d8e3cfb5cfc6956ac7db62a4228eb5dad4f3cb01b49dfadffc16", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s6-PASS-c23.provn", + "sha256": "377d278f043dca46eb2b5ad5339fc13c2d3f3ecc62a8546089e4821809b607de", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s7-PASS-c23-c25.provn", + "sha256": "49453489b7643110fad47780d3d787baa6d47c505e32fc0e034b16a179a892d8", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-invalidation-s8-PASS-c23-c25.provn", + "sha256": "9039c2f631b61c6a661f0142d312071d0fb851aa592bded117581c77d5982759", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-membership-f1-FAIL-DM.provn", + "sha256": "c5fa436c297351fedb361f7424d48fd2ea2fcbbadf1b723ca985005bdb21a7b4", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-specialization-f1-FAIL-DM.provn", + "sha256": "0cac3b693198e0a84ce4d56c3dc5298224cd9346c13357bc4faf6099727734f8", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-specialization-f2-FAIL-DM.provn", + "sha256": "628b999e213c9a2620f7c327f7d6347d8d7242953d00612653755685af42665b", + "verdict": "FAIL", + "answer": "malformed" + }, + { + "file": "unification-specialization-f3-FAIL-c52.provn", + "sha256": "539dc9845af7148620117e878341e9557d06b551ee0dbd92bbb892ddfcb0b233", + "verdict": "FAIL", + "answer": "invalid 52" + }, + { + "file": "unification-specialization-f4-FAIL-c52.provn", + "sha256": "24ebb0508edd8565fe1bf01062144ecc644f9be39f9d5adaa7f700efa000b3f1", + "verdict": "FAIL", + "answer": "invalid 52" + }, + { + "file": "unification-start-f1-FAIL-c23.provn", + "sha256": "9531653f4033b180fc2dfc9ce1a667ffa063c70113964f88859eaecb45fa5989", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f2-FAIL-c23.provn", + "sha256": "424787e3ed7a5cad070c9ade19dbb214218d1ffbe086d1e3c53d2e446277b20c", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f3-FAIL-c23.provn", + "sha256": "94ac9ec8520a712c40083335106d8548e8c24c8c596afbfa25918b33f673275d", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f4-FAIL-c26.provn", + "sha256": "a01349e1c95b7fd95088d0291e9f8dfba108a05835c33bf37517d152ea5c8a9e", + "verdict": "FAIL", + "answer": "invalid 26" + }, + { + "file": "unification-start-f5-FAIL-c23.provn", + "sha256": "03ff772f946adc4282e2300f37cbd1940563af0fef6888c3635209c192e53bab", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f6-FAIL-c23.provn", + "sha256": "713b52bfe482226f919b14e976a563ab6499e58e84b104c914d79cb191919fab", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f7-FAIL-c23.provn", + "sha256": "d83a53c9ba33df698ce44c1c5398aed7cb71eafa11b05d812910e12c00358486", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-f8-FAIL-c23.provn", + "sha256": "bce6029c4a0b52a39783bc46c735e99f27eafaa932f0527f44eaeccfe2b8562b", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-start-s1-PASS-c26.provn", + "sha256": "da88a2f01a67acb0be2ea0c1a16bf4c6e92bd14aa049d9b3a32fb983f38ce24e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s2-PASS-c26.provn", + "sha256": "7375154366f35db1cb2dc705f2bfcc0977725ddd1c20a8b19841cb2a90884788", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s3-PASS-c26.provn", + "sha256": "3c01db6567eecd22602bec5707ab0415e21253ddee503908d3ba1fa0aa464c98", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s4-PASS-c26.provn", + "sha256": "0bfa4b471c297d2a4dedad019476cd404950d478e5260c2c22b788eb5a66d5e5", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s5-PASS-c23-c26.provn", + "sha256": "09be3b492d7f223b97a837ca004ea91606ac9bde013eba0505dfefb87742ab66", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s6-PASS-c23-c26.provn", + "sha256": "479f0e73c107c8fdfe8d594cdcd2e96b6fcfbe5d86812f2e975c99ed71db8045", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s7-PASS-c23-c26.provn", + "sha256": "6dc05db5c3c94f16663d78d9bb973c3bfabe15cc8413ef6deda5db2606dd9f93", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s8-PASS-c23-c26.provn", + "sha256": "5c22358902f6811ae943937a786250dcb1f57b90698966c924d219f2438d7b35", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-start-s9-PASS-c23-c26.provn", + "sha256": "3a0752099ce970b08fc53991661dc524042a1b3a953fb423df46e4864d4e46ea", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-f2-FAIL-c23.provn", + "sha256": "faee3bd15f5e9c6b86c642eef76ba01a36bc07cf0d8019fea0aa678fc54c2772", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-usage-f3-FAIL-c23.provn", + "sha256": "8749f19bf5900dac2fd36aec55e10729abefa2448c0e905a7d47ba41d769425e", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-usage-f4-FAIL-c23.provn", + "sha256": "6e779e38f102b7b67c3a0005a4454dd644ff1a29552ff4845520014ce5d0bd46", + "verdict": "FAIL", + "answer": "invalid 23" + }, + { + "file": "unification-usage-f5-PASS-c23.provn", + "sha256": "d3ae171d3b3a2b1930c85666a31acf11cdc231cf6d4ef8e5147711bf4c6cf792", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-f6-PASS-c23.provn", + "sha256": "b3a14b852871c4290e5e7b4b6d35be2617b82dafda0b854360ae0c06e17e9333", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-f7-PASS-c23.provn", + "sha256": "b3faf08bc997eeb05307a9bc266bd1749cdc3b664495be048ec5336a11c09b1e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s1-PASS-c23.provn", + "sha256": "b22a88a102952d7781d0fb1f1f85170d7bbd13aa19b8baf520fc47997442fa2e", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s2-PASS-c23.provn", + "sha256": "9e7fc76b61875389f73c008c6fadaf762ce2bb2980e482a7319e8950b4fc7ff2", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s5-PASS-c23.provn", + "sha256": "e24e1476227303166c005daa6e658f35693e1da6a678e57626ef7f85e9b28fb6", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s6-PASS-c23.provn", + "sha256": "43643c2c1f3b8e981d2eea40ece0005cadadb4a9e07f639c692c6a975973c9bf", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s7-PASS-c23.provn", + "sha256": "94845a6fd369fe4a8aada8b5eac8acf58817dd94261585a109d82916b5ae6a58", + "verdict": "PASS", + "answer": "valid" + }, + { + "file": "unification-usage-s8-PASS-c23.provn", + "sha256": "40354557ff9986b00e0f2536a7fd8a957a7c44b50c080e3d39ffb29c14449a61", + "verdict": "PASS", + "answer": "valid" + } + ], + "shown": { + "19": [ + "unification-specialization-f4-FAIL-c52" + ], + "23": [ + "unification-association-f1-FAIL-c23", + "unification-association-f2-FAIL-c23", + "unification-association-f3-FAIL-c23", + "unification-association-f4-FAIL-c23", + "unification-association-f5-FAIL-c23", + "unification-delegation-f1-FAIL-c23", + "unification-delegation-f2-FAIL-c23", + "unification-delegation-f3-FAIL-c23", + "unification-derivation-f1-FAIL-c23", + "unification-derivation-f2-FAIL-c23", + "unification-derivation-f3-FAIL-c23", + "unification-derivation-f4-FAIL-c23", + "unification-end-f1-FAIL-c23", + "unification-end-f2-FAIL-c23", + "unification-end-f3-FAIL-c23", + "unification-generation-f2-FAIL-c23", + "unification-generation-f3-FAIL-c23", + "unification-generation-f4-FAIL-c23", + "unification-generation-f5-FAIL-c23", + "unification-generation-f6-FAIL-c23", + "unification-generation-f7-FAIL-c23", + "unification-invalidation-f2-FAIL-c23", + "unification-invalidation-f3-FAIL-c23", + "unification-invalidation-f4-FAIL-c23", + "unification-invalidation-f5-FAIL-c23-c25", + "unification-invalidation-f6-FAIL-c23-c25", + "unification-invalidation-f7-FAIL-c23-c25", + "unification-start-f1-FAIL-c23", + "unification-start-f2-FAIL-c23", + "unification-start-f3-FAIL-c23", + "unification-usage-f2-FAIL-c23", + "unification-usage-f3-FAIL-c23", + "unification-usage-f4-FAIL-c23" + ], + "24": [ + "unification-generation-f1-FAIL-c24", + "unification-generation-f5-FAIL-c23", + "unification-generation-f6-FAIL-c23", + "unification-generation-f7-FAIL-c23" + ], + "25": [ + "unification-invalidation-f1-FAIL-c25", + "unification-invalidation-f5-FAIL-c23-c25", + "unification-invalidation-f6-FAIL-c23-c25", + "unification-invalidation-f7-FAIL-c23-c25" + ], + "26": [ + "unification-start-f4-FAIL-c26" + ], + "27": [ + "unification-end-f4-FAIL-c27" + ], + "28": [ + "unification-activity-start-f1-FAIL-c28" + ], + "29": [ + "unification-activity-end-f1-FAIL-c29" + ], + "42": [ + "ordering-derivation2-FAIL-c42", + "ordering-specialization4-FAIL-c42-c45" + ], + "45": [ + "ordering-specialization4-FAIL-c42-c45" + ], + "52": [ + "unification-specialization-f3-FAIL-c52", + "unification-specialization-f4-FAIL-c52" + ], + "54": [ + "type-f3-FAIL-c54" + ], + "55": [ + "type-f1-FAIL-c50-c55", + "type-f2-FAIL-c50-c55" + ], + "56": [ + "type-collection-FAIL-c56" + ] + }, + "examples": [ + [ + "check\ndocument\n prefix ex \n\n activity(ex:a1,-,-)\n wasStartedBy(ex:start1;ex:a1,-,-,-)\n wasEndedBy(ex:end1;ex:a1,-,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n activity(ex:a1,-,-)\n entity(ex:e1)\n\n wasStartedBy(ex:start1;ex:a1,-,-,-)\n used(ex:use1;ex:a1,ex:e1,-)\n wasEndedBy(ex:end1;ex:a1,-,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n activity(ex:a1,-,-)\n entity(ex:e1)\n wasStartedBy(ex:start1;ex:a1,-,-,-)\n wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\n wasEndedBy(ex:end1;ex:a1,-,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nentity(ex:e1)\nentity(ex:e2)\nwasStartedBy(ex:start1;ex:a1,ex:e1,-,-)\nwasStartedBy(ex:start2;ex:a1,ex:e2,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nentity(ex:e1)\nentity(ex:e2)\nwasEndedBy(ex:end1;ex:a1,ex:e1,-,-)\nwasEndedBy(ex:end2;ex:a1,ex:e2,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a,-,-)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nentity(ex:ag)\nagent(ex:ag)\nentity(ex:e1)\nentity(ex:e2)\nwasAssociatedWith(ex:assoc;ex:a,ex:ag,-)\nwasStartedBy(ex:start1;ex:a,ex:e1,-,-)\nwasGeneratedBy(ex:gen1;ex:ag,ex:a1,-)\nwasInvalidatedBy(ex:inv1;ex:ag,ex:a2,-)\nwasEndedBy(ex:end1;ex:a,ex:e2,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n activity(ex:a,-,-)\n activity(ex:ag)\n\n agent(ex:ag)\n entity(ex:e1)\n entity(ex:e2)\n entity(ex:e3)\n entity(ex:e4)\n\n wasAssociatedWith(ex:assoc;ex:a,ex:ag,-)\n wasStartedBy(ex:start1;ex:a,ex:e1,-,-)\n wasStartedBy(ex:start2;ex:ag,ex:e3,-,-)\n wasEndedBy(ex:end2;ex:ag,ex:e4,-,-)\n wasEndedBy(ex:end1;ex:a,ex:e2,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nentity(ex:ag)\nagent(ex:ag)\nentity(ex:e)\nwasAttributedTo(ex:attr;ex:e, ex:ag)\nwasGeneratedBy(ex:gen1;ex:ag,ex:a1,-)\nwasGeneratedBy(ex:gen2;ex:e,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nactivity(ex:ag,-,-)\nagent(ex:ag)\nentity(ex:e)\nwasAttributedTo(ex:attr;ex:e, ex:ag)\nwasStartedBy(ex:start1;ex:ag,-,ex:a1,-)\nwasGeneratedBy(ex:gen2;ex:e,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n activity(ex:a1,-,-)\n activity(ex:a2,-,-)\n wasInformedBy(ex:inf1; ex:a1, ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:ag1)\nagent(ex:ag1)\nentity(ex:ag2)\nagent(ex:ag2)\nactedOnBehalfOf(ex:del;ex:ag2,ex:ag1,-)\nwasGeneratedBy(ex:gen1;ex:ag1,-,-)\nwasInvalidatedBy(ex:inv2;ex:ag2,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:ag1,-,-)\nagent(ex:ag1)\nactivity(ex:ag2,-,-)\nagent(ex:ag2)\nactedOnBehalfOf(ex:del;ex:ag2,ex:ag1,-)\nwasStartedBy(ex:start1;ex:ag1,-,-,-)\nwasEndedBy(ex:end2;ex:ag2,-,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nused(ex:use1;ex:a1,ex:e1,-)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a1, ex:gen2, ex:use1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nactivity(ex:a3,-,-)\nactivity(ex:a4,-,-)\nwasGeneratedBy(ex:gen2;ex:e2,ex:a3,-)\nwasEndedBy(ex:end2;ex:a2,ex:e2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,-,-)\nwasInvalidatedBy(ex:inv1;ex:e1,ex:a4,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nactivity(ex:a3,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nused(ex:use1;ex:a2,ex:e1,-)\nwasInvalidatedBy(ex:inv1;ex:e1,ex:a3,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nactivity(ex:a3,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:inv1;ex:e1,ex:a3,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen2;ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInvalidatedBy(ex:inv1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:inv2;ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nspecializationOf(ex:e2,ex:e1)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nspecializationOf(ex:e2,ex:e1)\nwasInvalidatedBy(ex:inv2;ex:e2,-,-)\nwasInvalidatedBy(ex:inv1;ex:e1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nspecializationOf(ex:e2,ex:e1)\nwasGeneratedBy(ex:gen2;ex:e2,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nactivity(ex:a3,-,-)\nactivity(ex:a4,-,-)\nwasGeneratedBy(ex:gen2;ex:e2,ex:a3,-)\nwasStartedBy(ex:start2;ex:a2,ex:e2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,-,-)\nwasInvalidatedBy(ex:inv1;ex:e1,ex:a4,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n entity(ex:e1, [prov:type='ex:test1'])\n activity(ex:a1, -, -, [prov:type='ex:test2'])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n entity(ex:e1, [prov:type='ex:test1', prov:type='prov:Bundle'])\n agent(ex:e1, [prov:type='ex:test2', prov:type='prov:SoftwareAgent', prov:type=\"http://www.w3.org/ns/prov#Person\" %% xsd:anyURI, prov:type=\"http://openprovenance.org/validation/type/Organization\" %% xsd:anyURI, prov:type=\"prov:Activity\" %% xsd:string])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,2012-11-16T17:05:00)\nwasEndedBy(ex:end1;ex:a1,-,-,2012-11-16T17:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n prefix ex \n\n activity(ex:a1,-,-)\n activity(ex:a1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,2012-11-16T17:05:00)\nactivity(ex:a1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,2012-11-16T17:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,2012-11-16T16:05:00,-)\nactivity(ex:a1,-,2012-11-16T17:05:00)\nwasStartedBy(ex:start1;ex:a1,-,-,2012-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc2;ex:a1,ex:ag1,ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:assoc1;ex:a1,-,ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='prov:Plan'])\nactivity(ex:a1,-,-)\nagent(ex:ag1)\nwasAssociatedWith(ex:a1,ex:ag1,ex:e1)\nwasAssociatedWith(ex:a1,ex:ag1,ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-,[prov:type='ex:test1'])\nactivity(ex:a1,-,-,[prov:type='ex:test2'])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test1'])\nwasEndedBy(ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test2'])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00,[prov:type='ex:test1'])\nwasEndedBy(ex:a1,ex:e1,ex:a2,-,[prov:type=\"ex:test1\" %% xsd:string])\nwasEndedBy(ex:end1;ex:a1,-,ex:a2,-,[prov:type=\"1\" %% xsd:int])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1,[prov:type='ex:test1'])\nentity(ex:e1,[prov:type='ex:test2'])\nactivity(ex:a1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test1'])\nwasStartedBy(ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test2'])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00,[prov:type='ex:test1'])\nwasStartedBy(ex:a1,ex:e1,ex:a2,-,[prov:type=\"ex:test1\" %% xsd:string])\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,-,[prov:type=\"1\" %% xsd:int])\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:del1;ex:e1, ex:ag2)\nwasAttributedTo(ex:del1;ex:e1, ex:ag2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:del1;ex:e1, ex:ag2)\nwasAttributedTo(ex:del2;ex:e1, ex:ag2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:e1, ex:ag2)\nwasAttributedTo(ex:del2;ex:e1, ex:ag2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nagent(ex:ag2)\nwasAttributedTo(ex:e1, ex:ag2)\nwasAttributedTo(ex:e1, ex:ag2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:inf1;ex:a1,ex:a2)\nwasInformedBy(ex:inf1;ex:a1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:inf1;ex:a1,ex:a2)\nwasInformedBy(ex:inf2;ex:a1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:a1,ex:a2)\nwasInformedBy(ex:inf2;ex:a1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasInformedBy(ex:a1,ex:a2)\nwasInformedBy(ex:a1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:del2;ex:ag2,ex:ag1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:a2,-,-)\nagent(ex:ag2)\nagent(ex:ag1)\nactedOnBehalfOf(ex:ag2,ex:ag1,ex:a2)\nactedOnBehalfOf(ex:ag2,ex:ag1,ex:a2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, -)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, ex:use)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nentity(ex:e2)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use)\nwasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:a1,-,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:a1,-,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:a1,-,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,-,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00)\nwasEndedBy(ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00)\nwasEndedBy(ex:a1,ex:e1,ex:a2,-)\nwasEndedBy(ex:end1;ex:a1,-,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:e1,ex:a1,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nwasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:gen1;ex:e1,ex:a1,-)\nwasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\n\n prefix ex \n\n wasInfluencedBy(ex:infl1;ex:x1, ex:x2)\n wasInfluencedBy(ex:infl1;ex:x1, ex:x2)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:e1,ex:a1,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00)\nwasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-)\nwasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:a1,-,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:a1,-,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:a1,-,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00)\nwasStartedBy(ex:a1,ex:e1,ex:a2,-)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nentity(ex:e1)\nactivity(ex:a1,-,-)\nactivity(ex:a2,-,-)\nwasStartedBy(ex:start1;ex:a1,-,-,-)\nwasStartedBy(ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00)\nwasStartedBy(ex:start1;ex:a1,-,ex:a2,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:e1,ex:a1,2012-11-16T16:05:00)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:e1,ex:a1,2012-11-16T16:05:00)\nused(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1,2012-11-16T16:05:00)\nused(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,-,-)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00)\nused(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ], + [ + "check\ndocument\nprefix ex \nactivity(ex:e1,-,-)\nentity(ex:a1)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:use1;ex:e1,ex:a1,-)\nused(ex:e1,ex:a1,2011-11-16T16:05:00)\nendDocument\n", + "valid" + ] + ] +} diff --git a/app/specs/standards/debt/w3c-prov-constraints.json b/app/specs/standards/debt/w3c-prov-constraints.json new file mode 100644 index 00000000..de987503 --- /dev/null +++ b/app/specs/standards/debt/w3c-prov-constraints.json @@ -0,0 +1,44 @@ +[ + "w3c-prov-constraints-1", + "w3c-prov-constraints-10", + "w3c-prov-constraints-11", + "w3c-prov-constraints-12", + "w3c-prov-constraints-13", + "w3c-prov-constraints-14", + "w3c-prov-constraints-15", + "w3c-prov-constraints-16", + "w3c-prov-constraints-17", + "w3c-prov-constraints-18", + "w3c-prov-constraints-2", + "w3c-prov-constraints-20", + "w3c-prov-constraints-21", + "w3c-prov-constraints-22", + "w3c-prov-constraints-3", + "w3c-prov-constraints-30", + "w3c-prov-constraints-31", + "w3c-prov-constraints-32", + "w3c-prov-constraints-33", + "w3c-prov-constraints-34", + "w3c-prov-constraints-35", + "w3c-prov-constraints-36", + "w3c-prov-constraints-37", + "w3c-prov-constraints-38", + "w3c-prov-constraints-39", + "w3c-prov-constraints-4", + "w3c-prov-constraints-40", + "w3c-prov-constraints-41", + "w3c-prov-constraints-43", + "w3c-prov-constraints-44", + "w3c-prov-constraints-46", + "w3c-prov-constraints-47", + "w3c-prov-constraints-48", + "w3c-prov-constraints-49", + "w3c-prov-constraints-5", + "w3c-prov-constraints-50", + "w3c-prov-constraints-51", + "w3c-prov-constraints-53", + "w3c-prov-constraints-6", + "w3c-prov-constraints-7", + "w3c-prov-constraints-8", + "w3c-prov-constraints-9" +] diff --git a/app/specs/standards/register/w3c-prov-constraints.json b/app/specs/standards/register/w3c-prov-constraints.json new file mode 100644 index 00000000..b0a401bb --- /dev/null +++ b/app/specs/standards/register/w3c-prov-constraints.json @@ -0,0 +1,84 @@ +{ + "key": "w3c-prov-constraints", + "title": "W3C Constraints of the PROV Data Model (PROV-CONSTRAINTS), Recommendation 30 April 2013", + "issuer": "W3C", + "text": { + "url": "https://www.w3.org/TR/2013/REC-prov-constraints-20130430/", + "sha256": "0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287" + }, + "inventories": [ + { + "generated": "test/standards/generated/w3c-prov-constraints.jsonl", + "vendored": "app/specs/standards/texts/0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287", + "source": { + "url": "https://www.w3.org/TR/2013/REC-prov-constraints-20130430/", + "sha256": "0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287" + } + } + ], + "governs": [ + "app/src/PrismProv.lex.tex", + "site/prov/guest.mjs" + ], + "realizedBy": [ + "ST-01" + ], + "enforcedBy": { + "w3c-prov-constraints-19": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-specialization-f4-FAIL-c52.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 52', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-23": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-association-f1-FAIL-c23.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 23', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-24": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-generation-f1-FAIL-c24.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 24', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-25": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-invalidation-f1-FAIL-c25.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 25', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-26": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-start-f4-FAIL-c26.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 26', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-27": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-end-f4-FAIL-c27.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 27', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-28": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-activity-start-f1-FAIL-c28.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 28', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-29": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-activity-end-f1-FAIL-c29.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 29', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-42": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case ordering-derivation2-FAIL-c42.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 42', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-45": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case ordering-specialization4-FAIL-c42-c45.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 42 45', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-52": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case unification-specialization-f3-FAIL-c52.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 52', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-54": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case type-f3-FAIL-c54.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 54', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-55": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case type-f1-FAIL-c50-c55.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 55', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + }, + "w3c-prov-constraints-56": { + "suite": "crates/conformance/tests/guests.rs", + "how": "W3C's case type-collection-FAIL-c56.provn, byte for byte as W3C serves it (app/specs/prov/invalid/spec.json), is an acceptance vector of the prov-invalid guest answered 'invalid 56', and the checker answers 'valid' for it once this rule is switched off (app/specs/prov/spec.json 'shown'); prismpm build runs it and GU-01 holds the pinned wasm to those vectors" + } + } +} diff --git a/app/specs/standards/register/w3c-prov-n.json b/app/specs/standards/register/w3c-prov-n.json new file mode 100644 index 00000000..67fd10d0 --- /dev/null +++ b/app/specs/standards/register/w3c-prov-n.json @@ -0,0 +1,11 @@ +{ + "key": "w3c-prov-n", + "title": "W3C PROV-N: The Provenance Notation, Recommendation 30 April 2013", + "issuer": "W3C", + "text": null, + "unpinned": "PrismProv reads PROV-N (the Recommendation is kept at app/specs/standards/texts/c7320ed45cc643eca0819b0616835529dfb35dc819eaf50deaf209ee1e974e49 and W3C's PROV-N constraint cases are its reader's acceptance vectors), but its grammar productions and the semantic rules of its Table 2 need an extractor before they are requirements here", + "governs": [], + "realizedBy": [ + "ST-01" + ] +} diff --git a/app/specs/standards/texts/03f898ae016d4448bbb89b35328e8817786d119758a947a11af229ebcd129963 b/app/specs/standards/texts/03f898ae016d4448bbb89b35328e8817786d119758a947a11af229ebcd129963 new file mode 100644 index 00000000..07fcee52 --- /dev/null +++ b/app/specs/standards/texts/03f898ae016d4448bbb89b35328e8817786d119758a947a11af229ebcd129963 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:del1;ex:e1, ex:ag2) +wasAttributedTo(ex:del1;ex:e1, ex:ag2) +endDocument diff --git a/app/specs/standards/texts/03ff772f946adc4282e2300f37cbd1940563af0fef6888c3635209c192e53bab b/app/specs/standards/texts/03ff772f946adc4282e2300f37cbd1940563af0fef6888c3635209c192e53bab new file mode 100644 index 00000000..de47b001 --- /dev/null +++ b/app/specs/standards/texts/03ff772f946adc4282e2300f37cbd1940563af0fef6888c3635209c192e53bab @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/048ff4aa6b33866e470341d143d038131e327d8143677b3efaaebba643bceb78 b/app/specs/standards/texts/048ff4aa6b33866e470341d143d038131e327d8143677b3efaaebba643bceb78 new file mode 100644 index 00000000..eda39df5 --- /dev/null +++ b/app/specs/standards/texts/048ff4aa6b33866e470341d143d038131e327d8143677b3efaaebba643bceb78 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/059f177584a2f32b5aff4be1766e172ab138f07792ae042676f1a2f403d7588d b/app/specs/standards/texts/059f177584a2f32b5aff4be1766e172ab138f07792ae042676f1a2f403d7588d new file mode 100644 index 00000000..ae959656 --- /dev/null +++ b/app/specs/standards/texts/059f177584a2f32b5aff4be1766e172ab138f07792ae042676f1a2f403d7588d @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:a1,-,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/073de11239b5166e58cc4dc9a4612f698e3b946059f942a8900cf7521274dcfb b/app/specs/standards/texts/073de11239b5166e58cc4dc9a4612f698e3b946059f942a8900cf7521274dcfb new file mode 100644 index 00000000..1ee431ef --- /dev/null +++ b/app/specs/standards/texts/073de11239b5166e58cc4dc9a4612f698e3b946059f942a8900cf7521274dcfb @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, -) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -) +endDocument diff --git a/app/specs/standards/texts/0852a56aedc5b7366f3cee1cd7f879b0596a2789374f57d519cb1062628afd03 b/app/specs/standards/texts/0852a56aedc5b7366f3cee1cd7f879b0596a2789374f57d519cb1062628afd03 new file mode 100644 index 00000000..5646b457 --- /dev/null +++ b/app/specs/standards/texts/0852a56aedc5b7366f3cee1cd7f879b0596a2789374f57d519cb1062628afd03 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2-other,-) +endDocument diff --git a/app/specs/standards/texts/0883902b41118c4f22e818f68280285ca0ba9a662ef482c05874198e37b471fd b/app/specs/standards/texts/0883902b41118c4f22e818f68280285ca0ba9a662ef482c05874198e37b471fd new file mode 100644 index 00000000..27093c21 --- /dev/null +++ b/app/specs/standards/texts/0883902b41118c4f22e818f68280285ca0ba9a662ef482c05874198e37b471fd @@ -0,0 +1,6 @@ +document + prefix ex + + wasGeneratedBy(ex:gen; ex:e3, ex:a4, -) + used(ex:gen; ex:a4, ex:e5, -) +endDocument diff --git a/app/specs/standards/texts/092f06030f0ac34bfa4e2a86ca9f5870341749c6b50296222051ff09ecfea127 b/app/specs/standards/texts/092f06030f0ac34bfa4e2a86ca9f5870341749c6b50296222051ff09ecfea127 new file mode 100644 index 00000000..52cd20db --- /dev/null +++ b/app/specs/standards/texts/092f06030f0ac34bfa4e2a86ca9f5870341749c6b50296222051ff09ecfea127 @@ -0,0 +1,6 @@ +document + prefix ex + + entity(ex:e1, [prov:type='ex:test1']) + activity(ex:a1, -, -, [prov:type='ex:test2']) +endDocument diff --git a/app/specs/standards/texts/09be3b492d7f223b97a837ca004ea91606ac9bde013eba0505dfefb87742ab66 b/app/specs/standards/texts/09be3b492d7f223b97a837ca004ea91606ac9bde013eba0505dfefb87742ab66 new file mode 100644 index 00000000..88efae64 --- /dev/null +++ b/app/specs/standards/texts/09be3b492d7f223b97a837ca004ea91606ac9bde013eba0505dfefb87742ab66 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/0b04de38466363205645928ee17b8ec9d55c1dc45d53678da738af324cfc1991 b/app/specs/standards/texts/0b04de38466363205645928ee17b8ec9d55c1dc45d53678da738af324cfc1991 new file mode 100644 index 00000000..8e4bf55e --- /dev/null +++ b/app/specs/standards/texts/0b04de38466363205645928ee17b8ec9d55c1dc45d53678da738af324cfc1991 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/0bfa4b471c297d2a4dedad019476cd404950d478e5260c2c22b788eb5a66d5e5 b/app/specs/standards/texts/0bfa4b471c297d2a4dedad019476cd404950d478e5260c2c22b788eb5a66d5e5 new file mode 100644 index 00000000..0456b400 --- /dev/null +++ b/app/specs/standards/texts/0bfa4b471c297d2a4dedad019476cd404950d478e5260c2c22b788eb5a66d5e5 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:a1,-,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/0cac3b693198e0a84ce4d56c3dc5298224cd9346c13357bc4faf6099727734f8 b/app/specs/standards/texts/0cac3b693198e0a84ce4d56c3dc5298224cd9346c13357bc4faf6099727734f8 new file mode 100644 index 00000000..32eb24ab --- /dev/null +++ b/app/specs/standards/texts/0cac3b693198e0a84ce4d56c3dc5298224cd9346c13357bc4faf6099727734f8 @@ -0,0 +1,10 @@ +document + +prefix ex + +entity(ex:e1) +entity(ex:e2) + +specializationOf(ex:e2, -) + +endDocument diff --git a/app/specs/standards/texts/0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287 b/app/specs/standards/texts/0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287 new file mode 100644 index 00000000..3ad3e553 --- /dev/null +++ b/app/specs/standards/texts/0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287 @@ -0,0 +1,5486 @@ + + + + Constraints of the PROV Data Model + + + + + + + + + + + + + + + + + + + + + +
+

+ + W3C + +

+

Constraints of the PROV Data Model

+ +

W3C Recommendation 30 April 2013

+
+ +
This version:
+
http://www.w3.org/TR/2013/REC-prov-constraints-20130430/
+
Latest published version:
+
http://www.w3.org/TR/prov-constraints/
+ + + +
Test suite:
+
http://dvcs.w3.org/hg/prov/raw-file/default/testcases/process.html
+ + +
Implementation report:
+
http://www.w3.org/TR/2013/NOTE-prov-implementations-20130430/
+ + + +
Previous version:
+
http://www.w3.org/TR/2013/PR-prov-constraints-20130312/ (color-coded diff)
+ + +
Editors:
+
James Cheney, University of Edinburgh
+
Paolo Missier, Newcastle University
+
Luc Moreau, University of Southampton
+ + +
Author:
+
Tom De Nies, iMinds - Ghent University
+ + +
+ +

+ Please refer to the errata for this document, which may include some normative corrections. +

+ + + +

+ The English version of this specification is the only normative version. Non-normative + translations may also be available. +

+ + + + + + +
+
+ +

Abstract

+

+Provenance is information about entities, activities, and people +involved in producing a piece of data or thing, which can be used to +form assessments about its quality, reliability or +trustworthiness. PROV-DM is the conceptual data model that forms a +basis for the W3C provenance (PROV) family of specifications. + +

+ + +

This document defines a subset of PROV instances called +valid PROV instances, by analogy with notions of +validity for other Web standards. +The intent of validation is to ensure that a PROV instance represents a +consistent history of objects and their interactions that is safe to +use for the purpose of logical reasoning and other kinds of analysis. +Valid PROV instances satisfy +certain definitions, inferences, and +constraints. These definitions, inferences, and constraints +provide a measure of consistency checking for provenance and reasoning +over provenance. They can also be used to normalize PROV instances to forms that can easily be +compared in order to determine whether two PROV instances are +equivalent. Validity and equivalence are also defined for PROV +bundles (that is, named instances) and documents (that is, a toplevel +instance together with zero or more bundles).

+

The PROV Document Overview describes the overall state of PROV, and should be read before other PROV documents.

+

Status of This Document

+ + + +

+ This section describes the status of this document at the time of its publication. Other + documents may supersede this document. A list of current W3C publications and the latest revision + of this technical report can be found in the W3C technical reports + index at http://www.w3.org/TR/. +

+ +

PROV Family of Documents

+This document is part of the PROV family of documents, a set of documents defining various aspects that are necessary to achieve the vision of inter-operable +interchange of provenance information in heterogeneous environments such as the Web. These documents are listed below. Please consult the [PROV-OVERVIEW] for a guide to reading these documents. +
    +
  • PROV-OVERVIEW (Note), an overview of the PROV family of documents [PROV-OVERVIEW];
  • +
  • PROV-PRIMER (Note), a primer for the PROV data model [PROV-PRIMER];
  • +
  • PROV-O (Recommendation), the PROV ontology, an OWL2 ontology allowing the mapping of the PROV data model to RDF [PROV-O];
  • +
  • PROV-DM (Recommendation), the PROV data model for provenance [PROV-DM];
  • +
  • PROV-N (Recommendation), a notation for provenance aimed at human consumption [PROV-N];
  • +
  • PROV-CONSTRAINTS (Recommendation), a set of constraints applying to the PROV data model (this document);
  • +
  • PROV-XML (Note), an XML schema for the PROV data model [PROV-XML];
  • +
  • PROV-AQ (Note), mechanisms for accessing and querying provenance [PROV-AQ];
  • +
  • PROV-DICTIONARY (Note) introduces a specific type of collection, consisting of key-entity pairs [PROV-DICTIONARY];
  • +
  • PROV-DC (Note) provides a mapping between PROV-O and Dublin Core Terms [PROV-DC];
  • +
  • PROV-SEM (Note), a declarative specification in terms of first-order logic of the PROV data model [PROV-SEM];
  • +
  • PROV-LINKS (Note) introduces a mechanism to link across bundles [PROV-LINKS].
  • +
+ +

Endorsed By W3C

+ +

This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material or cited from another document. W3C's role in making the Recommendation is to draw attention to the specification and to promote its widespread deployment. This enhances the functionality and interoperability of the Web.

+ +

Please Send Comments

+ +

+ This document was published by the Provenance Working Group as a Recommendation. + + + If you wish to make comments regarding this document, please send them to + public-prov-comments@w3.org + (subscribe, + archives). + + + + + All comments are welcome. + + + +

+ + This document was produced by a group operating under the + 5 February 2004 W3C Patent Policy. + + + + + W3C maintains a public list of any patent disclosures + + made in connection with the deliverables of the group; that page also includes instructions for + disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains + Essential Claim(s) must disclose the + information in accordance with section + 6 of the W3C Patent Policy. + + +

+ + + + +

Table of Contents

+ + + + + +
+

1. Introduction
+

+ +

+Provenance is a record that describes the people, institutions, entities, and activities involved in producing, influencing, or delivering a piece of data or a thing. +This document complements + the PROV-DM specification [PROV-DM] that defines a data model for + provenance on the Web. This document defines a form of validation for provenance.

+ + + +
+

1.1 Conventions

+ + + +

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL + NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and + "OPTIONAL" in this document are to be interpreted as described in + [RFC2119].

+ +

In this document, logical formulas contain variables written as + lower-case identifiers. Some of these variables are written + beginning with the underscore character _, by convention, to indicate that they + appear only once in the formula. Such variables are + provided merely as an aid to the reader.

+ +
+ + +
+ +

1.2 Purpose of this document

+ +

The PROV Data Model, PROV-DM, is a conceptual data model for provenance, which is +realizable using different representations such as PROV-N and PROV-O. +A PROV instance is a set of PROV statements. +A PROV document consists of an anonymous instance, called the toplevel instance, +together with zero or more named instances, called bundles. For +example, a PROV document could be a .provn document, the result +of a query, a triple store containing PROV statements in RDF, etc. +The +PROV-DM specification [PROV-DM] imposes minimal requirements upon +PROV instances. A valid PROV instance corresponds to a +consistent history of objects and interactions to which logical +reasoning can be safely applied. PROV instances need not +be valid. +The term valid is chosen by analogy with +notions of validity in other W3C specifications. This +terminology differs from the usual meaning of "validity" in logic; +our notion of validity of a PROV instance/document is closer to +logical "consistency". +

+ +

This document specifies definitions of some +provenance statements in terms of others, inferences over PROV instances +that applications MAY employ, and also defines a class of +valid PROV instances by specifying constraints that +valid PROV instances must satisfy. There are four kinds of +constraints: uniqueness constraints, event ordering +constraints, impossibility constraints, and type +constraints. +Further discussion +of the semantics of PROV statements, which justifies the definitions, inferences +and constraints, and relates the procedural specification approach +taken here to a declarative specification, can be found in the formal semantics [PROV-SEM]. +

+ +

We define validity and equivalence in terms of a +concept called normalization. Definitions, inferences, +and uniqueness constraints can be applied to normalize PROV instances, and event ordering, typing, and +impossibility constraints can be checked on the normal form to determine +validity. Equivalence of two PROV +instances can be determined by comparing their normal forms. For PROV +documents, validity and equivalence amount to checking the validity or +pairwise equivalence of their respective instances. +

+

+This specification defines +validity and equivalence procedurally, via an algorithm based on +normalization. Applications MAY implement +validity and equivalence checking using normalization, as outlined +here. Applications MAY also implement validation and equivalence +checking in +any other way as long as the same instances or documents are considered valid or +equivalent, respectively. +

+ +

Checking validity or equivalence are RECOMMENDED, but not required, for +applications compliant with PROV. +Applications producing provenance SHOULD ensure that it is +valid, and similarly applications consuming provenance MAY reject provenance that is not valid. Applications +that are determining whether PROV instances or documents convey the same +information SHOULD check equivalence as specified here. As a +guideline, applications should +treat equivalent instances or documents in the same way. This is a +guideline only, because meaning of "in the same way" is +application-specific. For example, applications that manipulate the syntax of +PROV instances in particular representations, such as pretty-printing +or digital signing, have good reasons to treat syntactically +different, but equivalent, documents differently. +

+
+
+

1.3 Structure of this document

+ +

Section 2 gives a brief rationale +for the definitions, inferences and constraints. +

+

+Section 3 summarizes the +requirements for compliance with this document, which are specified in +detail in the rest of the document.

+

+Section 4 defines basic concepts used in the +rest of the specification.

+ +

Section 5 presents definitions and inferences. Definitions allow replacing shorthand notation in [PROV-N] +with more explicit and complete statements; inferences allow adding +new facts representing implicit knowledge about the structure of +provenance.

+ +

Section 6 presents four kinds of constraints, +uniqueness constraints that prescribe that certain statements +must be unique within PROV instances, +event ordering constraints that require that the records in a +PROV instance are consistent with a sensible ordering of events +relating the activities, entities and agents involved, +impossibility constraints that forbid certain patterns of +statements in valid PROV instances, and type constraints that +classify the types of identifiers in valid PROV instances. +

+ +

Section 7 defines the notions +of validity, equivalence and normalization. +

+ + + +
+
+

1.4 Audience

+ +

The audience for this document is the same as for [PROV-DM]: developers +and users who wish to create, process, share or integrate provenance +records on the (Semantic) Web. Not all PROV-compliant applications +need to perform inferences or check validity when processing provenance. +However, applications that create or transform provenance SHOULD +attempt to produce valid provenance, to make it more useful to other +applications by ruling out nonsensical or inconsistent information. +

+ +

This document assumes familiarity with [PROV-DM] and employs the +[PROV-N] notation. +

+ +
+
+ +
+

2. Rationale (Informative)

This section is non-normative.

+

This section gives a high-level rationale that provides some + further background for the constraints, but does not affect the +technical content of the rest of the specification.

+ +
+

2.1 Entities, Activities and Agents

This section is non-normative.

+

+One of the central challenges in representing provenance information +is how to deal with change. Real-world objects, information objects +and Web resources change over time, and the characteristics that make +them identifiable in a given situation are sometimes subject to change +as well. PROV allows for things to be described +in different ways, with different descriptions of their +state. +

+ +

+An entity is a thing one wants to provide provenance for +and whose situation in the world is described by some fixed +attributes. An entity has a lifetime, +defined as the period +between its generation event +and its invalidation event. +An entity's attributes are established when the entity is +created and (partially) describe the entity's situation and state +during the entirety of the entity's lifetime.

+ +

+A different entity (perhaps representing a different user or +system perspective) may fix other aspects of the same thing, and its provenance +may be different. Different entities that fix aspects of the same +thing are called alternates, and the PROV relations of +specializationOf and alternateOf can be used to link such entities.

+ +

Besides entities, a variety of other PROV objects and relationships carry +attributes, including activity, generation, usage, invalidation, start, end, +communication, attribution, association, delegation, and +derivation. Each object has an associated duration interval (which may +be a single time point), and attribute-value pairs for a given object +are expected to be descriptions that hold for the object's duration. +

+

+However, the attributes of entities have special meaning because they +are considered to be fixed aspects +of underlying, changing things. This motivates constraints on +alternateOf and specializationOf relating the attribute values of +different entities. +

+ +

+In order to describe the provenance of something during an interval + over which relevant attributes of the thing are not fixed, a PROV + instance would describe multiple entities, each with its own + identifier, lifetime, and fixed attributes, and express dependencies between + the various entities using events. For example, in order to + describe the provenance of several versions of a document, involving + attributes such as authorship that change over time, one can use + different entities for the versions linked by appropriate + generation, usage, revision, and invalidation events. +

+ +

There is no assumption that the set of attributes listed in an +entity statement is complete, nor +that the attributes are independent or orthogonal of each +other. Similarly, there is no assumption that the attributes of an +entity uniquely identify it. Two different entities that present the +same aspects of possibly different things can have the same +attributes; this leads to potential ambiguity, which is mitigated through the +use of identifiers.

+ +

An activity's lifetime is delimited by its start and its end +events. It occurs over +an interval delimited by two instantaneous +events. However, an activity statement need not mention start or end time information, because they may not be known. +An activity's attribute-value pairs are expected to describe the activity's situation during its lifetime. +

+ + + +

An activity is not an entity. Indeed, an entity exists in full at +any point in its lifetime, persists during this interval, and +preserves the characteristics provided. In +contrast, an activity is something that occurs, happens, unfolds, or +develops through time. This +distinction is similar to the distinction between 'continuant' and +'occurrent' in logic [Logic].

+ + +
+
+

2.2 Events

This section is non-normative.

+ +

Although time is important for provenance, provenance can be used +in many different contexts within individual systems and across the +Web. Different systems may use different clocks which may not be +precisely synchronized, so when provenance statements are combined by +different systems, an application may not be able to align the times involved to a +single global timeline. Hence, PROV is designed to minimize +assumptions about time. Instead, PROV talks about (identified) +events.

+ +

The PROV data model is implicitly based on a notion of instantaneous events (or just events), that mark +transitions in the world. Events include generation, usage, or +invalidation of entities, as well as start or end of activities. This +notion of event is not first-class in the data model, but it is useful +for explaining its other concepts and its semantics [PROV-SEM]. +Thus, events help justify inferences on provenance as well as +validity constraints indicating when provenance is + self-consistent. + + + +

Five kinds of instantaneous +events are used in PROV. The activity start +and activity end events delimit the beginning and the +end of activities, respectively. The +entity generation, entity usage, and entity +invalidation events apply to entities, and the generation and +invalidation events delimit the lifetime of an entity. More +precisely: +

+ +

An activity start event is the instantaneous event that marks the instant an activity starts.

+ +

An activity end event is the instantaneous event that marks the instant an activity ends.

+ +

An entity generation event is the instantaneous event that marks the final instant of an entity's creation timespan, after which +it is available for use. The entity did not exist before this event.

+ + +

An entity usage event is the instantaneous event that marks the first instant of +an entity's consumption timespan by an activity. The described usage +had not started before this instant, although the activity could +potentially have used the same entity at a different time.

+ + +

An entity invalidation event +is the instantaneous event that +marks the initial instant of the destruction, invalidation, or +cessation of an entity, after which the entity is no longer available +for use. The entity no longer exists after this event.

+ +
+ +
+

2.3 Types

This section is non-normative.

+ +

As set out in other specifications, the identifiers used in PROV +documents have associated type information. An identifier can have +more than one type, reflecting subtyping or allowed overlap between +types, and so we define a set of types of each identifier, typeOf(id). Some types are, however, +required not to overlap (for example, no identifier can describe both +an entity and an activity). +In addition, an identifier cannot be used to identify both an object +(that is, an entity, activity or agent) and a property (that is, a +named event such as usage, generation, or a relationship such as +attribution.) +This specification includes disjointness and typing constraints that +check these requirements. Here, we +summarize the type constraints in Table 1. +

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 1: Summary of Typing Constraints
In relation...identifierhas type(s)...
entity(e,attrs)e'entity'
activity(a,t1,t2,attrs)a'activity'
agent(ag,attrs)ag'agent'
used(id; a,e,t,attrs)e'entity'
a'activity'
wasGeneratedBy(id; e,a,t,attrs)e'entity'
a'activity'
wasInformedBy(id; a2,a1,attrs)a2'activity'
a1'activity'
wasStartedBy(id; a2,e,a1,t,attrs)a2'activity'
e'entity'
a1'activity'
wasEndedBy(id; a2,e,a1,t,attrs)a2'activity'
e'entity'
a1'activity'
wasInvalidatedBy(id; e,a,t,attrs)e'entity'
a'activity'
wasDerivedFrom(id; e2,e1,a,g,u,attrs)e2'entity'
e1'entity'
a'activity'
wasAttributedTo(id; e,ag,attr)e'entity'
ag'agent'
wasAssociatedWith(id; a,ag,pl,attrs)a'activity'
ag'agent'
pl'entity'
actedOnBehalfOf(id; ag2,ag1,a,attrs)ag2'agent'
ag1'agent'
a'activity'
alternateOf(e1,e2)e1'entity'
e2'entity'
specializationOf(e1,e2)e1'entity'
e2'entity'
hadMember(c,e)c'entity'
'prov:Collection'
e'entity'
entity(c,[prov:type='prov:EmptyCollection,...])c'entity'
'prov:Collection'
'prov:EmptyCollection'
+
+ +
+
+

2.4 Validation Process Overview

This section is non-normative.

+ + +

+ This section collects common concepts and operations that are used + throughout the specification, and relates them to background + terminology and ideas from logic [Logic], constraint programming + [CHR], and database constraints [DBCONSTRAINTS]. This section + does not attempt to provide a complete introduction to these topics, + but it is provided in order to aid readers familiar with one or more + of these topics in understanding the specification, and to clarify + some of the motivations for choices in the specification to all + readers. +

+ +

As discussed below, the definitions, inferences and constraints +can be viewed as pure logical assertions that could be checked in a +variety of ways. The rest of this document specifies validity and +equivalence procedurally, that is, in terms of a reference +implementation based on normalization. Although both declarative and +procedural specification techniques have advantages, a purely +declarative specification offers much less guidance for +implementers, while the procedural approach adopted here immediately demonstrates +implementability and provides an adequate (polynomial-time) default implementation. In +this section we relate the declarative meaning of formulas to their +procedural meaning. [PROV-SEM] provides an alternative, +declarative characterization of validity which could +be used as a starting point for other implementation strategies.

+ + + +

Constants, Variables and Placeholders

+

+ PROV statements involve identifiers, literals, + placeholders, and attribute lists. Identifiers are, according to PROV-N, expressed as qualified names which can be mapped to URIs [RFC3987]. + However, in order to specify + constraints over PROV instances, we also need variables + that represent unknown identifiers, literals, or placeholders. + These variables are similar to those in first-order + logic [Logic]. A variable is a symbol that can be replaced by + other symbols, including either other variables or constant + identifiers, literals, or placeholders. In a few special cases, we + also use variables for unknown attribute lists. + To help distinguish identifiers and variables, we also term the former 'constant identifiers' to highlight their non-variable nature. +

+ +

Several definitions and inferences conclude by saying that some + objects exist such that some other formulas hold. Such an inference + introduces fresh existential variables into the instance. An + existential variable denotes a fixed object that exists, but its + exact identity is unknown. Existential variables can stand for + unknown identifiers or literal values only; we do not allow + existential variables that stand for unknown attribute lists.

+ +

In particular, many + occurrences of the placeholder symbol - stand for unknown + objects; these are handled by expanding them to existential + variables. Some placeholders, however, indicate the absence of an + object, rather than an unknown object. In other words, the + placeholder is overloaded, with different meanings in different + places. +

+

An expression is called a term if it is either a + constant identifier, literal, placeholder, or variable. We write + t to denote an arbitrary term. +

+ + +

Substitution

+

A substitution is a function that maps variables to terms. Concretely, since we only + need to consider substitutions of finite sets of variables, we can + write substitutions as [x1 = t1,...,xn=tn]. A substitution + S = [x1 = t1,...,xn=tn] + can be applied to a term by replacing occurrences of +x_i with t_i. +

+ +

+ In addition, a substitution can be applied to an atomic formula + (PROV statement) p(t1,...,tn) by applying it to each term, + that is, S(p(t1,...,tn)) = p(S(t1),...,S(tn)). Likewise, a + substitution S can be applied to an instance I by applying + it to each atomic formula (PROV statement) in I, that is, S(I) + = {S(A) | A ∈ I}. +

+ + + + + +

Formulas

+

+ For the purpose of constraint checking, we view PROV statements + (possibly involving existential variables) as + formulas. An instance is analogous to a "theory" in + logic, that is, a set of formulas all thought to describe the same + situation. The set can also be thought of a single, large formula: + the conjunction of all of the atomic formulas. +

+

The atomic constraints considered in this specification can be + viewed as atomic formulas:

+
    +
  • Uniqueness constraints employ atomic equational formulas t = + t'.
  • +
  • Ordering constraints employ atomic precedence relations that can + be thought of as binary formulas precedes(t,t') or strictlyPrecedes(t,t') +
  • +
  • Typing constraints 'type' ∈ typeOf(id) + can be represented as a atomic formulas typeOf(id,'type'). +
  • +
  • Impossibility constraints employ the conclusion INVALID, + which is equivalent to the logical constant False.
  • +
+

Similarly, the definitions, inferences, and constraint rules in this + specification can also be viewed as logical formulas, built up out + of atomic formulas, logical connectives "and" (∧), "implies" (⇒), + and quantifiers "for all" (∀) and "there exists" (∃). For more + background on logical formulas, see a logic textbook such as [Logic].

+
    +
  • + A definition of the form "A IF AND ONLY IF there + exists y1...ym such that B1 and ... and Bk" + can be thought of as a formula ∀ x1,....,xn. A ⇔ ∃ y1...ym . B1 ∧ ... ∧ Bk, where x1...xn are the + free variables of the definition. +
  • +
  • An inference of the form "IF A1 and ... and Ap THEN there + exists y1...ym such that B1 and ... and Bk" can + be thought of as a formula ∀ x1,....,xn. A1 ∧ ... ∧ Ap ⇒ ∃ y1...ym . B1 ∧ ... ∧ Bk, where x1...xn are the + free variables of the inference. +
  • +
  • A uniqueness, ordering, or typing constraint of the form "IF A1 ∧ ... ∧ Ap THEN C" can be viewed as a formula + ∀ x1...xn. A1 ∧ ... ∧ Ap ⇒ C.
  • +
  • A constraint of the form "IF A1 ∧ ... ∧ Ap THEN INVALID" can be viewed as a formula + ∀ x1...xn. A1 ∧ ... ∧ Ap ⇒ False.
  • +
+ + +

Satisfying definitions, inferences, and constraints

+

+ In logic, a formula's meaning is defined by saying when it is + satisfied. We can view + definitions, inferences, and constraints as being satisfied or not + satisfied in a PROV instance, augmented with information about the constraints. +

+
    +
  1. A logical equivalence as used in a definition is satisfied + when the formula ∀ + x1,....,xn. A ⇔ ∃ + y1...ym . B1 ∧ ... ∧ + Bk holds, that is, for any substitution of the + variables x1,....,xn, formula A and + formula ∃ + y1...ym. B1 ∧ ... ∧ + Bk are either both true or both false. +
  2. +
  3. A logical implication as used in an inference is + satisfied when the formula ∀ + x1,....,xn. A1 ∧ ... ∧ + Ap ⇒ ∃ y1...ym . B1 ∧ + ... ∧ Bk holds, that is, for any substitution of + the variables x1,....,xn, if A1 ∧ ... ∧ + Ap is true, then + for some further substitution of terms for variables + y1...ym, formula B1 ∧ ... ∧ + Bk is also true.
  4. +
  5. A uniqueness, ordering, or typing constraint is satisfied when + its associated formula ∀ x1...xn. A1 ∧ ... ∧ Ap ⇒ C holds, that is, for any substitution of + the variables x1,....,xn, if A1 ∧ ... ∧ + Ap is true, then C is + also true.
  6. +
  7. An impossibility constraint is satisfied when the formula + ∀ x1...xn. A1 ∧ ... ∧ Ap ⇒ + False holds. This is logically equivalent to ∄ + x1...xn. A1 ∧ ... ∧ Ap, that is, there exists no + substitution for x1...xn making A1 ∧ ... ∧ Ap true. +
+ +

Unification and Merging

+ +

Unification is an operation that takes two terms and compares them to + determine whether they can be made equal by substituting an + existential variable with another term. If so, the result is such a + substitution; otherwise, the result is failure. Unification is an + essential concept in logic programming and automated reasoning, +where terms can involve variables, constants and function symbols. In PROV, + by comparison, unification only needs to deal with variables, + constants and literals. +

+

+Unifying two terms t,t' results in either substitution S + such that S(t) = S(t'), or failure indicating that there is no + substitution that can be applied to both t and t' to make + them equal. Unification is also used to define an operation on PROV + statements called merging. Merging takes two statements + that have equal identifiers, unifies their corresponding term + arguments, and combines their attribute lists. +

+ + + +

Applying definitions, inferences, and constraints

+

Formulas can also be interpreted as having computational + content. That is, if an instance does not satisfy a formula, we can + often apply the formula to the instance to produce another + instance that does satisfy the formula. Definitions, inferences, + and uniqueness constraints can be applied to instances: +

+
    +
  • + A definition of the form ∀ + x1,....,xn. A ⇔ ∃ + y1...ym . B1 ∧ ... ∧ + Bk + can be applied by searching for any occurrences of A in the instance and adding B1, ..., Bk, generating fresh existential + variables y1,...,ym, and conversely, whenever there is an + occurrence of B1, ..., Bk, adding + A. + In our setting, the defined formulas A are never used in other + formulas, so it is sufficient to replace all occurrences of + A with their definitions. The formula A is then redundant, and can be + removed from the instance. +
  • +
  • An inference of the form ∀ + x1,....,xn. A1 ∧ ... ∧ + Ap ⇒ ∃ y1...ym . B1 ∧ + ... ∧ Bk can be applied by searching for any occurrences of A1 ∧ ... ∧ + Ap in the instance and, for each such match +for which the entire conclusion does not already hold (for some y1,...,ym), +adding B1 ∧ + ... ∧ Bk to the instance, generating fresh existential + variables y1,...,ym. +
  • +
  • A uniqueness constraint of the form ∀ +x1...xn. A1 ∧ ... ∧ Ap ⇒ t += t' can be + applied by searching for an occurrence A1 ∧ ... ∧ Ap in the instance, and + if one is found, unifying the terms t and +t'. If successful, the resulting +substitution is applied to the instance; otherwise, the application +of the uniqueness constraint fails.
  • +
  • A key constraint can similarly be applied by searching for +different occurrences of a statement with the same identifier, unifying the +corresponding parameters of the statements, and concatenating their +attribute lists, to form a single statement. The substitutions obtained by unification are applied to +the merged statement and the rest of the instance. +
  • +
+ +

As noted above, uniqueness or key constraint + application can fail, if a required unification or merging step fails. Failure of constraint + application means that there is no way to add information to the + instance to satisfy the constraint, which in turn implies that the + instance is invalid. +

+

+ The process of applying definitions, inferences, and constraints + to a PROV instance until all of them are satisfied is similar to + what is sometimes + called chasing [DBCONSTRAINTS] or saturation + [CHR]. We call this process normalization. +

+

+ Although this specification outlines one particular way of + performing inferences and checking constraints, based on + normalization, implementations can use any other equivalent + algorithm. The logical formulas corresponding to the definitions, + inferences, and constraints outlined above (and further elaborated + in [PROV-SEM]) provides an equivalent specification, and any + implementation that correctly checks validity and equivalence (whether it performs normalization or not) complies + with this specification. +

+ + +

Termination

+

+ In general, applying sets of logical formulas of the above + definition, inference, and constraint forms is not guaranteed to + terminate. A simple example is the inference R(x,y) ⇒ ∃z. R(x,z) + ∧R(z,y), which can be applied to {R(a,b)} to generate an + infinite sequence of larger and larger instances. To ensure that + normalization, validity, and equivalence are decidable, we require + that normalization terminates. There is a great deal of work on termination of the chase in + databases, or of sets of constraint handling rules. The termination + of the notion of normalization defined in this specification is + guaranteed because the definitions, inferences and uniqueness/key + constraints correspond to a weakly acyclic set of + tuple-generating and equality-generating dependencies, in the + terminology of [DBCONSTRAINTS]. The termination of the remaining + ordering, typing, and impossibility constraints is easy to show. Appendix + A gives a proof that the definitions, inferences, and uniqueness + and key constraints are weakly acyclic and therefore terminating. +

+

+ There is an important subtlety that is essential to guarantee + termination. This specification draws a distinction between knowing + that an identifier has type 'entity', 'activity', or 'agent', and having + an explicit entity(id), activity(id), or agent(id) statement in the instance. + For example, focusing on entity statements, we can infer 'entity' ∈ typeOf(id) if entity(id) holds in the instance. In contrast, if we only know + that 'entity' ∈ typeOf(id), this does not imply that entity(id) + holds. +

+

+ This distinction (for both entities and activities) is essential to + ensure termination of the inferences, because we allow inferring + that a declared entity(id,attrs) has a generation + and invalidation event, using + Inference 7 (entity-generation-invalidation-inference). + Likewise, for activities, we allow inferring that a declared activity(id,t1,t2,attrs) has a generation + and invalidation event, using + Inference 8 (activity-start-end-inference). These + inferences do not apply to identifiers whose types are known, but for + which there is not an explicit entity or activity statement. +If we strengthened the type + inference constraints to add new entity or activity statements for + the entities and activities involved in generating or starting other + declared entities or activities, then we could keep generating new entities and + activities in an unbounded chain into the past (as in the "chicken + and egg" paradox). The + design adopted here requires that instances explicitly declare the + entities and activities that are relevant for validity checking, and only + these can be inferred to have invalidation/generation and start/end events. This inference + is not supported for identifiers +that are indirectly referenced in other relations and therefore have + type 'entity' or 'activity'. +

+ + +
+ +validation process overview +
+Figure 1 â—Š: Overview of the Validation Process +
+
+ + +

Checking ordering, typing, and impossibility constraints

+

+ The ordering, typing, and impossibility constraints are checked + rather than applied. This means that they do not generate new + formulas expressible in PROV, but they do generate basic constraints + that might or might not be consistent with each other. Checking + such constraints follows a saturation strategy similar to that for normalization: +

+
    +
  1. + For ordering constraints, we check by generating all of the + precedes and strictly-precedes relationships specified by the rules. These can be thought + of as a directed graph whose nodes are terms, and whose edges are + precedes or strictly-precedes relationships. + An ordering constraint of the form ∀ +x1...xn. A1 ∧ ... ∧ Ap ⇒ +precedes(t,t') can be applied by searching for occurrences of + A1 ∧ ... ∧ Ap and for each such match +adding the atomic formula precedes(t,t') to + the instance, and similarly for strictly-precedes constraints. After all such constraints have been checked, and the + resulting edges added to the graph, the ordering constraints are + violated if there is a cycle in the graph that includes a + strictly-precedes edge, and satisfied otherwise. +

    +
  2. +
  3. For typing constraints, we check by constructing a function + typeOf(id) mapping identifiers to sets of possible types. We + start with a function mapping each identifier to the empty set, + reflecting no constraints on the identifiers' types. A typing + constraint of the form ∀ +x1...xn. A1 ∧ ... ∧ Ap ⇒ 'type' ∈ typeOf(id) + is checked by adjusting the + function by adding 'type' to typeOf(id) for each conclusion + 'type' ∈ typeOf(id) of the rule. Typing constraints with + multiple conclusions are handled analogously. Once all constraints + have been checked in all possible ways, we check that the + disjointness constraints hold of the resulting typeOf function. + (These are essentially impossibility constraints). +

    +
  4. +
  5. For impossibility constraints, we check by searching for the + forbidden pattern that the impossibility constraint describes. Any + match of this pattern leads to failure of the constraint checking process. +An impossibility constraint of the form ∀ +x1...xn. A1 ∧ ... ∧ Ap ⇒ +False can be applied by searching for occurrences of +A1 ∧ ... ∧ Ap in the instance, and if any +such occurrence is found, signaling failure.

    +
  6. +
+

+ A normalized instance that passes all of the ordering, typing, + and impossibility constraint checks + is called valid. Validity can be, but is not required to be, + checked by normalizing and then checking constraints. Any other + algorithm that provides equivalent behavior (that is, accepts the + same valid instances and rejects the same invalid instances) is allowed. + In particular, the checked constraints and the + applied definitions, inferences and uniqueness constraints do not + interfere with one another, so it is also possible to mix checking + and application. This may be desirable in order to detect + invalidity more quickly. +

+ + + +

Equivalence and Isomorphism

+

Given two normal forms, a natural question is whether they contain + the same information, that is, whether they are equivalent (if so, + then the original instances are also equivalent.) By analogy with + logic, if we consider normalized PROV instances with existential + variables to represent sets of possible situations, then two normal + forms may describe the same situation but differ in inessential + details such as the order of statements or of elements of + attribute-value lists. To remedy this, we can easily consider + instances to be equivalent up to reordering of attributes. However, + instances can also be equivalent if they differ only in choice of + names of existential variables. Because of this, the appropriate + notion of equivalence of normal forms is isomorphism. Two + instances I1 and I2 are isomorphic if there is an invertible + substitution S mapping existential variables to existential variables such that S(I1) = I2. + +

+ +

Equivalence can be checked by normalizing instances, checking that + both instances are valid, then + testing whether the two normal forms are isomorphic. (It is + technically possible for two invalid normal forms to be isomorphic, + but to be considered equivalent, the two instances must also be + valid.) +As with validity, the algorithm suggested by this specification is + just one of many possible ways to implement equivalence checking; it + is not required that implementations compute normal forms + explicitly, only that their determinations of equivalence match + those obtained by the algorithm in this specification. +

+ +

Equivalence is only explicitly specified for +valid instances (whose normal forms exist and are unique up to +isomorphism). Implementations may test equivalences involving valid +and invalid documents. This specification does not constrain the +behavior of equivalence checking involving invalid instances, provided +that: +

+
    +
  • instance equivalence is reflexive, symmetric and + transitive on all instances
  • +
  • no valid instance is equivalent to an invalid instance.
  • +
+

+Because of the second constraint, equivalence is essentially the union + of two equivalence relations on the disjoint sets of valid and + invalid instances. + There are two simple implementations of equivalence for invalid + documents that are correct:

+
    +
  1. each invalid instance is equivalent only to itself
  2. +
  3. every pair of invalid instances are equivalent
  4. +
+ +

From Instances to Bundles and Documents

+ +

PROV documents can contain multiple instances: a toplevel +instance, and +zero or more additional, named instances called bundles. For the purpose +of inference and constraint checking, these instances are treated independently. That is, +a PROV document is valid provided that each instance in it is valid +and the names of its bundles are distinct. In other words, there are +no validity constraints that need to be checked across the different +instances in a PROV document; the contents of one instance in a +multi-instance PROV document cannot affect the validity of another instance. +Similarly, a PROV document is +equivalent to another if their toplevel instances are equivalent, they +have the same number of bundles with the same names, and the instances +of their corresponding bundles are equivalent. + +The scope of an existential variable in PROV is delimited at the instance +level. This means that occurrences of existential variables with the + same name appearing in different statements within the same + instance stand for a common, unknown term. However, existential variables with the same name occurring in +different instances do not necessarily denote the same term. This +is a consequence of the fact that the instances of two equivalent +documents only need to be pairwise isomorphic; this is a weaker +property than requiring that there be a single isomorphism that works +for all of the corresponding instances. +

+
+ +
+

2.5 Summary of inferences and constraints

This section is non-normative.

+ +

Table 2 summarizes the inferences, and +constraints specified in this document, broken down by component and +type or relation involved. +

+ + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 2: Summary of inferences and constraints for PROV Types and Relations
Type or Relation Name + Inferences and ConstraintsComponent
EntityInference 7 (entity-generation-invalidation-inference)
+ Inference 21 (specialization-attributes-inference)
+ Constraint 22 (key-object)
+ Constraint 54 (impossible-object-property-overlap)
+ Constraint 55 (entity-activity-disjoint)
+
1
ActivityInference 8 (activity-start-end-inference)
+ Constraint 22 (key-object)
+ Constraint 28 (unique-startTime)
+ Constraint 29 (unique-endTime)
+ Constraint 54 (impossible-object-property-overlap)
+ Constraint 55 (entity-activity-disjoint)
+
GenerationInference 6 (generation-use-communication-inference)
+ + Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 24 (unique-generation)
+ Constraint 34 (generation-within-activity)
+ Constraint 36 (generation-precedes-invalidation)
+ Constraint 37 (generation-precedes-usage)
+ Constraint 39 (generation-generation-ordering)
+ Constraint 41 (derivation-usage-generation-ordering)
+ Constraint 42 (derivation-generation-generation-ordering)
+ Constraint 43 (wasStartedBy-ordering)
+ Constraint 44 (wasEndedBy-ordering)
+ Constraint 45 (specialization-generation-ordering)
+ Constraint 47 (wasAssociatedWith-ordering)
+ Constraint 48 (wasAttributedTo-ordering)
+ Constraint 49 (actedOnBehalfOf-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
UsageInference 6 (generation-use-communication-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 33 (usage-within-activity)
+ Constraint 37 (generation-precedes-usage)
+ Constraint 38 (usage-precedes-invalidation)
+ Constraint 41 (derivation-usage-generation-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
CommunicationInference 5 (communication-generation-use-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 35 (wasInformedBy-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
StartInference 9 (wasStartedBy-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy)
+ Constraint 28 (unique-startTime)
+ Constraint 30 (start-precedes-end)
+ Constraint 33 (usage-within-activity)
+ Constraint 34 (generation-within-activity)
+ Constraint 35 (wasInformedBy-ordering)
+ Constraint 31 (start-start-ordering)
+ Constraint 43 (wasStartedBy-ordering)
+ Constraint 47 (wasAssociatedWith-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
EndInference 10 (wasEndedBy-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 27 (unique-wasEndedBy)
+ Constraint 29 (unique-endTime)
+ Constraint 30 (start-precedes-end)
+ Constraint 33 (usage-within-activity)
+ Constraint 34 (generation-within-activity)
+ Constraint 35 (wasInformedBy-ordering)
+ Constraint 32 (end-end-ordering)
+ Constraint 44 (wasEndedBy-ordering)
+ Constraint 47 (wasAssociatedWith-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
InvalidationInference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation)
+ Constraint 36 (generation-precedes-invalidation)
+ Constraint 38 (usage-precedes-invalidation)
+ Constraint 40 (invalidation-invalidation-ordering)
+ Constraint 43 (wasStartedBy-ordering)
+ Constraint 44 (wasEndedBy-ordering)
+ Constraint 46 (specialization-invalidation-ordering)
+ Constraint 47 (wasAssociatedWith-ordering)
+ Constraint 48 (wasAttributedTo-ordering)
+ Constraint 49 (actedOnBehalfOf-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
DerivationInference 11 (derivation-generation-use-inference)
+ + + Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 41 (derivation-usage-generation-ordering)
+ Constraint 42 (derivation-generation-generation-ordering)
+ Constraint 50 (typing)
+
2
RevisionInference 12 (revision-is-alternate-inference)
QuotationNo specific constraints
Primary SourceNo specific constraints
InfluenceNo specific constraints
AgentConstraint 22 (key-object)
+ Constraint 54 (impossible-object-property-overlap)
+
3
AttributionInference 13 (attribution-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 48 (wasAttributedTo-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
AssociationInference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 47 (wasAssociatedWith-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
DelegationInference 14 (delegation-inference)
+ Inference 15 (influence-inference)
+ Constraint 23 (key-properties)
+ Constraint 49 (actedOnBehalfOf-ordering)
+ Constraint 53 (impossible-property-overlap)
+ Constraint 50 (typing)
+
InfluenceInference 15 (influence-inference)
+ Constraint 23 (key-properties)
+
Bundle constructorNo specific constraints; see section 7.2 Bundles and Documents4
Bundle type No specific constraints; see section 7.2 Bundles and Documents +
AlternateInference 16 (alternate-reflexive)
+ Inference 17 (alternate-transitive)
+ Inference 18 (alternate-symmetric)
+ Constraint 50 (typing)
+
5
SpecializationInference 19 (specialization-transitive)
+ Inference 20 (specialization-alternate-inference)
+ Inference 21 (specialization-attributes-inference)
+ Constraint 45 (specialization-generation-ordering)
+ Constraint 46 (specialization-invalidation-ordering)
+ Constraint 52 (impossible-specialization-reflexive)
+ Constraint 50 (typing)
+
Collection No specific constraints 6
Membership Constraint 56 (membership-empty-collection)
+ Constraint 50 (typing)
+
+
+ + +
+ +
+ +
+

3. Compliance with this document

+ +

+ For the purpose of compliance, the normative sections of this document + are section 3. Compliance with this document, +section 4. Basic concepts, +section 5. Definitions and Inferences, +section 6. Constraints, and +section 7. Normalization, Validity, and Equivalence. + + + To be compliant: +

  1. When processing provenance, an + application MAY apply the inferences and definitions in section 5. Definitions and Inferences.
  2. +
  3. If determining whether a PROV instance or document is valid, an + application MUST determine whether all of the + constraints of section 6. Constraints are + satisfied on + the normal form of the instance or document.
  4. +
  5. If producing provenance meant for other applications to + use, the application SHOULD produce valid provenance, as specified in section 7. Normalization, Validity, and Equivalence.
  6. +
  7. If determining whether two PROV instances or documents are + equivalent, an application MUST determine whether their + normal forms are equal, as specified in section 7. Normalization, Validity, and Equivalence. +
+ +

This specification defines validity and equivalence procedurally + via reduction to normal forms. If checking validity or equivalence, the + results MUST be the same as would be obtained by computing normal + forms as defined in this specification. Applications that explicitly compute + normal forms, following the implementation strategy suggested by + this specification, are by definition compliant. However, + applications can also comply by checking validity and equivalence in any + other way that yields the same answers without explicitly applying + definitions, inferences, and constraints or constructing normal forms.

+ +

+ All figures are for illustration purposes + only. Information in tables is normative if it appears in a + normative section; specifically, Table 3 is normative. Text in appendices and +in boxes labeled "Remark" is informative. Where there is any apparent + ambiguity between the descriptive text and the formal text in a + "definition", "inference" or "constraint" box, the formal text takes +priority. +

+ + + +
+ +
+

4. Basic concepts

+ +

This section specifies the key concepts of terms, statements, instances, substitution, + satisfaction, and unification, which have already been discussed in + Section 2. +

+ +

Many PROV relation statements have an identifier, identifying a + link between two or more related objects. Identifiers can sometimes + be omitted in [PROV-N] notation. For the purpose of inference and + validity checking, we generate special identifiers called + variables denoting the unknown values. + Generally, identifiers occurring in constraints and inferences are + variables. Variables that are generated during inferences and + appear inside an instance are often called existential + variables, because they are implicitly existentially quantified. +

+ + + +

A PROV term is a constant identifier + c, a placeholder -, a literal value, + or an existential variable x. An + arbitrary PROV term is written t.

+ +

A PROV statement is an expression of + the form p(t1,...,tn) or p(id;t1,...,tn) where + id,t1,...,tn are + PROV terms and p is one of the + basic PROV relations. An arbitrary PROV statement is written A.

+ +

A PROV instance is a set of PROV + statements. Two instances are considered to be the same if they + contain the same statements, without regard to order or repetition. + An arbitrary PROV instance is written I. +

+ +

A substitution S is a mapping + [x1=t1,...,xn=tn] associating existential variables + with terms. A substitution is applied to a term, statement + or instance by replacing all occurrences of each of the variables + xi with the corresponding ti. Specifically, if S = + [x1=t1,...,xn=tn] + then the application of S to a term, statement or instance, written S(t), S(A) and + S(I) respectively, is defined as follows:

+
  • S(c) = c if c is a constant identifier.
  • +
  • S(xi) = ti if xi is one of the variables bound to a + term ti in S.
  • +
  • S(x) = x if x is a variable not bound in S.
  • +
  • S(p(t1,...,tn)) = p(S(t1),...,S(tn)).
  • +
  • S(p(id;t1,...,tn)) = p(S(id);S(t1),...,S(tn)).
  • +
  • S(I) = { S(A) | A ∈ I } if I is an instance.
  • +
+ +

Suppose A is a statement and I is an + instance and S a substitution. We say that A is + satisfied in I by S if S(A) ∈ I. Likewise, + we say that a set of statements {A1,...,An} is satisfied in + I if each Ai is satisfied in I by S. Finally, we + say that a set of statements is satisfiable + in I if there is some substitution S that satisfies the + statements in I. +

+ +

Unification is an operation that can be applied + to a pair of terms. + The result of unification is either a unifier, that is, a substitution S such that S(t) + = S(t'), or failure, indicating + that there is no unifier. Unification of pairs of terms is defined as follows.

+ +
    +
  • If t and t' are constant identifiers or literal values + (including the placeholder -), then + there are two cases. If t = t' then their unifier is the + empty substitution, otherwise unification +fails.
  • +
  • If x is an existential variable + and + t' is any term (identifier, constant, + placeholder -, or + existential variable), then their + unifier is + [x=t']. In the special case where + t'=x, the unifier is the empty substitution.
  • +
  • If t is any term (identifier, constant, + placeholder -, or + existential variable) and + x' is an existential variable, then their + unifier is the same as the unifier of x + and t.
  • +
+ + + +
Unification is analogous to unification in + logic programming and theorem proving, restricted to flat terms with +constants and variables but no function symbols. No "occurs check" is needed because there are no + function symbols.
+ +

Two PROV instances I and I' are isomorphic if + there exists an invertible substitution S that maps each + variable of I to a distinct variable of I' and such that + S(I) = I'.

+ + +
The scope of an existential variable is at the + instance level. When we obtain information about an existential + variable, for example through unification or merging during + uniqueness constraint application, we substitute all other + occurrences of that variable occurring in the same instance. + Occurrences in other instances are not affected.
+ +
+
+

5. Definitions and Inferences

+

+This section describes definitions and inferences that MAY be used on + provenance data, and that preserve equivalence on valid +PROV instances (as detailed in section 7. Normalization, Validity, and Equivalence). +A definition is a rule that can be applied to + PROV instances to replace defined statements with other statements. An inference is a rule that can be applied + to PROV instances to add new PROV statements. A definition states that a + provenance statement is equivalent to some other statements, whereas + an inference only states one direction of an implication. +

+ + +

Definitions have the following general form:

+ +
+

+ defined_stmt IF AND ONLY IF + there exists a1,..., am such that defining_stmt1 and ... and defining_stmtn.

+
+ +

+ A definition can be applied to a PROV instance, since its defined_stmt is defined in + terms of other statements. Applying a + definition to an instance means that if an occurrence of a defined + provenance statement defined_stmt + can be found in a PROV instance, then we can remove it and add all of the statements +defining_stmt1 ... defining_stmtn to the instance, possibly after generating fresh + identifiers a1,...,am for existential variables. In + other words, it is safe to replace + a defined statement with + its definition. +

+ +
+ We use definitions primarily to expand the compact, concrete + PROV-N syntax, including short forms and optional parameters, to the abstract syntax + implicitly used in PROV-DM. +
+ +

Inferences have the following general form:

+
+

+ IF hyp1 and ... and +hypk THEN + there exists a1 and ... and am such that concl1 and ... and concln.

+
+ +

Inferences can be applied to PROV instances. Applying an inference to an instance means that if all of the provenance statements matching + hyp1... hypk + can be found in the instance, then we check whether the conclusion + concl1 ... concln is satisfied for some values + of existential variables. If so, application of the inference has + no effect on the instance. If not, then a copy the + conclusion should be added to the instance, after + generating fresh identifiers a1,...,am for the existential variables. These fresh + identifiers might later be found to be equal to known identifiers; + they play a similar role in PROV constraints to existential + variables in logic [Logic] or database theory + [DBCONSTRAINTS]. + + In general, omitted optional parameters to + [PROV-N] statements, or explicit - + markers, are placeholders for existentially quantified variables; + that is, they denote unknown values. There are a few exceptions to + this general rule, which are specified in Definition 4 (optional-placeholders).

+ +

Definitions and inferences can be viewed as logical formulas; + similar formalisms are often used in rule-based reasoning [CHR] + and in databases [DBCONSTRAINTS]. In particular, the identifiers + a1 ... an + should be viewed as existentially quantified variables, meaning that + through subsequent reasoning steps they may turn out to be equal to + other identifiers that are already known, or to other existentially + quantified variables. + + In contrast, distinct URIs or literal values in PROV + are assumed to be distinct for the purpose of checking validity or + inferences. This issue is discussed in more detail under Uniqueness Constraints. +

+ +

In a definition or inference, term symbols such as id, + start, end, e, + a, attrs, + are assumed to be variables unless otherwise specified. These variables are scoped at + the definition, inference, or constraint level, so the rule is equivalent to any one-for-one + renaming of the variable names. When several rules are + collected within a definition or inference + as an ordered list, the scope of the variables in each rule is at the level of list elements, and so reuse of + variable names in different rules does not affect the meaning. +

+
+

5.1 Optional Identifiers and Attributes

+ + + +

+Definition 1 (optional-identifiers), +Definition 2 (optional-attributes), and +Definition 3 (definition-short-forms), + explain how to expand the compact forms of PROV-N notation into a + normal form. Definition 4 (optional-placeholders) indicates when + other optional parameters can be replaced by existential + variables. +

+ +
+

For each r in { +used, +wasGeneratedBy, +wasInvalidatedBy, +wasInfluencedBy, +wasStartedBy, +wasEndedBy, +wasInformedBy, +wasDerivedFrom, +wasAttributedTo, +wasAssociatedWith, +actedOnBehalfOf}, the following + definitional rules hold:

+
  1. + r(a1,...,an) IF AND ONLY IF + there exists id such that r(id; a1,...,an).
  2. +
  3. r(-; a1,...,an) IF AND ONLY IF + there exists id such that r(id; a1,...,an).
  4. +
+
+ +

Likewise, many PROV-N statements allow for an optional attribute + list. If it is omitted, this is the same as specifying an empty + attribute list:

+
+
    +
  1. + +

    The following definitional rules hold:

    +
    • entity(id) + IF AND ONLY IF entity(id,[]). +
    • +
    • activity(id) + IF AND ONLY IF activity(id,[]). +
    • +
    • activity(id,t1,t2) + IF AND ONLY IF activity(id,t1,t2,[]). +
    • +
    • agent(id) + IF AND ONLY IF agent(id,[]). +
    • +
    +
    +
  2. +
  3. + For each r in { +used, +wasGeneratedBy, +wasInvalidated, +wasInfluencedBy, +wasStartedBy, +wasEndedBy, +wasInformedBy, +wasDerivedFrom, +wasAttributedTo, +wasAssociatedWith, +actedOnBehalfOf}, if an is not an + attribute list parameter then the following definition holds: + +

    r(id; a1,...,an) + IF AND ONLY IF r(id; a1,...,an,[]).

+
+ + +
+

Definitions Definition 1 (optional-identifiers) and Definition 2 (optional-attributes) +do not apply to alternateOf and specializationOf, which do not have identifiers and attributes. +

+
+ + +

Finally, many PROV + statements have other optional arguments or short forms that can be + used if none of the optional arguments is present. These are + handled by specific rules listed below.

+ +
+

+ +

    +
  1. activity(id,attrs) IF AND ONLY IF activity(id,-,-,attrs). +
  2. +
  3. wasGeneratedBy(id; e,attrs) IF AND ONLY IF wasGeneratedBy(id; e,-,-,attrs). +
  4. +
  5. used(id; a,attrs) IF AND ONLY IF used(id; a,-,-,attrs). +
  6. +
  7. wasStartedBy(id; a,attrs) IF AND ONLY IF wasStartedBy(id; a,-,-,-,attrs). +
  8. +
  9. wasEndedBy(id; a,attrs) IF AND ONLY IF wasEndedBy(id; a,-,-,-,attrs). +
  10. +
  11. wasInvalidatedBy(id; e,attrs) IF AND ONLY IF wasInvalidatedBy(id; e,-,-,attrs). +
  12. +
  13. wasDerivedFrom(id; e2,e1,attrs) IF AND ONLY IF wasDerivedFrom(id; e2,e1,-,-,-,attrs). +
  14. +
  15. wasAssociatedWith(id; e,attrs) IF AND ONLY IF wasAssociatedWith(id; e,-,-,attrs). +
  16. +
  17. actedOnBehalfOf(id; a2,a1,attrs) IF AND ONLY IF actedOnBehalfOf(id; a2,a1,-,attrs). +
  18. +
+
+ +
+ + +

+There are no expansion rules for entity, agent, communication, + attribution, influence, alternate, or specialization + relations, because these + have no optional parameters aside from the identifier and attributes, + which are expanded by the rules in Definition 1 (optional-identifiers) and Definition 2 (optional-attributes).

+
+ + +

Finally, most optional parameters (written -) are, for the purpose of this document, + considered to be distinct, fresh existential variables. Optional parameters are defined in [PROV-DM] and in [PROV-N] for each type of PROV statement. + Thus, + before proceeding to apply other definitions or inferences, most + occurrences of - are to be replaced + by fresh existential variables, distinct from any others occurring in + the instance. + The only exceptions to this general rule, where - are to be left + in place, are the activity, generation, and usage parameters in wasDerivedFrom and + the plan + parameter in wasAssociatedWith. This is + further explained in remarks below. +

+ +

The treatment of optional parameters is specified formally using + the auxiliary concept of expandable parameter. An + expandable parameter is one that can be omitted using the + placeholder -, and if so, it is + to be replaced by a fresh existential identifier. + Table 3 defines the expandable + parameters of the properties of PROV, needed in Definition 4 (optional-placeholders). For emphasis, the four optional parameters + that are not expandable are + also listed. Parameters that cannot have value -, and identifiers that are + expanded by Definition 1 (optional-identifiers), are not listed.

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 3: Expandable and + Non-Expandable Parameters
RelationExpandable Non-expandable
used(id; a,e,t,attrs)e,t
wasGeneratedBy(id; e,a,t,attrs)a,t
wasStartedBy(id; a2,e,a1,t,attrs)e,a1,t
wasEndedBy(id; a2,e,a1,t,attrs)e,a1,t
wasInvalidatedBy(id; e,a,t,attrs)a,t
wasDerivedFrom(id; e2,e1,-,g,u,attrs)g,u
wasDerivedFrom(id; e2,e1,a,g,u,attrs)
(where a is not placeholder -)
g,ua
wasAssociatedWith(id; a,ag,pl,attrs)agpl
actedOnBehalfOf(id; ag2,ag1,a,attrs)a
+
+ +

Definition 4 (optional-placeholders) states how parameters are to be expanded, + using the expandable parameters defined in Table 3. The last two parts, 4 and 5, + indicate how to handle expansion of parameters for + wasDerivedFrom expansion, which is only allowed for the + generation and use parameters when the activity is specified. + Essentially, the definitions state that parameters +g,u are expandable only if the activity is specified, i.e., if parameter a is provided. + +The rationale for this is that when a is provided, then there have to be two events, namely u and g, which account for the usage of e1 and the generation of e2, respectively, by a. Conversely, if a is not provided, then one cannot tell whether one or more activities are involved in the derivation, and the explicit introduction of such events, which correspond to a single activity, would therefore not be justified.

+ + +

A later constraint, Constraint 51 (impossible-unspecified-derivation-generation-use), + forbids specifying generation and use parameters when the activity + is unspecified.

+ +
+
  1. + activity(id,-,t2,attrs) IF AND ONLY + IF there exists t1 such that activity(id,t1,t2,attrs). Here, t2 MAY be a placeholder. +
  2. +
  3. activity(id,t1,-,attrs) IF AND ONLY + IF there exists t2 such that activity(id,t1,t2,attrs). Here, t1 MAY be a placeholder. +
  4. + +
  5. For each r in { +used, +wasGeneratedBy, + +wasStartedBy, +wasEndedBy, +wasInvalidatedBy, + + +wasAssociatedWith, +actedOnBehalfOf + + }, if the ith parameter + of r is an expandable parameter + of r + as specified in Table 3 +then the following definition holds: +

    r(a0;...,ai-1, -, ai+1, ...,an) IF AND ONLY IF there exists a' + such that r(a0;...,ai-1,a',ai+1,...,an). +

  6. +
  7. If a is not the placeholder -, and u is any term, then the following definition holds: +

    wasDerivedFrom(id; e2,e1,a,-,u,attrs) IF AND ONLY IF there exists g + such that wasDerivedFrom(id; e2,e1,a,g,u,attrs).

  8. +
  9. If a is not the placeholder -, and g is any term, + then the following definition holds: +

    wasDerivedFrom(id; e2,e1,a,g,-,attrs) IF AND ONLY IF there exists u + such that wasDerivedFrom(id; e2,e1,a,g,u,attrs).

+
+ +
+

In an association of the form + wasAssociatedWith(id; a,ag,-,attr), the + absence of a plan means: either no plan exists, or a plan exists but + it is not identified. Thus, it is not equivalent to wasAssociatedWith(id; a,ag,p,attr) where a + plan p is given.

+
+
+

A derivation wasDerivedFrom(id; e2,e1,a,gen,use,attrs) that + specifies an activity explicitly indicates that this activity achieved the derivation, with a usage use of entity e1, and a generation gen of entity e2. + It differs from a derivation of the form + wasDerivedFrom(id; e2,e1,-,-,-,attrs) with + missing activity, generation, and usage. In the latter form, it is not specified + if one or more activities are involved in the derivation.

+ +

Let us consider a system, in which a derivation is underpinned by multiple activities. Conceptually, one could also model such a system with a new activity that encompasses the two original activities and underpins the derivation. The inferences defined in this specification do not allow the latter modeling to be inferred from the former. Hence, the two modeling of the same system are regarded as different in the context of this specification.

+
+
+ +
+

5.2 Entities and Activities

+ + + + +

Communication between activities implies the existence of an underlying +entity generated by one activity and used by the other, and vice versa.

+ +
+

+IF +wasInformedBy(_id; a2,a1,_attrs) +THEN + there exist e, _gen, _t1, _use, and _t2, +such that wasGeneratedBy(_gen; e,a1,_t1,[]) and used(_use; a2,e,_t2,[]) hold.

+
+ + +

+ +

+

+IF wasGeneratedBy(_gen; e,a1,_t1,_attrs1) + and used(_use; a2,e,_t2,_attrs2) hold + THEN + there exists _id +such that wasInformedBy(_id; a2,a1,[]) +

+ + +
+

The relationship wasInformedBy is not +transitive. Indeed, consider the following statements.

+
wasInformedBy(a2,a1)
+wasInformedBy(a3,a2)
+
+

We cannot infer wasInformedBy(a3,a1) + from these statements alone. Indeed, +from +wasInformedBy(a2,a1), we know that there exists e1 such that e1 was generated by a1 +and used by a2. Likewise, from wasInformedBy(a3,a2), we know that there exists e2 such that e2 was generated by a2 +and used by a3. The following illustration +shows a counterexample to transitivity. The +horizontal axis represents the event line. We see that e1 was generated after e2 was used. Furthermore, the illustration also shows that +a3 completes before a1 started. So in this example (with no other + information) it is impossible for a3 to have used an entity generated by a1. This is illustrated in Figure 2.

+ +
+ +non transitivity of wasInformedBy +
+Figure 2 â—Š: Counter-example for transitivity of wasInformedBy +
+
+
+ + + +
+ + + +

+From an entity statement, we can infer the existence of +generation and invalidation events. +

+
+

+IF entity(e,_attrs) THEN there exist +_gen, _a1, _t1, +_inv, _a2, and _t2 such that + wasGeneratedBy(_gen; e,_a1,_t1,[]) and wasInvalidatedBy(_inv; e,_a2,_t2,[]). +

+ + +
+ + +

+From an activity statement, we can infer +start and end events whose times match the start and end times of +the activity, respectively. +

+
+

+IF activity(a,t1,t2,_attrs) THEN there exist _start, _e1, _a1, _end, _a2, + and _e2 such that + wasStartedBy(_start; a,_e1,_a1,t1,[]) and wasEndedBy(_end; a,_e2,_a2,t2,[]). +

+ + +
+ + +

The start of an activity a triggered by entity e1 +implies that +e1 was generated by the starting activity a1.

+ +
+

IF + wasStartedBy(_id; _a,e1,a1,_t,_attrs), +THEN there exist _gen and _t1 +such that + wasGeneratedBy(_gen; e1,a1,_t1,[]).

+
+

+ +


+ +

Likewise, +the ending of activity a by triggering entity e1 implies that +e1 was generated by the ending activity a1. +

+ +
+

IF + wasEndedBy(_id; _a,e1,a1,_t,_attrs), +THEN there exist _gen and _t1 such that + wasGeneratedBy(_gen; e1,a1,_t1,[]).

+
+ + + + +
+ +
+

5.3 Derivations

+ + +
+

Derivations with explicit +activity, generation, and usage admit the following inference:

+ +
+

In this inference, none of a, gen2 or use1 can be + placeholders -. +

+IF wasDerivedFrom(_id; e2,e1,a,gen2,use1,_attrs), + THEN there exists _t1 and _t2 such that used(use1; a,e1,_t1,[]) and wasGeneratedBy(gen2; e2,a,_t2,[]). +

+
+

+ + + + +


+

A revision admits the following inference, stating that the two entities +linked by a revision are also alternates.

+ +
+

In this inference, any of _a, _g or _u MAY be placeholders.

+

+ IF wasDerivedFrom(_id; e2,e1,_a,_g,_u,[prov:type='prov:Revision']), THEN alternateOf(e2,e1). +

+ +
+ + + + +
+ There is no inference stating that wasDerivedFrom is + transitive. +
+
+ + +
+

5.4 Agents

+ +

Attribution is the ascribing of an entity to an agent. An +entity can only be ascribed to an agent if the agent was associated with +an activity that generated the entity. If the activity, generation +and association events are not explicit in the instance, they can +be inferred.

+ +
+

+IF +wasAttributedTo(_att; e,ag,_attrs) + +THEN there exist + a, + _t, +_gen, +_assoc, + _pl, +such that +wasGeneratedBy(_gen; e,a,_t,[]) and +wasAssociatedWith(_assoc; a,ag,_pl,[]). +

+
+ +
+ In the above inference, _pl is an + existential variable, so it can be unified +with a constant identifier, another existential variable, or a + placeholder -, as explained + in the definition of unification. +
+
+

Delegation relates agents where one agent acts on behalf of +another, in the context of some activity. The supervising agent +delegates some responsibility for part of the activity to the +subordinate agent, while retaining some responsibility for the overall +activity. Both agents are associated with this activity.

+ + +
+

+IF +actedOnBehalfOf(_id; ag1, ag2, a, _attrs) +THEN there exist _id1, _pl1, _id2, and _pl2 such that wasAssociatedWith(_id1; a, ag1, _pl1, []) + and wasAssociatedWith(_id2; a, ag2, _pl2, + []). +

+
+ + +
+ The two associations between the agents and the activity + may have different identifiers, different plans, and different + attributes. In particular, the plans of the two agents need not be + the same, and one, both, or neither can be the placeholder - + indicating that there is no plan, because the existential variables + _pl1 and _pl2 + can be replaced with constant identifiers, existential variables, or + placeholders - independently, as explained + in the definition of unification. +
+ +
+

+The wasInfluencedBy relation is implied by other relations, including +usage, start, end, generation, invalidation, communication, +derivation, attribution, association, and delegation. To capture this +explicitly, we allow the following inferences: +

+
+

+

    +
  1. + IF wasGeneratedBy(id; e,a,_t,attrs) THEN wasInfluencedBy(id; e, a, attrs). +
  2. +
  3. + IF used(id; a,e,_t,attrs) THEN wasInfluencedBy(id; a, e, attrs). +
  4. +
  5. + IF wasInformedBy(id; a2,a1,attrs) THEN wasInfluencedBy(id; a2, a1, attrs). +
  6. +
  7. + IF wasStartedBy(id; a2,e,_a1,_t,attrs) THEN wasInfluencedBy(id; a2, e, attrs). +
  8. +
  9. + IF wasEndedBy(id; a2,e,_a1,_t,attrs) THEN wasInfluencedBy(id; a2, e, attrs). +
  10. +
  11. + IF wasInvalidatedBy(id; e,a,_t,attrs) THEN wasInfluencedBy(id; e, a, attrs). +
  12. +
  13. + IF wasDerivedFrom(id; e2, e1, _a, _g, _u, attrs) THEN wasInfluencedBy(id; e2, e1, attrs). Here, + _a, _g, _u MAY be placeholders -. +
  14. +
  15. + IF wasAttributedTo(id; e,ag,attrs) THEN wasInfluencedBy(id; e, ag, attrs). +
  16. +
  17. + IF wasAssociatedWith(id; a,ag,_pl,attrs) THEN wasInfluencedBy(id; a, ag, attrs). Here, + _pl MAY be a placeholder -. +
  18. +
  19. + IF actedOnBehalfOf(id; ag2,ag1,_a,attrs) THEN wasInfluencedBy(id; ag2, ag1, attrs). +
  20. +
+
+ +
+ The inferences above permit the use of same identifier for an + influence relationship and a more + specific relationship. +
+ +
+ + + +
+

5.5 Alternate and Specialized Entities

+ + + + +
+

The relation alternateOf is an equivalence relation on + entities: that is, + it is reflexive, + transitive and symmetric. As a consequence, the + following inferences can be applied:

+ + +
+

+IF entity(e) THEN +alternateOf(e,e). +

+
+ +

+ +


+

+ +

+

+IF alternateOf(e1,e2) and + alternateOf(e2,e3) THEN alternateOf(e1,e3).

+
+ +

+ +


+

+ +

+

+IF alternateOf(e1,e2) THEN alternateOf(e2,e1).

+
+ +

+ + +


+

+Similarly, specialization is a + strict partial order: it is irreflexive and + transitive. Irreflexivity is handled later as Constraint 52 (impossible-specialization-reflexive) +

+
+

+ +IF specializationOf(e1,e2) + and + specializationOf(e2,e3) THEN specializationOf(e1,e3).

+
+ +

+ +


+ +

If one entity specializes another, then they are also + alternates:

+ +
+

+ +IF specializationOf(e1,e2) THEN alternateOf(e1,e2).

+
+ +
+

+ If one entity specializes another then all attributes of the more + general entity are also attributes of the more specific one. +

+
+

+ +IF entity(e1, attrs) and specializationOf(e2,e1), THEN + entity(e2, attrs).

+
+ + + + +
+ + + + + +
+ + + +
+

6. Constraints

+ + + + +

+This section defines a collection of constraints on PROV instances. +There are three kinds of constraints: +

  • uniqueness constraints that say that a PROV + instance can contain at most one statement of each kind with a + given identifier. For + example, if we describe the same generation event twice, then the + two statements should have the same times; +
  • +
  • event ordering constraints that say that it + should be possible to arrange the + events (generation, usage, invalidation, start, end) described in a + PROV instance into a preorder that corresponds to a sensible + "history" (for example, an entity should not be generated after it + is used); and +
  • +
  • impossibility constraints, which forbid certain + patterns of statements in valid PROV instances. +
+ +

As in a definition or inference, term symbols such as id, + start, end, e, + a, attrs in a constraint, + are assumed to be variables unless otherwise specified. These variables are scoped at + the constraint level, so the rule is equivalent to any one-for-one + renaming of the variable names. When several rules are collected within a constraint + as an ordered list, the scope of the variables in each rule is at the level of list elements, and so reuse of + variable names in different rules does not affect the meaning. +

+
+ + + +

6.1 Uniqueness Constraints

+ + + +

In the absence of existential variables, uniqueness constraints + could be checked directly by checking that no identifier appears + more than once for a given statement. However, in the presence of + existential variables, we need to be more careful to combine + partial information that might be present in multiple compatible + statements, due to inferences. Uniqueness constraints are + enforced through merging pairs of statements subject to + equalities. For example, suppose we have two activity statements + activity(a,2011-11-16T16:00:00,_t1,[a=1]) and activity(a,_t2,2011-11-16T18:00:00,[b=2]), with existential variables _t1 and _t2. The merge of + these two statements (describing the same activity a) is activity(a,2011-11-16T16:00:00,2011-11-16T18:00:00,[a=1,b=2]).

+ + +

+A typical uniqueness constraint is as follows: +

+
+

IF hyp1 and ... and hypn THEN t1 = u1 and ... and tn = un.

+
+ +

Such a constraint is enforced as follows:

+
  1. Suppose PROV instance I contains all of the hypotheses + hyp1 and ... and hypn. +
  2. +
  3. Attempt to unify all of the equated terms in the conclusion + t1 = u1 and ... and tn = un. +
  4. +
  5. If unification fails, then the constraint + is unsatisfiable, so application of the constraint to I + fails. If this failure occurs during normalization prior to +validation, then I is invalid, as explained in Section 6. +
  6. +
  7. If unification succeeds with a substitution S, then + S is applied to the instance I, yielding result S(I).
  8. +
+ +

Key constraints are uniqueness constraints + that specify that a particular key field of a relation uniquely + determines the other parameters. Key constraints are written as follows: +

+ +
+

The ak field is a KEY for relation r(a0; a1,...,an).

+ +

Because of the presence of attributes, key constraints do not + reduce directly to uniqueness constraints. Instead, we enforce key + constraints using the following merging process.

+
    +
  1. Suppose r(a0; a1,...an,attrs1) and r(b0; b1,...bn,attrs2) hold in PROV instance I, where the key fields ak = bk are equal.
  2. +
  3. Attempt to unify all of the corresponding parameters a0 = b0 and ... and an = bn. +
  4. +
  5. If unification fails, then the constraint is unsatisfiable, so + application of the key constraint to I fails. +
  6. +
  7. If unification succeeds with substitution S, then we remove r(a0; a1,...an,attrs1) and r(b0; b1,...bn,attrs2) from I, obtaining + instance I', and return instance {r(S(a0); S(a1),...S(an),attrs1 ∪ + attrs2)} ∪ S(I'). +
+ + + +

Thus, if a PROV instance contains an apparent violation of a uniqueness + constraint or key constraint, unification or merging can be used to determine + whether the constraint can be satisfied by instantiating some existential + variables with other terms. For key constraints, this is the same + as merging pairs of statements whose keys are equal and whose + corresponding arguments are compatible, because after + unifying respective arguments and combining attribute lists, the two statements + become equal and one can be omitted.

+ + + + + + +

+


+ +

The various identified objects of PROV MUST have + unique statements describing them within a valid PROV instance. + This is enforced through + the following key constraints: +

+
+

    +
  1. The identifier field id is a KEY for + the entity(id,attrs) statement. +
  2. +
  3. The identifier field id is a KEY for + the activity(id,t1,t2,attrs) statement. +
  4. +
  5. The identifier field id is a KEY for + the agent(id,attrs) statement. +
  6. +
+
+ +
+

Likewise, the statements +in a valid PROV instance must provide consistent information about + each identified object or relationship. The following key + constraints require that all of the information about each identified + statement can be merged into a single, consistent statement: +

+
+

    +
  1. The identifier field id is a KEY for + the wasGeneratedBy(id; e,a,t,attrs) statement. +
  2. +
  3. The identifier field id is a KEY for + the used(id; a,e,t,attrs) statement. +
  4. +
  5. The identifier field id is a KEY for + the wasInformedBy(id; a2,a1,attrs) statement. +
  6. +
  7. The identifier field id is a KEY for + the wasStartedBy(id; a2,e,a1,t,attrs) statement. +
  8. +
  9. The identifier field id is a KEY for + the wasEndedBy(id; a2,e,a1,t,attrs) statement. +
  10. +
  11. The identifier field id is a KEY for + the wasInvalidatedBy(id; e,a,t,attrs) statement. +
  12. +
  13. The identifier field id is a KEY for + the wasDerivedFrom(id; e2, e1, a, g2, u1, attrs) statement. +
  14. +
  15. The identifier field id is a KEY for + the wasAttributedTo(id; e,ag,attr) statement. +
  16. +
  17. The identifier field id is a KEY for + the wasAssociatedWith(id; a,ag,pl,attrs) statement. +
  18. + +
  19. The identifier field id is a KEY for + the actedOnBehalfOf(id; ag2,ag1,a,attrs) statement. +
  20. +
  21. The identifier field id is a KEY for + the wasInfluencedBy(id; o2,o1,attrs) statement. +
  22. +
+
+ + + +
+ + +
+

Entities may have multiple generation or invalidation events + (either or both may, however, be left implicit). An entity can be + generated by more than one activity, with one generation event per + each entity-activity pair. These events must be simultaneous, as required by Constraint 39 (generation-generation-ordering) + and Constraint 40 (invalidation-invalidation-ordering). + +

+
+ + +
+

+IF wasGeneratedBy(gen1; e,a,_t1,_attrs1) and wasGeneratedBy(gen2; e,a,_t2,_attrs2), +THEN gen1 = gen2.

+
+ +

+ +


+

+ +

+

+IF wasInvalidatedBy(inv1; e,a,_t1,_attrs1) and wasInvalidatedBy(inv2; e,a,_t2,_attrs2), +THEN inv1 = inv2.

+
+ + +

It follows from the above uniqueness and key + constraints that the generation and invalidation events linking an + entity and activity are unique, if specified. However, because we + apply the constraints by merging, it is possible for a valid PROV instance +to contain multiple statements about the same generation or + invalidation event, for example:

+
wasGeneratedBy(id1; e,a,-,[prov:location="Paris"])
+wasGeneratedBy(-; e,a,-,[color="Red"])
+
+

When the uniqueness and key constraints are applied, the instance is + normalized to the following form:

+
wasGeneratedBy(id1; e,a,_t,[prov:location="Paris",color="Red"])
+
+

+ where _t is a new existential variable. +

+
+ + +
+

+An activity may have more than one start and +end event, each having a different activity (either or both may, +however, be left implicit). However, +the triggering entity linking any two activities in a start or end event is unique. +That is, an activity may be started by +several other activities, with shared or separate triggering +entities. If an activity is started or ended by multiple events, they must all +be simultaneous, as specified in Constraint 31 (start-start-ordering) +and Constraint 32 (end-end-ordering). +

+ +
+

+IF wasStartedBy(start1; a,_e1,a0,_t1,_attrs1) and wasStartedBy(start2; a,_e2,a0,_t2,_attrs2), THEN start1 = start2.

+
+ +

+ +

+

+IF wasEndedBy(end1; a,_e1,a0,_t1,_attrs1) and wasEndedBy(end2; a,_e2,a0,_t2,_attrs2), THEN end1 = end2.

+
+ + +
+ + + + + +

An activity start event is the instantaneous event that marks the instant an activity starts. It allows for an optional time attribute. Activities also allow for an optional start time attribute. If both are specified, they MUST be the same, as expressed by the following constraint. +

+ +
+

+IF activity(a2,t1,_t2,_attrs) and wasStartedBy(_start; a2,_e,_a1,t,_attrs), THEN t1=t.

+
+ +
+ +

An activity end event is the instantaneous event that marks the instant an activity ends. It allows for an optional time attribute. Activities also allow for an optional end time attribute. If both are specified, they MUST be the same, as expressed by the following constraint. +

+ +
+

+IF activity(a2,_t1,t2,_attrs) and wasEndedBy(_end; a2,_e,_a1,t,_attrs1), THEN t2 = t.

+
+ +

+ + +


+ + + + + + +
+ +
+

6.2 Event Ordering Constraints

+ + +

Given that provenance consists of a description of past entities +and activities, valid provenance instances MUST +satisfy ordering constraints between instantaneous events, which are introduced in +this section. For instance, an entity can only be used after it was +generated; in other words, an entity's generation event precedes any of this +entity's usage events. Should this +ordering constraint be violated, the associated generation and +usage would not be credible. The rest of this section defines +the temporal interpretation of provenance instances as a +set of instantaneous event ordering constraints.

+ + +

To allow for minimalistic clock assumptions, like Lamport +[CLOCK], PROV relies on a notion of relative ordering of instantaneous events, +without using physical clocks. This specification assumes that a preorder exists between instantaneous events. +

+ + +

Specifically, precedes is a preorder +between instantaneous events. A +constraint of the form +e1 precedes e2 means that e1 +happened at the same time as or before e2. +For symmetry, follows is defined as the +inverse of precedes; that is, a constraint of +the form +e1 follows e2 means that e1 happened at the same time +as or after e2. Both relations are +preorders, meaning that they are reflexive and +transitive. Moreover, we sometimes consider strict forms of these +orders: we say e1 strictly precedes e2 to indicate that e1 +happened before e2, but not at the same time. This is a +transitive, irreflexive relation.

+ + +

PROV also allows for time observations to be inserted in +specific provenance statements, for each of the five kinds of instantaneous events introduced in +this specification. Times in provenance records arising from +different sources might be with respect to different timelines +(e.g. different time zones) leading to apparent inconsistencies. For +the purpose of checking ordering constraints, the times associated +with events are irrelevant; thus, there is no inference that time ordering +implies event ordering, or vice versa. However, an application MAY flag time values +that appear inconsistent with the event ordering as possible +inconsistencies. When generating provenance, an application SHOULD +use a consistent timeline for related PROV statements within an +instance.

+ + +

A typical ordering constraint is as follows.

+ +
+

IF hyp1 and ... and hypn THEN evt1 precedes/strictly precedes evt2.

+

+ The conclusion of an ordering constraint is either precedes + or strictly precedes. One way to check + ordering constraints is to + generate all precedes and strictly + precedes + relationships arising from the ordering constraints to form a directed graph, with edges marked precedes or + strictly precedes, and check that there is no cycle + containing a strictly precedes edge. +

+ + + + + +
+

6.2.1 Activity constraints

+ +

+This section specifies ordering constraints from the perspective of +the lifetime of an activity. An activity starts, then during +its lifetime can use, generate or invalidate entities, communicate + with, start, or end +other +activities, or be associated with agents, and finally it ends. The following constraints amount to +checking that all of the events associated with an activity take place +within the activity's lifetime, and the start and end events mark the +start and endpoints of its lifetime. +

+ +

Figure 3 summarizes the ordering + constraints on activities in a +graphical manner. For this and subsequent figures, an event time line points to the +right. Activities are represented by rectangles, whereas entities are +represented by circles. Usage, generation and invalidation are +represented by the corresponding edges between entities and +activities. The five kinds of instantaneous events are represented by vertical +dotted lines (adjacent to the vertical sides of an activity's +rectangle, or intersecting usage and generation edges). The ordering +constraints are represented by triangles: an occurrence of a triangle between two instantaneous event vertical dotted lines represents that the event denoted by the left +line precedes the event denoted by the right line.

+ + + +
+ + +constraints between events +
+Figure 3 â—Š: Summary of instantaneous event ordering constraints for activities +
+
+ + + +
+ +

+The existence of an activity implies that the activity start +event always precedes the corresponding activity end +event. This is illustrated by +Figure 3 +(a) and expressed by Constraint 30 (start-precedes-end).

+ +
+

+IF +wasStartedBy(start; a,_e1,_a1,_t1,_attrs1) +and +wasEndedBy(end; a,_e2,_a2,_t2,_attrs2) +THEN +start +precedes +end. +

+
+

+ +


+ +

+If an activity is started by more than one activity, the events must all +be simultaneous. The following constraint requires that if there are two start +events that start the same activity, then one precedes the +other. Using this constraint in both directions means that each event +precedes the other. +

+
+

+ IF +wasStartedBy(start1; a,_e1,_a1,_t1,_attrs1) +and +wasStartedBy(start2; a,_e2,_a2,_t2,_attrs2) +THEN +start1 +precedes +start2. +

+
+ +
+ +

+If an activity is ended by more than one activity, the events must all +be simultaneous. The following constraint requires that if there are two end +events that end the same activity, then one precedes the +other. Using this constraint in both directions means that each event +precedes the other, that is, they are simultaneous. +

+
+

+ IF +wasEndedBy(end1; a,_e1,_a1,_t1,_attrs1) +and +wasEndedBy(end2; a,_e2,_a2,_t2,_attrs2) +THEN +end1 +precedes +end2. +

+
+ +
+ +

A usage implies ordering of events, since the usage event had to occur during the associated activity. This is +illustrated by Figure 3 (b) and expressed by Constraint 33 (usage-within-activity).

+ +
+
    +
  1. + IF +wasStartedBy(start; a,_e1,_a1,_t1,_attrs1) + and +used(use; a,_e2,_t2,_attrs2) +THEN +start +precedes +use. +
  2. +
  3. + IF +used(use; a,_e1,_t1,_attrs1) +and +wasEndedBy(end; a,_e2,_a2,_t2,_attrs2) +THEN +use +precedes +end. +
  4. +
+
+ +

+ +


+ + +

A generation implies ordering of events, since the generation event had to occur during the associated activity. This is +illustrated by Figure 3 (c) and expressed by Constraint 34 (generation-within-activity).

+ +
+
    +
  1. + IF +wasStartedBy(start; a,_e1,_a1,_t1,_attrs1) + and +wasGeneratedBy(gen; _e2,a,_t2,_attrs2) +THEN +start +precedes +gen. +
  2. +
  3. + IF +wasGeneratedBy(gen; _e,a,_t,_attrs) +and +wasEndedBy(end; a,_e1,_a1,_t1,_attrs1) +THEN +gen +precedes +end. +
  4. +
+
+ +

+ +


+

+Communication between two activities a1 +and a2 also implies ordering +of events, since some entity must +have been generated by the former and used by the latter, which +implies that the start event of a1 cannot +follow the end event of a2. This is +illustrated by +Figure 3 +(d) and expressed by Constraint 35 (wasInformedBy-ordering).

+ +
+

+ IF +wasInformedBy(_id; a2,a1,_attrs) +and +wasStartedBy(start; a1,_e1,_a1',_t1,_attrs1) +and +wasEndedBy(end; a2,_e2,_a2',_t2,_attrs2) +THEN +start +precedes +end. +

+
+

+ + + +

+ +
+

6.2.2 Entity constraints

+ + + + +

+As with activities, entities have lifetimes: they are generated, then +can be used, other entities can be derived from them, and finally they +can be invalidated. The constraints on these events are +illustrated graphically in Figure 4 and +Figure 5. +

+ + + +
+ +ordering constraints for entities +
+Figure 4 â—Š: Summary of instantaneous event ordering constraints for entities
+
+ +

+ +


+ +

+Generation of an entity precedes its invalidation. (This +follows from other constraints if the entity is used, but it is stated +explicitly here to cover the case of an entity that is generated and +invalidated without being used.)

+ +
+

+ IF +wasGeneratedBy(gen; e,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv; e,_a2,_t2,_attrs2) +THEN +gen +precedes +inv. +

+
+ + + + +
+ +

+A usage and a generation for a given entity implies ordering of events, since the generation event had to precede the usage event. This is +illustrated by Figure 4(a) and expressed by Constraint 37 (generation-precedes-usage).

+ +
+

IF +wasGeneratedBy(gen; e,_a1,_t1,_attrs1) +and +used(use; _a2,e,_t2,_attrs2) +THEN +gen +precedes +use. +

+
+ + +
+ +

All usages of an entity precede its invalidation, which is captured by Constraint 38 (usage-precedes-invalidation) (without any explicit graphical representation).

+ +
+

+IF +used(use; _a1,e,_t1,_attrs1) +and +wasInvalidatedBy(inv; e,_a2,_t2,_attrs2) +THEN +use +precedes +inv.

+
+ + +
+ +

+If an entity is generated by more than one activity, the events must all +be simultaneous. The following constraint requires that if there are two generation +events that generate the same entity, then one precedes the +other. Using this constraint in both directions means that each event +precedes the other. +

+
+

+ IF +wasGeneratedBy(gen1; e,_a1,_t1,_attrs1) +and +wasGeneratedBy(gen2; e,_a2,_t2,_attrs2) +THEN +gen1 +precedes +gen2. +

+
+ +
+ +

+If an entity is invalidated by more than one activity, the events must all +be simultaneous. The following constraint requires that if there are two invalidation +events that invalidate the same entity, then one precedes the +other. Using this constraint in both directions means that each event +precedes the other, that is, they are simultaneous. +

+
+

+ IF +wasInvalidatedBy(inv1; e,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv2; e,_a2,_t2,_attrs2) +THEN +inv1 +precedes +inv2. +

+
+ + + +

If there is a +derivation relationship linking e2 and e1, then +this means that the entity e1 had some influence on the entity e2; for this to be possible, some event ordering must be satisfied. +First, we consider derivations, where the activity and usage are known. In that case, the usage of e1 has to precede the generation of e2. +This is +illustrated by Figure 4 (b) and expressed by Constraint 41 (derivation-usage-generation-ordering).

+ + +
+

+ In this constraint, _a, gen2, use1 MUST NOT be placeholders.

+

+ IF +wasDerivedFrom(_d; _e2,_e1,_a,gen2,use1,_attrs) +THEN +use1 +precedes +gen2. +

+
+

+


+ +

+When the activity, generation or usage is unknown, a similar constraint exists, except that the constraint refers to its +generation event, as +illustrated by Figure 4 (c) and expressed by Constraint 42 (derivation-generation-generation-ordering).

+ +
+

+In this constraint, any of _a, _g, _u MAY be placeholders.

+

+ IF +wasDerivedFrom(_d; e2,e1,_a,_g,_u,attrs) + and +wasGeneratedBy(gen1; e1,_a1,_t1,_attrs1) + and +wasGeneratedBy(gen2; e2,_a2,_t2,_attrs2) +THEN +gen1 +strictly precedes +gen2. +

+
+ +
+

This constraint requires the derived + entity to be generated strictly following the generation of the + original entity. This follows from the [PROV-DM] definition of + derivation: A derivation is a transformation of an entity into + another, an update of an entity resulting in a new one, or the + construction of a new entity based on a pre-existing entity, thus + the derived entity must be newer than the original entity.

+

The event ordering is between generations of e1 +and e2, as opposed to derivation where usage is known, +which implies ordering between the usage of e1 and +generation of e2.

+
+ +
+ +

+The entity that triggered the start of an activity must exist before the activity starts. +This is +illustrated by Figure 5(a) and expressed by Constraint 43 (wasStartedBy-ordering).

+ + +
+
    +
  1. + IF +wasGeneratedBy(gen; e,_a1,_t1,_attrs1) +and +wasStartedBy(start; _a,e,_a2,_t2,_attrs2) +THEN +gen +precedes +start. +
  2. + IF +wasStartedBy(start; _a,e,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv; e,_a2,_t2,_attrs2) +THEN +start +precedes +inv. +
  3. +
+
+ +
+ +

Similarly, the entity that triggered +the end of an activity must exist before the activity ends, as +illustrated by +Figure 5(b).

+ + +
+
    +
  1. + IF +wasGeneratedBy(gen; e,_a1,_t1,_attrs1) +and + wasEndedBy(end; _a,e,_a2,_t2,_attrs2) +THEN +gen +precedes +end. +
  2. + IF +wasEndedBy(end; _a,e,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv; e,_a2,_t2,_attrs2) +THEN +end +precedes +inv. +
  3. +
+
+ +
+ +ordering constraints for trigger entities +
+Figure 5 â—Š: Summary of instantaneous event ordering constraints for trigger entities +
+
+ +
+

+If an entity is a specialization of another, then the more +specific entity must have been generated after the +less specific entity was generated. +

+
+

+IF specializationOf(e2,e1) and wasGeneratedBy(gen1; e1,_a1,_t1,_attrs1) and + wasGeneratedBy(gen2; e2,_a2,_t2,_attrs2) + THEN gen1 precedes gen2. +

+ +

+ +


+

+Similarly, if an entity is a specialization of another entity, and +then +the invalidation event of the more specific entity precedes that of +the less specific entity. +

+

+IF specializationOf(e1,e2) and + wasInvalidatedBy(inv1; e1,_a1,_t1,_attrs1) and + wasInvalidatedBy(inv2; e2,_a2,_t2,_attrs2) + THEN inv1 precedes inv2. +

+
+ +
+ +
+

6.2.3 Agent constraints

+ +

Like entities and activities, agents have lifetimes that follow a +familiar pattern. An agent that is also an entity can be generated +and invalidated; an agent that is also an activity can be started or +ended. During its lifetime, an agent can participate in interactions +such as starting or ending other activities, association with an +activity, attribution, or delegation. + +

Further constraints associated with agents appear in Figure 6 and are discussed below.

+ +
+ +ordering constraints for agents +
+Figure 6 â—Š: Summary of instantaneous event ordering + constraints for agents +
+
+ +
+ + +

An activity that was +associated with an agent must have some overlap with the agent. The +agent MUST have been generated (or started), or MUST have become +associated with the activity, after the activity start: so, the agent MUST exist before the activity end. Likewise, the agent may be destructed (or ended), or may terminate its association with the activity, before the activity end: hence, the agent invalidation (or end) is required to happen after the activity start. +This is illustrated by Figure 6 (a) and expressed by Constraint 47 (wasAssociatedWith-ordering).

+ + + +
+

+In the following inferences, _pl MAY be + a placeholder -. +

  1. + IF +wasAssociatedWith(_assoc; a,ag,_pl,_attrs) +and +wasStartedBy(start1; a,_e1,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv2; ag,_a2,_t2,_attrs2) +THEN +start1 +precedes +inv2. +
  2. + IF +wasAssociatedWith(_assoc; a,ag,_pl,_attrs) +and +wasGeneratedBy(gen1; ag,_a1,_t1,_attrs1) +and +wasEndedBy(end2; a,_e2,_a2,_t2,_attrs2) +THEN +gen1 +precedes +end2. +
  3. + IF +wasAssociatedWith(_assoc; a,ag,_pl,_attrs) +and +wasStartedBy(start1; a,_e1,_a1,_t1,_attrs1) +and +wasEndedBy(end2; ag,_e2,_a2,_t2,_attrs2) +THEN +start1 +precedes +end2. +
  4. + IF +wasAssociatedWith(_assoc; a,ag,_pl,_attrs) +and +wasStartedBy(start1; ag,_e1,_a1,_t1,_attrs1) +and +wasEndedBy(end2; a,_e2,_a2,_t2,_attrs2) +THEN +start1 +precedes +end2. +
  5. +
+
+ +

Case 3 of the above constraint says that the +agent ag +must have ended after the start of the activity a, +ensuring some overlap between the two. Since ag is the subject of a +wasEndedBy statement, it is an activity according to the typing constraints. Case 4 handles the symmetric + case, ensuring that the start of an agent-activity precedes the + start of an associated activity.

+ +

+ +


+ +

An agent to which an entity was attributed, MUST exist before this entity was generated. +This is +illustrated by Figure 6 (b) and expressed by Constraint 48 (wasAttributedTo-ordering).

+ + + + +
+
  1. + IF +wasAttributedTo(_at; e,ag,_attrs) +and +wasGeneratedBy(gen1; ag,_a1,_t1,_attrs1) +and +wasGeneratedBy(gen2; e,_a2,_t2,_attrs2) +THEN +gen1 +precedes +gen2. +
  2. + IF +wasAttributedTo(_at; e,ag,_attrs) +and +wasStartedBy(start1; ag,_e1,_a1,_t1,_attrs1) +and +wasGeneratedBy(gen2; e,_a2,_t2,_attrs2) +THEN +start1 +precedes +gen2. +
  3. +
+
+ +

+


+ +

For delegation, the responsible agent has to precede or have some overlap with the subordinate agent.

+ + +
+
  1. + IF +actedOnBehalfOf(_del; ag2,ag1,_a,_attrs) +and +wasGeneratedBy(gen1; ag1,_a1,_t1,_attrs1) +and +wasInvalidatedBy(inv2; ag2,_a2,_t2,_attrs2) +THEN +gen1 +precedes +inv2. +
  2. + IF +actedOnBehalfOf(_del; ag2,ag1,_a,_attrs) +and +wasStartedBy(start1; ag1,_e1,_a1,_t1,_attrs1) +and +wasEndedBy(end2; ag2,_e2,_a2,_t2,_attrs2) +THEN +start1 +precedes +end2. +
  3. +
+ +
+ +
+ +
+ + + +
+

6.3 Type Constraints

+ +

The following rules assign types to identifiers +based on their use within statements. +The function typeOf gives the set of types denoted by an identifier. +That is, typeOf(e) returns the set of types +associated with identifier e. The function +typeOf is not a PROV statement, but a +construct used only during validation, similar to precedes. +

+ + + + +

+ For any identifier id, typeOf(id) is a subset of {'entity', 'activity', 'agent', 'prov:Collection', 'prov:EmptyCollection'}. +For identifiers that do not have a type, typeOf gives the empty set. + Identifiers can have more than one type, because of subtyping + (e.g. 'prov:EmptyCollection' is a subtype of 'prov:Collection') or because certain types are not + disjoint (such as 'agent' and 'entity'). The set of types + does not reflect all of the distinctions among objects, only those + relevant for checking validity. In particular, a subtype such as 'plan' is omitted, and statements such as wasAssociatedWith that have plan parameters only check that these parameters are entities. +

+ +

To check if a PROV instance satisfies type constraints, one obtains the types of identifiers by application of +Constraint 50 (typing) +and check that none of the impossibility constraints +Constraint 55 (entity-activity-disjoint) and +Constraint 56 (membership-empty-collection) are + violated as a result.

+ + +
+ + +
    +
  1. +IF + entity(e,attrs) +THEN +'entity' ∈ typeOf(e). +
  2. +IF + agent(ag,attrs) +THEN +'agent' ∈ typeOf(ag). +
  3. +IF + activity(a,t1,t2,attrs) +THEN +'activity' ∈ typeOf(a). + + +
  4. + +IF + used(u; a,e,t,attrs) +THEN +'activity' ∈ typeOf(a) AND +'entity' ∈ typeOf(e). + +
  5. +IF + wasGeneratedBy(gen; e,a,t,attrs) +THEN +'entity' ∈ typeOf(e) AND +'activity' ∈ typeOf(a). + +
  6. + +IF + wasInformedBy(id; a2,a1,attrs) +THEN +'activity' ∈ typeOf(a2) AND +'activity' ∈ typeOf(a1). + +
  7. + +IF + wasStartedBy(id; a2,e,a1,t,attrs) +THEN +'activity' ∈ typeOf(a2) AND +'entity' ∈ typeOf(e) AND +'activity' ∈ typeOf(a1). + + + +
  8. + + +IF + wasEndedBy(id; a2,e,a1,t,attrs) +THEN +'activity' ∈ typeOf(a2) AND +'entity' ∈ typeOf(e) AND +'activity' ∈ typeOf(a1). + + + +
  9. +IF + wasInvalidatedBy(id; e,a,t,attrs) +THEN +'entity' ∈ typeOf(e) AND +'activity' ∈ typeOf(a). + + + + +
  10. +IF + wasDerivedFrom(id; e2, e1, a, g2, u1, attrs) +THEN +'entity' ∈ typeOf(e2) AND +'entity' ∈ typeOf(e1) AND +'activity' ∈ typeOf(a). + In this constraint, a, g2, and u1 MUST NOT be placeholders. + +
  11. +IF + wasDerivedFrom(id; e2, e1, -, -, -, attrs) +THEN +'entity' ∈ typeOf(e2) AND +'entity' ∈ typeOf(e1). + +
  12. +IF + wasAttributedTo(id; e,ag,attr) +THEN +'entity' ∈ typeOf(e) AND +'agent' ∈ typeOf(ag). + + +
  13. +IF + wasAssociatedWith(id; a,ag,pl,attrs) +THEN +'activity' ∈ typeOf(a) AND +'agent' ∈ typeOf(ag) AND +'entity' ∈ typeOf(pl). In this +constraint, pl MUST NOT be a placeholder. + +
  14. +IF + wasAssociatedWith(id; a,ag,-,attrs) +THEN +'activity' ∈ typeOf(a) AND +'agent' ∈ typeOf(ag). + + + + +
  15. +IF + actedOnBehalfOf(id; ag2,ag1,a,attrs) +THEN +'agent' ∈ typeOf(ag2) AND +'agent' ∈ typeOf(ag1) AND +'activity' ∈ typeOf(a). + + + + +
  16. +IF + alternateOf(e2, e1) +THEN +'entity' ∈ typeOf(e2) AND +'entity' ∈ typeOf(e1). + + +
  17. +IF + specializationOf(e2, e1) +THEN +'entity' ∈ typeOf(e2) AND +'entity' ∈ typeOf(e1). + + + + +
  18. + +IF + hadMember(c,e) +THEN +'prov:Collection' ∈ typeOf(c) AND +'entity' ∈ typeOf(c) AND +'entity' ∈ typeOf(e). + + +
  19. + +IF + entity(c,[prov:type='prov:EmptyCollection']) +THEN +'entity' ∈ typeOf(c) AND +'prov:Collection' ∈ typeOf(c) AND +'prov:EmptyCollection' ∈ typeOf(c). + +
+
+ +
+ +
+

6.4 Impossibility constraints

+ +

Impossibility constraints require that certain patterns of +statements never appear in valid PROV instances. Impossibility +constraints have the following general form: +

+ +
+

IF hyp1 and ... and hypn THEN INVALID.

+
+ +

Checking an impossibility constraint on instance I means checking whether there is +any way of matching the pattern hyp1, ..., hypn. If there +is, then checking the constraint on I fails (which implies that +I is invalid). + + +


+ +

+A derivation with unspecified activity wasDerivedFrom(id;e1,e2,-,g,u,attrs) represents a derivation that + takes one or more steps, whose activity, generation and use events + are unspecified. It is forbidden to specify a generation or use + event without specifying the activity.

+ +
+

In the following rules, g and u MUST NOT be -.

+
    +
  1. IF + wasDerivedFrom(_id;_e2,_e1,-,g,-,attrs) + THEN INVALID.
  2. IF + wasDerivedFrom(_id;_e2,_e1,-,-,u,attrs) + THEN INVALID.
  3. +
  4. IF + wasDerivedFrom(_id;_e2,_e1,-,g,u,attrs) + THEN INVALID.
  5. +
+
+
+ +

As noted previously, specialization is a + strict partial order: it is irreflexive and + transitive.

+ +
+ +

IF specializationOf(e,e) THEN INVALID.

+
+ + + + + +
+ + +

Furthermore, identifiers + of basic relationships are disjoint. +

+
+

+For each r and s + in { +used, +wasGeneratedBy, +wasInvalidatedBy, +wasStartedBy, +wasEndedBy, +wasInformedBy, +wasAttributedTo, +wasAssociatedWith, +actedOnBehalfOf} such that r and s + are different relation names, the + following constraint holds: +

+

+ IF r(id; a1,...,am) and s(id; b1,...,bn) THEN INVALID. +

+
+ +
+

Since wasInfluencedBy is a superproperty of many other + properties, it is excluded from the set of properties whose + identifiers are required to be pairwise disjoint. The following + example illustrates this observation: +

wasInfluencedBy(id;e2,e1)
+wasDerivedFrom(id;e2,e1)
+
+

This satisfies the disjointness constraint. +

+

There is, however, no + constraint requiring that every influence relationship is + accompanied by a more specific relationship having the same + identifier. The following valid example illustrates this observation: +

wasInfluencedBy(id; e2,e1)
+
+

This is valid; there is no inferrable information about what kind + of influence relates e2 and e1, other than its identity. +

+
+ +

Identifiers of entities, + agents and activities cannot also be identifiers of properties. +

+
+

+For each p in {entity, activity + or agent} and for each r in { +used, +wasGeneratedBy, +wasInvalidatedBy, +wasInfluencedBy, +wasStartedBy, +wasEndedBy, +wasInformedBy, +wasDerivedFrom, +wasAttributedTo, +wasAssociatedWith, +actedOnBehalfOf}, the following + impossibility constraint holds:

+ +

IF p(id,a1,...,am) and + r(id; b1,...,bn) THEN INVALID. +

+
+ + + + +
+

The set of entities and activities are disjoint, expressed by + the following constraint: +

+
+ + +

+ IF +'entity' ∈ typeOf(id) AND +'activity' ∈ typeOf(id) +THEN INVALID.

+
+
+ There is no disjointness between entities and agents. This is because one might want to make statements about the provenance of an agent, by making it an entity. + For example, one can assert both entity(a1) and agent(a1) in a valid PROV instance. + Similarly, there is no disjointness between activities and + agents, and one can assert both activity(a1) and agent(a1) in a valid PROV instance. + However, one should keep in mind that some specific types of agents may not be suitable as activities. + For example, asserting statements such as agent(Bob, [type=prov:Person]) and activity(Bob) is discouraged. In these cases, disjointness can be ensured by explicitly asserting the agent as both agent and entity, and applying Constraint 55 (entity-activity-disjoint). +
+ + +
+

An empty collection cannot contain any member, expressed by + the following constraint: +

+
+

IF + hadMember(c,e) and +'prov:EmptyCollection' ∈ typeOf(c) +THEN INVALID.

+
+ + + +
+ + +
+ +
+

7. Normalization, Validity, and Equivalence

+ + +

We define the notions of normalization, validity and +equivalence of PROV documents and instances. We first define these concepts +for PROV instances and then extend them to PROV documents.

+ +
+ Implementations should expand + namespace prefixes and perform any appropriate reasoning about + co-reference of identifiers, and rewrite the instance (by + replacing co-referent identifiers with a single common identifier) to + make this explicit, before doing validation, equivalence checking, + or normalization. + All of the following definitions assume that the application has + already determined which URIs in the PROV instance are co-referent + (e.g. owl:sameAs as a result of OWL + reasoning). +
+ +
+

7.1 Instances

+ + +

We define the normal form of a PROV instance as the set +of provenance statements resulting from applying all definitions, + inferences, and uniqueness constraints, obtained as follows:

+ + + +
    +
  1. + Apply all definitions to I by replacing each defined statement by its + definition (possibly introducing fresh existential variables in + the process), yielding an instance I1. +
  2. +
  3. + Apply all inferences to I1 by adding the conclusion of each inference + whose hypotheses are satisfied and whose entire conclusion does not + already hold (again, possibly introducing fresh existential + variables), yielding an instance I2. +
  4. +
  5. + Apply all uniqueness constraints to I2 by unifying terms or merging statements + and applying the resulting substitution to the instance, yielding + an instance I3. If some uniqueness constraint cannot be + applied, then normalization fails. +
  6. +
  7. If no definitions, inferences, or uniqueness constraints can be applied to instance I3, then I3 is the + normal form of I.
  8. +
  9. Otherwise, the normal form of I is the same as the normal form + of I3 (that is, proceed by + normalizing I3 at step 1). +
+ +

Because of the potential interaction among definitions, inferences, and + constraints, the above algorithm is iterative. Nevertheless, + all of our constraints fall into a class of tuple-generating + dependencies and equality-generating dependencies that + satisfy a termination condition called weak acyclicity that + has been studied in the context of relational databases + [DBCONSTRAINTS]. Therefore, the above algorithm terminates, independently + of the order in which inferences and constraints are applied. + Appendix A gives a proof that normalization terminates and produces + a unique (up to isomorphism) normal form. +

+ +

+ A PROV instance is valid +if its normal form exists and all of + the validity constraints succeed on the normal form. + The following algorithm can be used to test + validity:

+ +
    +
  1. Normalize the instance I, obtaining + normal form I'. If + normalization fails, then I is not valid. +
  2. +
  3. Apply all event ordering constraints to I' to build a graph G whose nodes + are event identifiers and edges + are labeled by "precedes" + and "strictly precedes" relationships among events induced by the constraints.
  4. +
  5. Determine whether there is a cycle in G that contains a + "strictly precedes" edge. If so, then I is not valid. +
  6. +
  7. Apply the type constraints (section + 5.3) to determine whether there are any violations of + disjointness. If so, then I is not valid. +
  8. + Check that none of the impossibility constraints (section 5.4) are + violated. If any are violated, then I is + not valid. Otherwise, I is valid. +
  9. +
+ +

A normal form of a PROV instance does not exist when a uniqueness + constraint fails due to unification or merging failure.

+ + + +

Two valid PROV instances are equivalent if they + have isomorphic normal forms. That is, after applying all possible inference +rules, the two instances produce the same set of PROV statements, +up to reordering of statements and attributes within attribute lists, + and renaming of existential variables. +

+

Equivalence can also be checked over pairs of PROV instances that + are not necessarily valid, subject to the following rules: +

    +
  • If both are valid, then equivalence is + defined above.
  • +
  • If both are invalid, then equivalence can be + implemented in any way provided it is reflexive, symmetric, and transitive. +
  • +
  • If one instance is valid and the other is invalid, then the two + instances are not equivalent.
  • +
+

+Equivalence has the following characteristics over valid instances:

+ +
    +
  • + The order of provenance statements is irrelevant to the meaning of + a PROV instance. That is, a + PROV instance is equivalent to any other instance obtained by +reordering its statements. +
  • +
  • The order of attribute-value pairs in attribute lists is + irrelevant to the meaning of a PROV statement. That is, a PROV + statement carrying attributes is equivalent to any other statement + obtained by reordering attribute-value pairs and eliminating + duplicate pairs. +
  • +
  • The particular choices of names of existential variables are irrelevant to the meaning + of an instance; that is, the names can be renamed without changing + the meaning, as long as different names are always replaced with + different names. (Replacing two different names with equal names, + however, can + change the meaning, so does not preserve equivalence.)
  • +
  • + Applying inference rules, definitions, and uniqueness constraints preserves equivalence. That is, a PROV + instance is equivalent to the instance obtained by applying any + inference rule or definition, or by unifying two terms or merging two statements to + enforce a uniqueness constraint. +
  • +
  • Equivalence is reflexive, symmetric, and + transitive. (This is because a valid instance has a unique + normal form up to isomorphism [DBCONSTRAINTS]).
  • +
+ +

An application that processes PROV data SHOULD handle +equivalent instances in the same way. This guideline is necessarily +imprecise because "in the same way" is application-specific. +Common exceptions to this guideline +include, for example, applications that pretty-print or digitally sign +provenance, where the order and syntactic form of statements matters.

+ +
+ +
+

7.2 Bundles and Documents

+ + +

The definitions, inferences, and constraints, and +the resulting notions of normalization, validity and equivalence, +work on a single PROV instance. In this +section, we describe how to deal with general PROV +documents, possibly including multiple named bundles as well as a +toplevel instance. Briefly, each bundle is +handled independently; there is no interaction between bundles from +the perspective of applying definitions, inferences, or constraints, +computing normal forms, or checking validity or equivalence.

+ +

We model a general PROV document, containing n named bundles +b1...bn, as a tuple +(I0,[b1=I1,...,bn=In]) +where I0 is the toplevel +instance, and for each i, Ii is the instance associated with +bundle bi. This notation is shorthand for the +following PROV-N syntax:

+ +
+document
+   I0
+   bundle b1
+      I1
+   endBundle
+   ...
+   bundle bn
+      In
+   endBundle
+endDocument +
+ +

The normal form of a PROV document +(I0,[b1=I1,...,[bn=In]) is (I'0,[b1=I'1,...,bn=I'n]) +where I'i is the normal +form of Ii for each i between 0 and n.

+ +

A PROV document is valid if each of the bundles I0, +..., In are valid and none of the bundle identifiers bi are repeated.

+ +

Two (valid) PROV documents (I0,[b1=I1,...,bn=In]) and +(I'0,[b1'=I'1,...,b'm=I'm]) are equivalent if I0 is +equivalent to I'0 and n = m and +there exists a permutation P : {1..n} -> {1..n} such that for each i, bi = +b'P(i) and Ii is equivalent to I'P(i). +

+ +
+ + +
+ + + + + + + + + + + +
+

8. Glossary

+ +
    +
  • antisymmetric: A relation R over X is antisymmetric if + for any elements x, y of X, if x R y and y R x then x = y.
  • +
  • asymmetric: A relation R over X is asymmetric if + x R y and y R x do not hold for any elements x, y of X.
  • +
  • equivalence relation: An equivalence relation is a relation + that is reflexive, symmetric, and + transitive.
  • +
  • irreflexive: A relation R over X is irreflexive if + for x R x does not hold for any element x of X.
  • +
  • partial order: A partial order is a relation + that is reflexive, antisymmetric, and transitive.
  • +
  • preorder: A preorder is a relation that is + reflexive and transitive. (It is not necessarily antisymmetric, + meaning there can be cycles of distinct elements x1 R x2 R ... R + xn R x1.
  • +
  • reflexive: A relation R over X is reflexive if + for any element x of X, we have x R x.
  • +
  • strict partial order: A strict partial order is a + relation that is irreflexive, asymmetric and transitive.
  • +
  • strict preorder: A strict preorder is a relation + that is irreflexive and transitive.
  • +
  • symmetric: A relation R over X is symmetric if + for any elements x, y of X, if x R y then y R x.
  • +
  • transitive: A relation R over X is transitive if + for any elements x, y, z of X, if x R y and y R z then x R z.
  • + + +
+
+ + +
+

A. Termination of normalization

This section is non-normative.

+ +

+ We will show that normalization terminates, that is, that + applying definitions, inferences and uniqueness/key constraints + eventually either fails (due to constraint violation) or + terminates with a normal form. +

+

+ First, since the inferences and constraints never introduce new + defined statements, for the purpose of termination we always expand + the definitions first and then consider only normalization of + instances in which there are no remaining defined statements. +

+

We will prove termination for the simple case where there are no + attributes. For the general case, we will show that any + nontermination arising from an instance that does involve + attributes would also arise from one with no attributes. +

+ +

Termination for instances without attributes. + As shown in [DBCONSTRAINTS], termination of normalization can be + shown by checking that the inference rules are weakly + acyclic. In addition, weak acyclicity can be checked + in a modular fashion for our system, because there are only a few possible + cycles among statements. The following table summarizes seven + stages of the inference rules; because there are no + cycles among stages, it is sufficient to check weak acyclicity + of each stage independently. +

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Stage #InferenceHypothesesConclusions
119, 20, 21specializationOf specializationOf, entity
27, 8, 13, 14entity, activity, wasAttributedTo, actedOnBehalfOfwasInvalidatedBy, wasStartedBy, wasEndedBy, + wasAssociatedWith
39, 10wasStartedBy, wasEndedBywasGeneratedBy
411, 12wasDerivedFromwasGeneratedBy, used, alternateOf
516, 17, 18alternateOf, entityalternateOf
65, 6wasInformedBy, generated, usedwasInformedBy, generated, used
715manywasInfluencedBy
+

+ For each stage, we show that the stage is weakly acyclic. +

  • Stages 1 and 5 have no rules with existential quantifiers, + so they are weakly acyclic. +
  • +
  • Stages 2, 3, 4, and 7 have no cycles among the formulas + involved, so they are weakly acyclic. +
  • +
  • For stage 6, we check weak acyclicity using the algorithm + in [DBCONSTRAINTS], namely: +
    • Given a formula φ(x1,...,xn) ⇒ + ∃y1,...,ym. ψ(x1,...,xn,y1,...,ym)
    • +
    • For every x that occurs in ψ, and for every + occurrence of x in φ in position r.i: +
      1. For every occurrence of x in position s.j, add + an edge from r.i to s.j (if it does + not already exist).
      2. +
      3. In addition, for every existentially quantified variable y + and for every occurrence of y in ψ in position + t.k, add a special edge from r.i to t.k (if it does + not already exist). +
      4. +
      +
    • +
    + Weak + acyclicity means that there is no cycle involving a special + edge in the resulting graph. For the two inferences in stage 6, + the following dependency graph witnesses weak + acyclicity. The nodes wasGeneratedBy.i, + wasInformedBy.i, and used.i denote the ith arguments + of the corresponding predicates. The solid edges are ordinary + edges, and the dashed edges are special edges. +
  • +
+ + + Graph illustrating weak
+       acyclicity of stage 6 + +

Termination for instances with attributes. + We can translate an instance with attributes to an alternative, + purely relational language by introducing a relation + attribute(id,a,v) and replacing every statement of the form + r(id;a1,...,an,[(k1,v1),...,(km,vm)]) with + r(id;a1,...,an),attribute(id,k1,v1),...,attribute(id,km,vm), + and similarly for entity, activity and agent + attributes. The inference rules can also be translated so as + to work on these instances, and a similar argument to + the above shows that inference is terminating on instances with + explicit attributes. Any infinite + sequence of normalization steps on the original instance would + lead to an infinite sequence of translated normalization steps + on instances with explicit attributes. +

+
+ +
+

B. Change Log

+ +
+

B.1 Changes since Proposed Recommendation

+
    +
  • Changed the status of this document section. +
  • Changed all URLs to PROV documents. +
  • Fixed some minor typos in section 2.4. +
  • Fixed typo in remark after definition 2. +
  • Fixed typo in paragraph after table 2. +
  • Fixed typo in sec. 6.3. +
  • Fixed wording in remark in sec. 7.1, and moved it before + section heading. +
  • Fixed typo in appendix A. +
+ +
+ + +
+

B.2 Changes from Candidate Recommendation to Proposed Recommendation

+

Please see the + Responses to Public Comments on the Candidate Recommendation + for more details about the justification of these changes.

+
    +
  • Reworded description of toplevel instance and + bundles to provide a clearer restatement in one place (Sec. 1.2)
  • +
  • Fixed a number of broken links from definition references to definitions
  • +
  • Updated the Status of This Document to describe proposed recommendation + status and updated references to other PR-stage PROV documents
  • +
  • Added clarification concerning constraint + wasAssociatedWith-ordering (issue-615).
  • +
  • Added underscores to some variables in inferences 9, 10, + 15 (issue-611).
  • +
  • Corrected a typo in the name hadMember in constraint 56 + (issue-611). +
  • +
  • Clarified that existential variables are scoped at the + instance level, not statement level, thus it is correct to apply + uniqueness constraints by substituting variables through an + instance (issue-611). (Remark at the end of section + 4. Basic concepts, and clarified discussion in Validation Process Overview)
  • +
  • Gave equivalent form of Definition 2 (issue-611).
  • +
+
+ +
+

B.3 Changes from Last Call Working Draft to Candidate Recommendation

+

Please see the + Responses to Public Comments on the Last Call Working Draft + for more details about the justification of these changes.

+ +
    +
  • Abstract: clarified that term "validity" is analogous to other + notions of validity in Web standards.
  • +
  • Added bullet point linking to PROV-SEM under "How to read the + PROV family of specifications"
  • +
  • Revised sec. 1.2 to clarify terminology (validity), emphasize + that any implementation equivalent to the procedural specification + is compliant, and clarify that treating "equivalent instances in the + same way" is a guideline.
  • +
  • Added paragraph to sec 2.4 to clarify the purpose of the section.
  • +
  • Sec 2.4 Unification and Merging: changed "merging" to "unification" for terms
  • +
  • Sec. 2.4 "Applying definitions, inferences and constraints": + Updated merging to unification and added paragraph reinforcing that + compliance is algorithm independent
  • +
  • Sec. 2.4 "Checking ordering, typing and impossibility + constraints": Avoided use of the term "satisfies".
  • +
  • Sec. 2.4 "Equivalence and Isomorphism": Extended equivalence to + be defined on all instances, valid or not. Removed analogy to RDF.
  • +
  • Sec. 2.4 "From Instances to Bundles and Documents": Revised to + avoid giving the impression that toplevel instances must be disjoint + from bundles; removed reference to RDF.
  • +
  • Sec. 3. Clarified and reinforced algorithm independence.
  • +
  • Sec. 4. Added clarifying remark about role of definitions.
  • +
  • Sec. 4. Avoided reference to RDF, minor clarifications to + discussion of existential variables.
  • +
  • Sec. 4.1. Spelling correction.
  • +
  • Sec. 4.4. Merging -> unification
  • +
  • Sec. 5. Merging -> unification terminology change. Added + declarative definition of unification. Clarified + procedural definition. Removed definition of merging of attribute + lists. Updated descriptions of uniqueness and key constraint application.
  • +
  • Constraint 23. Renamed e, a, ag to id.
  • +
  • Sec. 5.2. Explicitly stated that strictly-precedes is irreflexive.
  • +
  • Sec. 5.2. Spelling
  • +
  • Sec. 5.2, just before constraint 51: updated text to accurately + describe constraint.
  • +
  • Sec. 6. Merging -> unification. Updated definition of validity + to avoid referring to "satisfies". Explicitly defined isomorphism + of instances. Broadened the definition of equivalence so that it is + allowed to test arbitrary instances for equivalence. Reinforce the + intention of the guideline that applications treat equivalent + instances "in the same way".
  • +
  • Dropped RDF as a normative reference.
  • +
  • Made PROV-DM and PROV-N into normative references.
  • +
  • Added "document" and "endDocument" to sec. 6.2.
  • +
  • Added sentence of explanation of purpose to beginning.
  • +
  • Moved "mention" to a separate note.
  • +
  • Added Section 4: Basic Concepts.
  • +
  • Miscellaneous final cleanup prior to CR staging.
  • +
  • Added html link to provenance.
  • +
+ +
+ +
+ + +
+

C. Acknowledgements

+

+ +This document has been produced by the Provenance Working Group, and its contents reflect extensive discussion within the Working Group as a whole. The editors extend special thanks to Ivan Herman (W3C/ERCIM), Paul Groth, Tim Lebo, Simon Miles, Stian Soiland-Reyes, for their thorough reviews. +

+ +

+The editors acknowledge valuable contributions from the following: +Tom Baker, +David Booth, +Robert Freimuth, +Satrajit Ghosh, +Ralph Hodgson, +Renato Iannella, +Jacek Kopecky, +James Leigh, +Jacco van Ossenbruggen, +Héctor Pérez-Urbina, +Alan Ruttenberg, +Reza Samavi, +Evren Sirin, +Antoine Zimmermann. +

+ +

+Members of the Provenance Working Group at the time of publication of this document were: + +Ilkay Altintas (Invited expert), +Reza B'Far (Oracle Corporation), +Khalid Belhajjame (University of Manchester), +James Cheney (University of Edinburgh, School of Informatics), +Sam Coppens (iMinds - Ghent University), +David Corsar (University of Aberdeen, Computing Science), +Stephen Cresswell (The National Archives), +Tom De Nies (iMinds - Ghent University), +Helena Deus (DERI Galway at the National University of Ireland, Galway, Ireland), +Simon Dobson (Invited expert), +Martin Doerr (Foundation for Research and Technology - Hellas(FORTH)), +Kai Eckert (Invited expert), +Jean-Pierre EVAIN (European Broadcasting Union, EBU-UER), +James Frew (Invited expert), +Irini Fundulaki (Foundation for Research and Technology - Hellas(FORTH)), +Daniel Garijo (Universidad Politécnica de Madrid), +Yolanda Gil (Invited expert), +Ryan Golden (Oracle Corporation), +Paul Groth (Vrije Universiteit), +Olaf Hartig (Invited expert), +David Hau (National Cancer Institute, NCI), +Sandro Hawke (W3C/MIT), +Jörn Hees (German Research Center for Artificial Intelligence (DFKI) Gmbh), +Ivan Herman, (W3C/ERCIM), +Ralph Hodgson (TopQuadrant), +Hook Hua (Invited expert), +Trung Dong Huynh (University of Southampton), +Graham Klyne (University of Oxford), +Michael Lang (Revelytix, Inc.), +Timothy Lebo (Rensselaer Polytechnic Institute), +James McCusker (Rensselaer Polytechnic Institute), +Deborah McGuinness (Rensselaer Polytechnic Institute), +Simon Miles (Invited expert), +Paolo Missier (School of Computing Science, Newcastle university), +Luc Moreau (University of Southampton), +James Myers (Rensselaer Polytechnic Institute), +Vinh Nguyen (Wright State University), +Edoardo Pignotti (University of Aberdeen, Computing Science), +Paulo da Silva Pinheiro (Rensselaer Polytechnic Institute), +Carl Reed (Open Geospatial Consortium), +Adam Retter (Invited Expert), +Christine Runnegar (Invited expert), +Satya Sahoo (Invited expert), +David Schaengold (Revelytix, Inc.), +Daniel Schutzer (FSTC, Financial Services Technology Consortium), +Yogesh Simmhan (Invited expert), +Stian Soiland-Reyes (University of Manchester), +Eric Stephan (Pacific Northwest National Laboratory), +Linda Stewart (The National Archives), +Ed Summers (Library of Congress), +Maria Theodoridou (Foundation for Research and Technology - Hellas(FORTH)), +Ted Thibodeau (OpenLink Software Inc.), +Curt Tilmes (National Aeronautics and Space Administration), +Craig Trim (IBM Corporation), +Stephan Zednik (Rensselaer Polytechnic Institute), +Jun Zhao (University of Oxford), +Yuting Zhao (University of Aberdeen, Computing Science). +

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

D. References

D.1 Normative references

[PROV-DM]
Luc Moreau; Paolo Missier; eds. PROV-DM: The PROV Data Model. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-dm-20130430/ +
[PROV-N]
Luc Moreau; Paolo Missier; eds. PROV-N: The Provenance Notation. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-n-20130430/ +
[PROV-O]
Timothy Lebo; Satya Sahoo; Deborah McGuinness; eds. PROV-O: The PROV Ontology. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-o-20130430/ +
[RFC2119]
S. Bradner. Key words for use in RFCs to Indicate Requirement Levels. March 1997. Internet RFC 2119. URL: http://www.ietf.org/rfc/rfc2119.txt +
[RFC3987]
M. Dürst; M. Suignard. Internationalized Resource Identifiers (IRIs) (RFC 3987). January 2005. RFC. URL: http://www.ietf.org/rfc/rfc3987.txt +

D.2 Informative references

[CHR]
Thom Frühwirth. Constraint Handling Rules. Cambridge University Press URL: http://constraint-handling-rules.org/ +
[CLOCK]
L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21 (7): 558–565. 1978. URL: http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf DOI: doi:10.1145/359545.359563. +
[DBCONSTRAINTS]
Ronald Fagin; Phokion G. Kolaitis; Renée J. Miller; Lucian Popa. Data exchange: Semantics and query answering. Theoretical computer science 336(1):89-124 Elsevier URL: http://dx.doi.org/10.1016/j.tcs.2004.10.033 +
[Logic]
W. E. Johnson. Logic: Part III.1924. URL: http://www.ditext.com/johnson/intro-3.html +
[PROV-AQ]
Graham Klyne; Paul Groth; eds. Provenance Access and Query. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/ +
[PROV-DC]
Daniel Garijo; Kai Eckert; eds. Dublin Core to PROV Mapping. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/ +
[PROV-DICTIONARY]
Tom De Nies; Sam Coppens; eds. PROV Dictionary: Modeling Provenance for Dictionary Data Structures. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-dictionary-20130430/ +
Luc Moreau; Timothy Lebo; eds. Linking Across Provenance Bundles. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-links-20130430/ +
[PROV-OVERVIEW]
Paul Groth; Luc Moreau; eds. PROV-OVERVIEW: An Overview of the PROV Family of Documents. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-overview-20130430/ +
[PROV-PRIMER]
Yolanda Gil; Simon Miles; eds. PROV Model Primer. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-primer-20130430/ +
[PROV-SEM]
James Cheney; ed. Semantics of the PROV Data Model. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-sem-20130430. +
[PROV-XML]
Hook Hua; Curt Tilmes; Stephan Zednik; eds. PROV-XML: The PROV XML Schema. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/ +
diff --git a/app/specs/standards/texts/0f18b22510e50dda46922aba29bb149e65067ff3885362b03ddf2fb2c561c812 b/app/specs/standards/texts/0f18b22510e50dda46922aba29bb149e65067ff3885362b03ddf2fb2c561c812 new file mode 100644 index 00000000..a80a2820 --- /dev/null +++ b/app/specs/standards/texts/0f18b22510e50dda46922aba29bb149e65067ff3885362b03ddf2fb2c561c812 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:end1-other;ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/0f58c6644058f015321626fe788d90840e2e68d31a5fd0d17b52279ed9193d6b b/app/specs/standards/texts/0f58c6644058f015321626fe788d90840e2e68d31a5fd0d17b52279ed9193d6b new file mode 100644 index 00000000..9e85d537 --- /dev/null +++ b/app/specs/standards/texts/0f58c6644058f015321626fe788d90840e2e68d31a5fd0d17b52279ed9193d6b @@ -0,0 +1,16 @@ +document +prefix ex + +entity(ex:e2) + +bundle ex:bundle1 + activity(ex:e1,-,-) + entity(ex:e1) +endBundle + +bundle ex:bundle2 + entity(ex:e1,[prov:type='prov:EmptyCollection']) + hadMember(ex:e1,ex:e2) +endBundle + +endDocument diff --git a/app/specs/standards/texts/10d29e4444ccbfbed2ae5335a19e00f4ba69b7c8c081a2b4f21cf10d8f9a8277 b/app/specs/standards/texts/10d29e4444ccbfbed2ae5335a19e00f4ba69b7c8c081a2b4f21cf10d8f9a8277 new file mode 100644 index 00000000..292c83de --- /dev/null +++ b/app/specs/standards/texts/10d29e4444ccbfbed2ae5335a19e00f4ba69b7c8c081a2b4f21cf10d8f9a8277 @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1-other,ex:a2) +endDocument diff --git a/app/specs/standards/texts/1186acd22d39798e821fa259149f517d2c5cf3b9321c4386841fc8ace7a5c7ed b/app/specs/standards/texts/1186acd22d39798e821fa259149f517d2c5cf3b9321c4386841fc8ace7a5c7ed new file mode 100644 index 00000000..8c570ff3 --- /dev/null +++ b/app/specs/standards/texts/1186acd22d39798e821fa259149f517d2c5cf3b9321c4386841fc8ace7a5c7ed @@ -0,0 +1,11 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +activity(ex:ag,-,-) +agent(ex:ag) +entity(ex:e) +wasAttributedTo(ex:attr;ex:e, ex:ag) +wasStartedBy(ex:start1;ex:ag,-,ex:a1,-) +wasGeneratedBy(ex:gen2;ex:e,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/1556b8170d66016a8be6b1444aa7f5ca35f59043a534967c5b51468a87fcd7f1 b/app/specs/standards/texts/1556b8170d66016a8be6b1444aa7f5ca35f59043a534967c5b51468a87fcd7f1 new file mode 100644 index 00000000..193c8b2d --- /dev/null +++ b/app/specs/standards/texts/1556b8170d66016a8be6b1444aa7f5ca35f59043a534967c5b51468a87fcd7f1 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/1612cee39bcb61f4f831256a33f95d38089e035113e770a6d6bea6c7149739b5 b/app/specs/standards/texts/1612cee39bcb61f4f831256a33f95d38089e035113e770a6d6bea6c7149739b5 new file mode 100644 index 00000000..a0893e80 --- /dev/null +++ b/app/specs/standards/texts/1612cee39bcb61f4f831256a33f95d38089e035113e770a6d6bea6c7149739b5 @@ -0,0 +1,7 @@ +document + prefix ex + + activity(ex:a1,-,-) + wasStartedBy(ex:start1;ex:a1,-,-,-) + wasEndedBy(ex:end1;ex:a1,-,-,-) +endDocument diff --git a/app/specs/standards/texts/1803e5e900a47113591e0918a965c5fca3f81d1a9078986da639d73937757177 b/app/specs/standards/texts/1803e5e900a47113591e0918a965c5fca3f81d1a9078986da639d73937757177 new file mode 100644 index 00000000..6b0d192d --- /dev/null +++ b/app/specs/standards/texts/1803e5e900a47113591e0918a965c5fca3f81d1a9078986da639d73937757177 @@ -0,0 +1,6 @@ +document +prefix ex +entity(ex:e1,[prov:type='ex:test1']) +entity(ex:e1,[prov:type='ex:test2']) +activity(ex:a1,-,-) +endDocument diff --git a/app/specs/standards/texts/18e33158ac4929fc8032312ffea7e8e259d763e735c323e02b7400e1d45a0a7f b/app/specs/standards/texts/18e33158ac4929fc8032312ffea7e8e259d763e735c323e02b7400e1d45a0a7f new file mode 100644 index 00000000..ad1b9171 --- /dev/null +++ b/app/specs/standards/texts/18e33158ac4929fc8032312ffea7e8e259d763e735c323e02b7400e1d45a0a7f @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1-other,ex:ag1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/1d20f122f14c8b2095e237831dc3ba43ade39e0f1c90370af546724ca796df1d b/app/specs/standards/texts/1d20f122f14c8b2095e237831dc3ba43ade39e0f1c90370af546724ca796df1d new file mode 100644 index 00000000..608d94be --- /dev/null +++ b/app/specs/standards/texts/1d20f122f14c8b2095e237831dc3ba43ade39e0f1c90370af546724ca796df1d @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:inf1;-,ex:a1) +endDocument diff --git a/app/specs/standards/texts/24ebb0508edd8565fe1bf01062144ecc644f9be39f9d5adaa7f700efa000b3f1 b/app/specs/standards/texts/24ebb0508edd8565fe1bf01062144ecc644f9be39f9d5adaa7f700efa000b3f1 new file mode 100644 index 00000000..7cfffab9 --- /dev/null +++ b/app/specs/standards/texts/24ebb0508edd8565fe1bf01062144ecc644f9be39f9d5adaa7f700efa000b3f1 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +specializationOf(ex:e2,ex:e1) +specializationOf(ex:e1,ex:e2) +endDocument diff --git a/app/specs/standards/texts/25611268bbae6f00d1b4d5b2a3f46acc7b1adea064963732e40d2c0bb783995e b/app/specs/standards/texts/25611268bbae6f00d1b4d5b2a3f46acc7b1adea064963732e40d2c0bb783995e new file mode 100644 index 00000000..ef1feb24 --- /dev/null +++ b/app/specs/standards/texts/25611268bbae6f00d1b4d5b2a3f46acc7b1adea064963732e40d2c0bb783995e @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +specializationOf(ex:e2,ex:e1) +wasInvalidatedBy(ex:inv2;ex:e2,-,-) +wasInvalidatedBy(ex:inv1;ex:e1,-,-) +endDocument diff --git a/app/specs/standards/texts/286e2e87f774edd00106822c16461590b7f54959f7b629d3521e93234452ea65 b/app/specs/standards/texts/286e2e87f774edd00106822c16461590b7f54959f7b629d3521e93234452ea65 new file mode 100644 index 00000000..adf01b26 --- /dev/null +++ b/app/specs/standards/texts/286e2e87f774edd00106822c16461590b7f54959f7b629d3521e93234452ea65 @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,2012-11-16T17:05:00) +wasStartedBy(ex:start1;ex:a1,-,-,2111-11-11T11:11:11) +endDocument diff --git a/app/specs/standards/texts/2b239635e4fb903b271cf9ee24a628312f7b586b4417cbb29007ae63ecaa432b b/app/specs/standards/texts/2b239635e4fb903b271cf9ee24a628312f7b586b4417cbb29007ae63ecaa432b new file mode 100644 index 00000000..a5153893 --- /dev/null +++ b/app/specs/standards/texts/2b239635e4fb903b271cf9ee24a628312f7b586b4417cbb29007ae63ecaa432b @@ -0,0 +1,10 @@ +document +prefix ex +activity(ex:ag1,-,-) +agent(ex:ag1) +activity(ex:ag2,-,-) +agent(ex:ag2) +actedOnBehalfOf(ex:del;ex:ag2,ex:ag1,-) +wasStartedBy(ex:start1;ex:ag1,-,-,-) +wasEndedBy(ex:end2;ex:ag2,-,-,-) +endDocument diff --git a/app/specs/standards/texts/2c1271ecb3493f332b0d3b9a440c3a78c184e1688ad4a185ee72b2dc779247f8 b/app/specs/standards/texts/2c1271ecb3493f332b0d3b9a440c3a78c184e1688ad4a185ee72b2dc779247f8 new file mode 100644 index 00000000..2f531d3b --- /dev/null +++ b/app/specs/standards/texts/2c1271ecb3493f332b0d3b9a440c3a78c184e1688ad4a185ee72b2dc779247f8 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/2fee73a4f493a4c63af97adac9729f76abd9842683abbd5fbc8ac526ca9039f4 b/app/specs/standards/texts/2fee73a4f493a4c63af97adac9729f76abd9842683abbd5fbc8ac526ca9039f4 new file mode 100644 index 00000000..f582b5e3 --- /dev/null +++ b/app/specs/standards/texts/2fee73a4f493a4c63af97adac9729f76abd9842683abbd5fbc8ac526ca9039f4 @@ -0,0 +1,18 @@ +document + prefix ex + + activity(ex:a,-,-) + activity(ex:ag) + + agent(ex:ag) + entity(ex:e1) + entity(ex:e2) + entity(ex:e3) + entity(ex:e4) + + wasAssociatedWith(ex:assoc;ex:a,ex:ag,-) + wasStartedBy(ex:start1;ex:a,ex:e1,-,-) + wasStartedBy(ex:start2;ex:ag,ex:e3,-,-) + wasEndedBy(ex:end2;ex:ag,ex:e4,-,-) + wasEndedBy(ex:end1;ex:a,ex:e2,-,-) +endDocument diff --git a/app/specs/standards/texts/318ae3b5897a8eac3be0a7acef8d1a681727e468b3ce6e36411daf8ed45a5577 b/app/specs/standards/texts/318ae3b5897a8eac3be0a7acef8d1a681727e468b3ce6e36411daf8ed45a5577 new file mode 100644 index 00000000..39e4620e --- /dev/null +++ b/app/specs/standards/texts/318ae3b5897a8eac3be0a7acef8d1a681727e468b3ce6e36411daf8ed45a5577 @@ -0,0 +1,7 @@ +document + prefix ex + + entity(ex:e1, [prov:type='ex:test1']) + entity(ex:e2, [prov:type='ex:test2']) + wasGeneratedBy(ex:e1; ex:e3, ex:a4, -) +endDocument diff --git a/app/specs/standards/texts/377d278f043dca46eb2b5ad5339fc13c2d3f3ecc62a8546089e4821809b607de b/app/specs/standards/texts/377d278f043dca46eb2b5ad5339fc13c2d3f3ecc62a8546089e4821809b607de new file mode 100644 index 00000000..44e88caa --- /dev/null +++ b/app/specs/standards/texts/377d278f043dca46eb2b5ad5339fc13c2d3f3ecc62a8546089e4821809b607de @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/3a0752099ce970b08fc53991661dc524042a1b3a953fb423df46e4864d4e46ea b/app/specs/standards/texts/3a0752099ce970b08fc53991661dc524042a1b3a953fb423df46e4864d4e46ea new file mode 100644 index 00000000..cc01b163 --- /dev/null +++ b/app/specs/standards/texts/3a0752099ce970b08fc53991661dc524042a1b3a953fb423df46e4864d4e46ea @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,-,-) +wasStartedBy(ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/3a4f6ad74a4b7e0e5912b799efe274c1645cecfbbc5988c25cf92b53867b4aa4 b/app/specs/standards/texts/3a4f6ad74a4b7e0e5912b799efe274c1645cecfbbc5988c25cf92b53867b4aa4 new file mode 100644 index 00000000..b2a182d2 --- /dev/null +++ b/app/specs/standards/texts/3a4f6ad74a4b7e0e5912b799efe274c1645cecfbbc5988c25cf92b53867b4aa4 @@ -0,0 +1,10 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +used(ex:use1;ex:a1,ex:e1,-) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a1, ex:gen2, ex:use1) +endDocument diff --git a/app/specs/standards/texts/3c01db6567eecd22602bec5707ab0415e21253ddee503908d3ba1fa0aa464c98 b/app/specs/standards/texts/3c01db6567eecd22602bec5707ab0415e21253ddee503908d3ba1fa0aa464c98 new file mode 100644 index 00000000..b435465c --- /dev/null +++ b/app/specs/standards/texts/3c01db6567eecd22602bec5707ab0415e21253ddee503908d3ba1fa0aa464c98 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:a1,-,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/40354557ff9986b00e0f2536a7fd8a957a7c44b50c080e3d39ffb29c14449a61 b/app/specs/standards/texts/40354557ff9986b00e0f2536a7fd8a957a7c44b50c080e3d39ffb29c14449a61 new file mode 100644 index 00000000..424adc8c --- /dev/null +++ b/app/specs/standards/texts/40354557ff9986b00e0f2536a7fd8a957a7c44b50c080e3d39ffb29c14449a61 @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/4064f5bef5da086202ae9a5fa4f6d54f6c38ffe936429c1df8d4b205816cf92d b/app/specs/standards/texts/4064f5bef5da086202ae9a5fa4f6d54f6c38ffe936429c1df8d4b205816cf92d new file mode 100644 index 00000000..0c3956f4 --- /dev/null +++ b/app/specs/standards/texts/4064f5bef5da086202ae9a5fa4f6d54f6c38ffe936429c1df8d4b205816cf92d @@ -0,0 +1,7 @@ +document + prefix ex + + entity(ex:e1, [prov:type='ex:test1']) + entity(ex:e2, [prov:type='ex:test2']) + wasGeneratedBy(ex:gen1; ex:e1, ex:e2, -) +endDocument diff --git a/app/specs/standards/texts/4183792a919d233a95fcfadef2f38b3143c1260722bfcc23e6eb688ae1d71521 b/app/specs/standards/texts/4183792a919d233a95fcfadef2f38b3143c1260722bfcc23e6eb688ae1d71521 new file mode 100644 index 00000000..f139afd3 --- /dev/null +++ b/app/specs/standards/texts/4183792a919d233a95fcfadef2f38b3143c1260722bfcc23e6eb688ae1d71521 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +wasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/420f1d1419283f4aa2635e18bca31b359945bd2cedf9977e04551f45d12089c5 b/app/specs/standards/texts/420f1d1419283f4aa2635e18bca31b359945bd2cedf9977e04551f45d12089c5 new file mode 100644 index 00000000..22888354 --- /dev/null +++ b/app/specs/standards/texts/420f1d1419283f4aa2635e18bca31b359945bd2cedf9977e04551f45d12089c5 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:e1,ex:a1,2012-11-16T16:05:00) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/424787e3ed7a5cad070c9ade19dbb214218d1ffbe086d1e3c53d2e446277b20c b/app/specs/standards/texts/424787e3ed7a5cad070c9ade19dbb214218d1ffbe086d1e3c53d2e446277b20c new file mode 100644 index 00000000..974d82b2 --- /dev/null +++ b/app/specs/standards/texts/424787e3ed7a5cad070c9ade19dbb214218d1ffbe086d1e3c53d2e446277b20c @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,ex:e1-other,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/43643c2c1f3b8e981d2eea40ece0005cadadb4a9e07f639c692c6a975973c9bf b/app/specs/standards/texts/43643c2c1f3b8e981d2eea40ece0005cadadb4a9e07f639c692c6a975973c9bf new file mode 100644 index 00000000..7d31c553 --- /dev/null +++ b/app/specs/standards/texts/43643c2c1f3b8e981d2eea40ece0005cadadb4a9e07f639c692c6a975973c9bf @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/43dd267bbf13154078fe7cbb1ee94216ac0bba07f0562d16e550db7544b2e4bb b/app/specs/standards/texts/43dd267bbf13154078fe7cbb1ee94216ac0bba07f0562d16e550db7544b2e4bb new file mode 100644 index 00000000..3fbe57dd --- /dev/null +++ b/app/specs/standards/texts/43dd267bbf13154078fe7cbb1ee94216ac0bba07f0562d16e550db7544b2e4bb @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:e1,ex:a1,2012-11-16T16:05:00) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/464e7e59554659a12d7a41ed16ed5a523e433b86cf45eca3aab84e398e787f9f b/app/specs/standards/texts/464e7e59554659a12d7a41ed16ed5a523e433b86cf45eca3aab84e398e787f9f new file mode 100644 index 00000000..9a30c44b --- /dev/null +++ b/app/specs/standards/texts/464e7e59554659a12d7a41ed16ed5a523e433b86cf45eca3aab84e398e787f9f @@ -0,0 +1,6 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:del1;-, ex:e1) +endDocument diff --git a/app/specs/standards/texts/479f0e73c107c8fdfe8d594cdcd2e96b6fcfbe5d86812f2e975c99ed71db8045 b/app/specs/standards/texts/479f0e73c107c8fdfe8d594cdcd2e96b6fcfbe5d86812f2e975c99ed71db8045 new file mode 100644 index 00000000..0ece6610 --- /dev/null +++ b/app/specs/standards/texts/479f0e73c107c8fdfe8d594cdcd2e96b6fcfbe5d86812f2e975c99ed71db8045 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/49453489b7643110fad47780d3d787baa6d47c505e32fc0e034b16a179a892d8 b/app/specs/standards/texts/49453489b7643110fad47780d3d787baa6d47c505e32fc0e034b16a179a892d8 new file mode 100644 index 00000000..d1c9e694 --- /dev/null +++ b/app/specs/standards/texts/49453489b7643110fad47780d3d787baa6d47c505e32fc0e034b16a179a892d8 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +wasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/4997cfc625642dfa70b1482a07a0977cfd6502e0c74e2ed374868a70161c9228 b/app/specs/standards/texts/4997cfc625642dfa70b1482a07a0977cfd6502e0c74e2ed374868a70161c9228 new file mode 100644 index 00000000..71d96436 --- /dev/null +++ b/app/specs/standards/texts/4997cfc625642dfa70b1482a07a0977cfd6502e0c74e2ed374868a70161c9228 @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,2012-11-16T17:05:00) +wasStartedBy(ex:start1;ex:a1,-,-,2012-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/4a2d8fcfb41da49f608c99f53894f9ab7b1f5f135b7bace08f794eaed1010341 b/app/specs/standards/texts/4a2d8fcfb41da49f608c99f53894f9ab7b1f5f135b7bace08f794eaed1010341 new file mode 100644 index 00000000..e58906c6 --- /dev/null +++ b/app/specs/standards/texts/4a2d8fcfb41da49f608c99f53894f9ab7b1f5f135b7bace08f794eaed1010341 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +wasDerivedFrom(ex:der2;ex:e1, ex:e2) +endDocument diff --git a/app/specs/standards/texts/4d24db589b5595b08edbe03de7678da55addfc013ab20f0bca6f14ff02461718 b/app/specs/standards/texts/4d24db589b5595b08edbe03de7678da55addfc013ab20f0bca6f14ff02461718 new file mode 100644 index 00000000..b2c8f1dd --- /dev/null +++ b/app/specs/standards/texts/4d24db589b5595b08edbe03de7678da55addfc013ab20f0bca6f14ff02461718 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:a1,ex:a2) +wasInformedBy(ex:a1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/4fd4a9ca7de15605d0e54d49776e4a55abbe2c2336809c9d94dd0dc06f113282 b/app/specs/standards/texts/4fd4a9ca7de15605d0e54d49776e4a55abbe2c2336809c9d94dd0dc06f113282 new file mode 100644 index 00000000..dfae9142 --- /dev/null +++ b/app/specs/standards/texts/4fd4a9ca7de15605d0e54d49776e4a55abbe2c2336809c9d94dd0dc06f113282 @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2-other) +endDocument diff --git a/app/specs/standards/texts/51d41d02654fc81a7e4090f774658521087b2915e426dab3f0373b3d01a6157e b/app/specs/standards/texts/51d41d02654fc81a7e4090f774658521087b2915e426dab3f0373b3d01a6157e new file mode 100644 index 00000000..973a7398 --- /dev/null +++ b/app/specs/standards/texts/51d41d02654fc81a7e4090f774658521087b2915e426dab3f0373b3d01a6157e @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:del1;ex:e1, ex:ag2) +wasAttributedTo(ex:del2;ex:e1, ex:ag2) +endDocument diff --git a/app/specs/standards/texts/520b2b2414108b69a27f1ab6c434b51ecb3d241d0a1dc2eefdeb1512436bfc37 b/app/specs/standards/texts/520b2b2414108b69a27f1ab6c434b51ecb3d241d0a1dc2eefdeb1512436bfc37 new file mode 100644 index 00000000..69499695 --- /dev/null +++ b/app/specs/standards/texts/520b2b2414108b69a27f1ab6c434b51ecb3d241d0a1dc2eefdeb1512436bfc37 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:e1,ex:a1,2012-11-16T16:05:00) +wasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/522b87cef83194166add122afefce5fd92eb58c04fcbe8d9836eaa65a3d03397 b/app/specs/standards/texts/522b87cef83194166add122afefce5fd92eb58c04fcbe8d9836eaa65a3d03397 new file mode 100644 index 00000000..50448519 --- /dev/null +++ b/app/specs/standards/texts/522b87cef83194166add122afefce5fd92eb58c04fcbe8d9836eaa65a3d03397 @@ -0,0 +1,11 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +entity(ex:ag) +agent(ex:ag) +entity(ex:e) +wasAttributedTo(ex:attr;ex:e, ex:ag) +wasGeneratedBy(ex:gen1;ex:ag,ex:a1,-) +wasGeneratedBy(ex:gen2;ex:e,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/539dc9845af7148620117e878341e9557d06b551ee0dbd92bbb892ddfcb0b233 b/app/specs/standards/texts/539dc9845af7148620117e878341e9557d06b551ee0dbd92bbb892ddfcb0b233 new file mode 100644 index 00000000..3f205bdb --- /dev/null +++ b/app/specs/standards/texts/539dc9845af7148620117e878341e9557d06b551ee0dbd92bbb892ddfcb0b233 @@ -0,0 +1,5 @@ +document +prefix ex +entity(ex:e1) +specializationOf(ex:e1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/5472d513ae0db82c2bfd0af969547ff5a959637b43f5561951578c50ae4c3d35 b/app/specs/standards/texts/5472d513ae0db82c2bfd0af969547ff5a959637b43f5561951578c50ae4c3d35 new file mode 100644 index 00000000..682b7b0b --- /dev/null +++ b/app/specs/standards/texts/5472d513ae0db82c2bfd0af969547ff5a959637b43f5561951578c50ae4c3d35 @@ -0,0 +1,7 @@ +document + prefix ex + + activity(ex:a1,-,-) + activity(ex:a2,-,-) + wasInformedBy(ex:inf1; ex:a1, ex:a2) +endDocument diff --git a/app/specs/standards/texts/5504d694f2ce5d7e6b9f068acd7d599b752cdf0184f3afeddd45017c4ddb41a7 b/app/specs/standards/texts/5504d694f2ce5d7e6b9f068acd7d599b752cdf0184f3afeddd45017c4ddb41a7 new file mode 100644 index 00000000..ebcb7e1c --- /dev/null +++ b/app/specs/standards/texts/5504d694f2ce5d7e6b9f068acd7d599b752cdf0184f3afeddd45017c4ddb41a7 @@ -0,0 +1,6 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-,[prov:type='ex:test1']) +activity(ex:a1,-,-,[prov:type='ex:test2']) +endDocument diff --git a/app/specs/standards/texts/5688383394621a2c7fbb6d9654a9e5d7636aa891bcd38c1fd62e909bee0dc4f2 b/app/specs/standards/texts/5688383394621a2c7fbb6d9654a9e5d7636aa891bcd38c1fd62e909bee0dc4f2 new file mode 100644 index 00000000..5f59fb3b --- /dev/null +++ b/app/specs/standards/texts/5688383394621a2c7fbb6d9654a9e5d7636aa891bcd38c1fd62e909bee0dc4f2 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:a1,-,ex:a2,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/58707b1db5ec9e93ae8da7713c0f0afe8c9963c94119bc44206050bfcd89c87a b/app/specs/standards/texts/58707b1db5ec9e93ae8da7713c0f0afe8c9963c94119bc44206050bfcd89c87a new file mode 100644 index 00000000..1866eb99 --- /dev/null +++ b/app/specs/standards/texts/58707b1db5ec9e93ae8da7713c0f0afe8c9963c94119bc44206050bfcd89c87a @@ -0,0 +1,10 @@ +document + prefix ex + + activity(ex:a1,-,-) + entity(ex:e1) + + wasStartedBy(ex:start1;ex:a1,-,-,-) + used(ex:use1;ex:a1,ex:e1,-) + wasEndedBy(ex:end1;ex:a1,-,-,-) +endDocument diff --git a/app/specs/standards/texts/58d3f37965d94833e17033aa7497fee63f95d69907273239555769a56c35af38 b/app/specs/standards/texts/58d3f37965d94833e17033aa7497fee63f95d69907273239555769a56c35af38 new file mode 100644 index 00000000..54604b00 --- /dev/null +++ b/app/specs/standards/texts/58d3f37965d94833e17033aa7497fee63f95d69907273239555769a56c35af38 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc2;ex:a1,ex:ag1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/5a8dd5d121b55cb505f32094ae719ddcda77069486fbe4229ddae087039553ea b/app/specs/standards/texts/5a8dd5d121b55cb505f32094ae719ddcda77069486fbe4229ddae087039553ea new file mode 100644 index 00000000..2f0203cf --- /dev/null +++ b/app/specs/standards/texts/5a8dd5d121b55cb505f32094ae719ddcda77069486fbe4229ddae087039553ea @@ -0,0 +1,3770 @@ + + + + + + + + PROV-CONSTRAINTS Test Cases + + + + + + + + +
+ +

This document describes the process for reporting implemetations of [[PROV-CONSTRAINTS]], +i.e. PROV-CONSTRAINTS validators. +It provides the instructions for implementers on running PROV-CONSTRAINTS test cases and +reporting their results. +It also lists all the test cases and links to download them.

+ +
+ +
+ +
+ +

Report Your Validator

+ +

The support for constraints from [[PROV-CONSTRAINTS]] in implementations cannot be +determined as straightforward as with the features from the other PROV documents as +they are, in many cases, interrelated. Sometimes, it is indeed required to consider a +number of constraints together to determine the validity of a PROV document. +Therefore, in order to facility reporting implementations of PROV-CONSTRAINTS, we provide +test cases to assist with determining the level of support of a PROV-CONSTRAINTS +implementation.

+ +

A test case for PROV-CONSTRAINTS is a PROV document that contains either valid or +invalid PROV statements, and implementers of PROV-CONSTRAINTS are asked to determine its +validity (as specified in [[PROV-CONSTRAINTS]]). The test cases are specially designed to +cover a small set of constraints (called unit test cases, see Section 2.1) or to exercise a subset of PROV statements. By +successfully determining the validity of such a test case, an implementation indirectly +demonstrates its support for the PROV feature(s) covered by the test case.

+ +
+ +

Test cases

+ +

+Each test case is given an identifier, e.g. ordering-derivation1-PASS-c42, which +indicates whether the test case should be successfully validated (i.e. PASS) +or not (i.e. FAIL). In addition, a test case's identifier also includes the +numberings of the constraints that it covers at the end. +e.g. c42. +

+ +

The provenance document for each test case will be provided in the following representations:

+ + + + + + + + + + + + + + + + + + + + + + + +
Table 1. File representations provided for every test cases.
RepresentationFile extensionDocumentation
RDF (PROV-O).ttl[[PROV-O]] and [[TURTLE]]
PROV-N.provn[[PROV-N]]
PROV-XML.provx[[PROV-XML]]
+ +

For example, the available files for the test case ordering-derivation1-PASS-c42 +are: ordering-derivation1-PASS-c42.ttl, ordering-derivation1-PASS-c42.provn, +and ordering-derivation1-PASS-c42.provx. Please note that, all though we provide three different representations, you only need to validate one per each test case.

+ +

For your convenience, the download links for all the available test cases +(as enumerated in Section 2) +for each representation are respectively provided in the following text files: +rdf-tests.txt, provn-tests.txt, +and xml-tests.txt.

+
+ +
+ +

Test Results

+ +

Implementers are asked to validate each test case with their implementation and record +the validation results in two lists: the pass list and the fail list. +The pass list file MUST contain all the identifiers (one on each line) of +the test cases that have been successfully validated, and the fail list +MUST contain the identifiers of all those that have failed the validation. +The identifiers MUST also include the file extension, e.g. ordering-derivation1-PASS-c42.provn, +to indicate the versions that were actually tested. Test cases that are not supported by the +implementation SHOULD NOT be included in either of the lists.

+ +

For example, if a validator can only process the PROV-N representations of the three test cases +ordering-derivation1-PASS-c42, ordering-derivation2-FAIL-c42, and ordering-derivation3-PASS-c41-c42, we +expect the result lists's contents to be similar to the below.

+
+The pass list:
+	ordering-derivation1-PASS-c42.provn
+	ordering-derivation3-PASS-c41-c42.provn
+	
+The fail list:
+	ordering-derivation2-FAIL-c42.provn
+
+ + +

Please report your test results using the constraint questionnaire. +

+ +
+ +
+ +
+ +

Test Case Catalogues

+ +

This section enumerates all test cases available for PROV-CONSTRAINTS. There are two types of test cases:

+
+
Unit test cases
+
Unit test cases are designed to cover particular constraints (see Section 2.1). Please note that there are a small number of test cases we do not provide the RDF representation since the (invalid) constructs therein cannot be expressed in valid RDF.
+
Example test cases
+
These are examples from PROV documents, which excercise various PROV statements. They are typically complex examples and cover numerous contraints. Therefore, we did not those constraints in the test cases' identifiers. However, any PROV-CONSTRAINTS implementation SHOULD be able to successfully validate all the example test cases. Test cases for examples from [[PROV-DM]] and [[PROV-O]] are listed in Section 2.2 and Section 2.3 respectively.
+
+ +
+ +

Unit Test Cases

+ +

All test cases SHOULD be checked for their validity with respect to the constraints they cover. A success test result for a test case means its validity MUST be the same as its expected validation result as provided in Table 2 below.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 2. PROV-CONSTRAINTS test cases
IdentifierConstraintsExpected Validation ResultDownload links
ordering-activity1-PASS-c30 + Constraint 30 (start-precedes-end) + PASS + RDF + PROV-N + XML +
ordering-activity2-PASS-c33 + Constraint 33 (usage-within-activity) + PASS + RDF + PROV-N + XML +
ordering-activity3-PASS-c34 + Constraint 34 (generation-within-activity) + PASS + RDF + PROV-N + XML +
ordering-activity4-PASS-c31 + Constraint 31 (start-start-ordering) + PASS + RDF + PROV-N + XML +
ordering-activity5-PASS-c32 + Constraint 32 (end-end-ordering) + PASS + RDF + PROV-N + XML +
ordering-association1-PASS-c47 + Constraint 47 (wasAssociatedWith-ordering) + PASS + RDF + PROV-N + XML +
ordering-association2-PASS-c47 + Constraint 47 (wasAssociatedWith-ordering) + PASS + RDF + PROV-N + XML +
ordering-attribution1-PASS-c48 + Constraint 48 (wasAttributedTo-ordering) + PASS + RDF + PROV-N + XML +
ordering-attribution2-PASS-c48 + Constraint 48 (wasAttributedTo-ordering) + PASS + RDF + PROV-N + XML +
ordering-communication-PASS-c35 + Constraint 35 (wasInformedBy-ordering) + PASS + RDF + PROV-N + XML +
ordering-delegation1-PASS-c49 + Constraint 49 (actedOnBehalfOf-ordering) + PASS + RDF + PROV-N + XML +
ordering-delegation2-PASS-c49 + Constraint 49 (actedOnBehalfOf-ordering) + PASS + RDF + PROV-N + XML +
ordering-derivation1-PASS-c42 + Constraint 42 (derivation-generation-generation-ordering) + PASS + RDF + PROV-N + XML +
ordering-derivation2-FAIL-c42 + Constraint 42 (derivation-generation-generation-ordering) + FAIL + RDF + PROV-N + XML +
ordering-derivation3-PASS-c41-c42 + Constraint 41 (derivation-usage-generation-ordering)
+ Constraint 42 (derivation-generation-generation-ordering) +
PASS + RDF + PROV-N + XML +
ordering-ends1-PASS-c44 + Constraint 44 (wasEndedBy-ordering) + PASS + RDF + PROV-N + XML +
ordering-entity1-PASS-c36-c37-c38 + Constraint 36 (generation-precedes-invalidation)
+ Constraint 37 (generation-precedes-usage)
+ Constraint 38 (usage-precedes-invalidation) +
PASS + RDF + PROV-N + XML +
ordering-entity2-PASS-c36 + Constraint 36 (generation-precedes-invalidation) + PASS + RDF + PROV-N + XML +
ordering-entity3-PASS-c39 + Constraint 39 (generation-generation-ordering) + PASS + RDF + PROV-N + XML +
ordering-entity4-PASS-c40 + Constraint 40 (invalidation-invalidation-ordering) + PASS + RDF + PROV-N + XML +
ordering-specialization1-PASS-c45 + Constraint 45 (specialization-generation-ordering) + PASS + RDF + PROV-N + XML +
ordering-specialization2-PASS-c46 + Constraint 46 (specialization-invalidation-ordering) + PASS + RDF + PROV-N + XML +
ordering-specialization3-PASS-c42-c45 + Constraint 42 (derivation-generation-generation-ordering)
+ Constraint 45 (specialization-generation-ordering) +
PASS + RDF + PROV-N + XML +
ordering-specialization4-FAIL-c42-c45 + Constraint 42 (derivation-generation-generation-ordering)
+ Constraint 45 (specialization-generation-ordering) +
FAIL + RDF + PROV-N + XML +
ordering-starts1-PASS-c43 + Constraint 43 (wasStartedBy-ordering) + PASS + RDF + PROV-N + XML +
type-collection-FAIL-c56 + Constraint 56 (membership-empty-collection) + FAIL + RDF + PROV-N + XML +
type-f1-FAIL-c50-c55 + Constraint 50 (typing)
+ Constraint 55 (entity-activity-disjoint) +
FAIL + RDF + PROV-N + XML +
type-f2-FAIL-c50-c55 + Constraint 50 (typing)
+ Constraint 55 (entity-activity-disjoint) +
FAIL + RDF + PROV-N + XML +
type-f3-FAIL-c54 + Constraint 54 (impossible-object-property-overlap) + FAIL + RDF + PROV-N + XML +
type-f4-FAIL-c53 + Constraint 53 (impossible-property-overlap) + FAIL + RDF + PROV-N + XML +
type-s1-PASS-c50-c55 + Constraint 50 (typing)
+ Constraint 55 (entity-activity-disjoint) +
PASS + RDF + PROV-N + XML +
type-s2-PASS-c50-c55 + Constraint 50 (typing)
+ Constraint 55 (entity-activity-disjoint) +
PASS + RDF + PROV-N + XML +
unification-activity-end-f1-FAIL-c29 + Constraint 29 (unique-endTime) + FAIL + RDF + PROV-N + XML +
unification-activity-end-s1-PASS-c29 + Constraint 29 (unique-endTime) + PASS + RDF + PROV-N + XML +
unification-activity-s1-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-activity-s2-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-activity-s3-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-activity-s4-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-activity-start-f1-FAIL-c28 + Constraint 28 (unique-startTime) + FAIL + RDF + PROV-N + XML +
unification-activity-start-s1-PASS-c28 + Constraint 28 (unique-startTime) + PASS + RDF + PROV-N + XML +
unification-association-f1-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-association-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-association-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-association-f4-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-association-f5-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-association-f6-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-association-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-association-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-association-s3-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-association-s4-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-association-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attributes-activity-s1-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-attributes-end-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attributes-end-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attributes-entity-s1-PASS-c22 + Constraint 22 (key-object) + PASS + RDF + PROV-N + XML +
unification-attributes-start-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attributes-start-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attribution-f1-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-attribution-f2-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-attribution-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attribution-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attribution-s3-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-attribution-s4-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-bundle-f1-FAIL-c55-c56 + Constraint 55 (entity-activity-disjoint)
+ Constraint 56 (membership-empty-collection) +
FAIL + RDF + PROV-N + XML +
unification-communication-f1-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-communication-f2-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-communication-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-communication-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-communication-s3-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-communication-s4-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-delegation-f1-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-delegation-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-delegation-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-delegation-f6-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-delegation-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-delegation-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-delegation-s3-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-delegation-s4-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-delegation-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-derivation-f1-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-derivation-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-derivation-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-derivation-f4-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF* + PROV-N + XML +
unification-derivation-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-derivation-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-derivation-s3-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-derivation-s4-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-derivation-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-end-f1-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-end-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-end-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-end-f4-FAIL-c27 + Constraint 27 (unique-wasEndedBy) + FAIL + RDF + PROV-N + XML +
unification-end-f5-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-end-s1-PASS-c27 + Constraint 27 (unique-wasEndedBy) + PASS + RDF + PROV-N + XML +
unification-end-s2-PASS-c27 + Constraint 27 (unique-wasEndedBy) + PASS + RDF + PROV-N + XML +
unification-end-s3-PASS-c27 + Constraint 27 (unique-wasEndedBy) + PASS + RDF + PROV-N + XML +
unification-end-s4-PASS-c27 + Constraint 27 (unique-wasEndedBy) + PASS + RDF + PROV-N + XML +
unification-end-s5-PASS-c23-c27 + Constraint 23 (key-properties)
+ Constraint 27 (unique-wasEndedBy) +
PASS + RDF + PROV-N + XML +
unification-end-s6-PASS-c23-c27 + Constraint 23 (key-properties)
+ Constraint 27 (unique-wasEndedBy) +
PASS + RDF + PROV-N + XML +
unification-generation-f1-FAIL-c24 + Constraint 24 (unique-generation) + FAIL + RDF + PROV-N + XML +
unification-generation-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-f4-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-f5-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-f6-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-f7-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-generation-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-generation-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-generation-s3-PASS-c24 + Constraint 24 (unique-generation) + PASS + RDF + PROV-N + XML +
unification-generation-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-generation-s6-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-generation-s7-PASS-c23-c24 + Constraint 23 (key-properties)
+ Constraint 24 (unique-generation) +
PASS + RDF + PROV-N + XML +
unification-generation-s8-PASS-c23-c24 + Constraint 23 (key-properties)
+ Constraint 24 (unique-generation) +
PASS + RDF + PROV-N + XML +
unification-influence-f1-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-influence-f2-FAIL-DM + Malformed statement(s) + FAIL + RDF + PROV-N + XML +
unification-influence-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-invalidation-f1-FAIL-c25 + Constraint 25 (unique-invalidation) + FAIL + RDF + PROV-N + XML +
unification-invalidation-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-invalidation-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-invalidation-f4-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-invalidation-f5-FAIL-c23-c25 + Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation) +
FAIL + RDF + PROV-N + XML +
unification-invalidation-f6-FAIL-c23-c25 + Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation) +
FAIL + RDF + PROV-N + XML +
unification-invalidation-f7-FAIL-c23-c25 + Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation) +
FAIL + RDF + PROV-N + XML +
unification-invalidation-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-invalidation-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-invalidation-s3-PASS-c25 + Constraint 25 (unique-invalidation) + PASS + RDF + PROV-N + XML +
unification-invalidation-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-invalidation-s6-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-invalidation-s7-PASS-c23-c25 + Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation) +
PASS + RDF + PROV-N + XML +
unification-invalidation-s8-PASS-c23-c25 + Constraint 23 (key-properties)
+ Constraint 25 (unique-invalidation) +
PASS + RDF + PROV-N + XML +
unification-membership-f1-FAIL-DM + Malformed statement(s) + FAIL + No RDF + PROV-N + XML +
unification-specialization-f1-FAIL-DM + Malformed statement(s) + FAIL + No RDF + PROV-N + XML +
unification-specialization-f2-FAIL-DM + Malformed statement(s) + FAIL + No RDF + PROV-N + XML +
unification-specialization-f3-FAIL-c52 + Constraint 52 (impossible-specialization-reflexive) + FAIL + RDF + PROV-N + XML +
unification-specialization-f4-FAIL-c52 + Constraint 52 (impossible-specialization-reflexive) + FAIL + RDF + PROV-N + XML +
unification-start-f1-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f4-FAIL-c26 + Constraint 26 (unique-wasStartedBy) + FAIL + RDF + PROV-N + XML +
unification-start-f5-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f6-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f7-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-f8-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-start-s1-PASS-c26 + Constraint 26 (unique-wasStartedBy) + PASS + RDF + PROV-N + XML +
unification-start-s2-PASS-c26 + Constraint 26 (unique-wasStartedBy) + PASS + RDF + PROV-N + XML +
unification-start-s3-PASS-c26 + Constraint 26 (unique-wasStartedBy) + PASS + RDF + PROV-N + XML +
unification-start-s4-PASS-c26 + Constraint 26 (unique-wasStartedBy) + PASS + RDF + PROV-N + XML +
unification-start-s5-PASS-c23-c26 + Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy) +
PASS + RDF + PROV-N + XML +
unification-start-s6-PASS-c23-c26 + Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy) +
PASS + RDF + PROV-N + XML +
unification-start-s7-PASS-c23-c26 + Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy) +
PASS + RDF + PROV-N + XML +
unification-start-s8-PASS-c23-c26 + Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy) +
PASS + RDF + PROV-N + XML +
unification-start-s9-PASS-c23-c26 + Constraint 23 (key-properties)
+ Constraint 26 (unique-wasStartedBy) +
PASS + RDF + PROV-N + XML +
unification-usage-f2-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-usage-f3-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-usage-f4-FAIL-c23 + Constraint 23 (key-properties) + FAIL + RDF + PROV-N + XML +
unification-usage-f5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-f6-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-f7-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s1-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s2-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s5-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s6-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s7-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
unification-usage-s8-PASS-c23 + Constraint 23 (key-properties) + PASS + RDF + PROV-N + XML +
prov-o-property-hadGeneration-FAIL-c51-DM + Constraint 51 (impossible-unspecified-derivation-generation-use)
+ Malformed statement(s) +
FAIL + RDF + PROV-N + XML +
prov-o-property-hadUsage-FAIL-c51-DM + Constraint 51 (impossible-unspecified-derivation-generation-use)
+ Malformed statement(s) +
FAIL + RDF + PROV-N + XML +
+ +

These test cases cannot be represented in RDF since they contain statements with +same identifier, which are collapsed into one when converted into triples.

+ +
+ +
+

PROV-DM Test Cases

+

This section enumerates the example test cases from [[PROV-DM]].

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 3. Test cases from [[PROV-DM]] examples
IdentifierDownload links
prov-dm-ex16_provenance_notation-PASS + RDF + PROV-N + XML +
prov-dm-ex17_entity-PASS + RDF + PROV-N + XML +
prov-dm-ex18_activity-PASS + RDF + PROV-N + XML +
prov-dm-ex19_generation-PASS + RDF + PROV-N + XML +
prov-dm-ex20_generation-PASS + RDF + PROV-N + XML +
prov-dm-ex21_usage-PASS + RDF + PROV-N + XML +
prov-dm-ex22_communication-PASS + RDF + PROV-N + XML +
prov-dm-ex23_start-PASS + RDF + PROV-N + XML +
prov-dm-ex24_start-PASS + RDF + PROV-N + XML +
prov-dm-ex25_start-PASS + RDF + PROV-N + XML +
prov-dm-ex26_end-PASS + RDF + PROV-N + XML +
prov-dm-ex27_invalidation-PASS + RDF + PROV-N + XML +
prov-dm-ex28_invalidation-PASS + RDF + PROV-N + XML +
prov-dm-ex29_invalidation-PASS + RDF + PROV-N + XML +
prov-dm-ex30_derivation-PASS + RDF + PROV-N + XML +
prov-dm-ex31_revision-PASS + RDF + PROV-N + XML +
prov-dm-ex32_quotation-PASS + RDF + PROV-N + XML +
prov-dm-ex33_primary_source-PASS + RDF + PROV-N + XML +
prov-dm-ex34_agent-PASS + RDF + PROV-N + XML +
prov-dm-ex35_attribution-PASS + RDF + PROV-N + XML +
prov-dm-ex36_association-PASS + RDF + PROV-N + XML +
prov-dm-ex37_association-PASS + RDF + PROV-N + XML +
prov-dm-ex38_delegation-PASS + RDF + PROV-N + XML +
prov-dm-ex39_influence-PASS + RDF + PROV-N + XML +
prov-dm-ex40_bundle-PASS + RDF + PROV-N + XML +
prov-dm-ex41_bundle-PASS + RDF + PROV-N + XML +
prov-dm-ex43_specialization-PASS + RDF + PROV-N + XML +
prov-dm-ex44_alternate-PASS + RDF + PROV-N + XML +
prov-dm-ex45_alternate-PASS + RDF + PROV-N + XML +
prov-dm-ex46_collection-PASS + RDF + PROV-N + XML +
prov-dm-ex47_membership-PASS + RDF + PROV-N + XML +
prov-dm-ex48_label_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex49_location_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex50_role_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex51_type_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex52_value_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex53_value_attribute-PASS + RDF + PROV-N + XML +
prov-dm-ex55_value_time_instant-PASS + RDF + PROV-N + XML +
prov-dm-ex56_extensibility_points-PASS + RDF + PROV-N + XML +
prov-dm-ex57_extensibility_points-PASS + RDF + PROV-N + XML +
prov-dm-ex58_extensibility_points-PASS + RDF + PROV-N + XML +
prov-dm-ex_author_view-PASS + RDF + PROV-N + XML +
prov-dm-ex_process_view-PASS + RDF + PROV-N + XML +
prov-dm-ex_provenance_attribution-PASS + RDF + PROV-N + XML +
+ +
+ +
+ +

PROV-O Test Cases

+

This section enumerates the example test cases from [[PROV-O]].

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 4. Test cases from [[PROV-O]] examples
IdentifierDownload links
prov-o-class-Activity-PASS + RDF + PROV-N + XML +
prov-o-class-ActivityInfluence-PASS + RDF + PROV-N + XML +
prov-o-class-Agent-PASS + RDF + PROV-N + XML +
prov-o-class-AgentInfluence-PASS + RDF + PROV-N + XML +
prov-o-class-Association-PASS + RDF + PROV-N + XML +
prov-o-class-Attribution-PASS + RDF + PROV-N + XML +
prov-o-class-Bundle-PASS + RDF + PROV-N + XML +
prov-o-class-Collection-PASS + RDF + PROV-N + XML +
prov-o-class-Communication-PASS + RDF + PROV-N + XML +
prov-o-class-Delegation-PASS + RDF + PROV-N + XML +
prov-o-class-Derivation-FAIL + RDF + PROV-N + XML +
prov-o-class-EmptyCollection-PASS + RDF + PROV-N + XML +
prov-o-class-End-PASS + RDF + PROV-N + XML +
prov-o-class-Entity-PASS + RDF + PROV-N + XML +
prov-o-class-EntityInfluence-PASS + RDF + PROV-N + XML +
prov-o-class-Generation-PASS + RDF + PROV-N + XML +
prov-o-class-Influence-PASS + RDF + PROV-N + XML +
prov-o-class-InstantaneousEvent-PASS + RDF + PROV-N + XML +
prov-o-class-Invalidation-PASS + RDF + PROV-N + XML +
prov-o-class-Location-PASS + RDF + PROV-N + XML +
prov-o-class-Organization-PASS + RDF + PROV-N + XML +
prov-o-class-Person-PASS + RDF + PROV-N + XML +
prov-o-class-Plan-PASS + RDF + PROV-N + XML +
prov-o-class-PrimarySource-PASS + RDF + PROV-N + XML +
prov-o-class-Quotation-PASS + RDF + PROV-N + XML +
prov-o-class-Revision-PASS + RDF + PROV-N + XML +
prov-o-class-Role-PASS + RDF + PROV-N + XML +
prov-o-class-SoftwareAgent-PASS + RDF + PROV-N + XML +
prov-o-class-Start-PASS + RDF + PROV-N + XML +
prov-o-class-Usage-PASS + RDF + PROV-N + XML +
prov-o-property-actedOnBehalfOf-PASS + RDF + PROV-N + XML +
prov-o-property-activity-PASS + RDF + PROV-N + XML +
prov-o-property-agent-PASS + RDF + PROV-N + XML +
prov-o-property-alternateOf-PASS + RDF + PROV-N + XML +
prov-o-property-atLocation-PASS + RDF + PROV-N + XML +
prov-o-property-atTime-PASS + RDF + PROV-N + XML +
prov-o-property-endedAtTime-PASS + RDF + PROV-N + XML +
prov-o-property-entity-PASS + RDF + PROV-N + XML +
prov-o-property-generated-PASS + RDF + PROV-N + XML +
prov-o-property-generatedAtTime-PASS + RDF + PROV-N + XML +
prov-o-property-hadActivity-PASS + RDF + PROV-N + XML +
prov-o-property-hadGeneration-FAIL + RDF + PROV-N + XML +
prov-o-property-hadMember-PASS + RDF + PROV-N + XML +
prov-o-property-hadPlan-PASS + RDF + PROV-N + XML +
prov-o-property-hadPrimarySource-PASS + RDF + PROV-N + XML +
prov-o-property-hadRole-PASS + RDF + PROV-N + XML +
prov-o-property-hadUsage-FAIL + RDF + PROV-N + XML +
prov-o-property-hasAnchor-PASS + RDF + PROV-N + XML +
prov-o-property-influenced-PASS + RDF + PROV-N + XML +
prov-o-property-influencer-PASS + RDF + PROV-N + XML +
prov-o-property-invalidated-PASS + RDF + PROV-N + XML +
prov-o-property-invalidatedAtTime-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedAssociation-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedAttribution-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedCommunication-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedDelegation-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedDerivation-FAIL + RDF + PROV-N + XML +
prov-o-property-qualifiedEnd-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedGeneration-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedInfluence-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedInvalidation-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedPrimarySource-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedQuotation-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedRevision-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedStart-PASS + RDF + PROV-N + XML +
prov-o-property-qualifiedUsage-PASS + RDF + PROV-N + XML +
prov-o-property-removed-PASS + RDF + PROV-N + XML +
prov-o-property-specializationOf-PASS + RDF + PROV-N + XML +
prov-o-property-startedAtTime-PASS + RDF + PROV-N + XML +
prov-o-property-used-PASS + RDF + PROV-N + XML +
prov-o-property-wasAssociatedWith-PASS + RDF + PROV-N + XML +
prov-o-property-wasAttributedTo-PASS + RDF + PROV-N + XML +
prov-o-property-wasDerivedFrom-PASS + RDF + PROV-N + XML +
prov-o-property-wasEndedBy-PASS + RDF + PROV-N + XML +
prov-o-property-wasGeneratedBy-PASS + RDF + PROV-N + XML +
prov-o-property-wasInfluencedBy-PASS + RDF + PROV-N + XML +
prov-o-property-wasInformedBy-PASS + RDF + PROV-N + XML +
prov-o-property-wasInvalidatedBy-PASS + RDF + PROV-N + XML +
prov-o-property-wasQuotedFrom-PASS + RDF + PROV-N + XML +
prov-o-property-wasRevisionOf-PASS + RDF + PROV-N + XML +
prov-o-property-wasStartedBy-PASS + RDF + PROV-N + XML +
+ +
+ +
+ +
+ +

Constraint Coverage

+

Table 5 in this section provides coverage look up for the constraints in [[PROV-CONSTRAINTS]] against the available test cases.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 5. Constraint coverage by unit test cases
IdentifierPass Test CasesFail Test Cases
Constraint 22 (key-object) + unification-activity-s1-PASS-c22
+ unification-activity-s2-PASS-c22
+ unification-activity-s3-PASS-c22
+ unification-activity-s4-PASS-c22
+ unification-attributes-activity-s1-PASS-c22
+ unification-attributes-entity-s1-PASS-c22 +
+ +
Constraint 23 (key-properties) + unification-association-s1-PASS-c23
+ unification-association-s2-PASS-c23
+ unification-association-s3-PASS-c23
+ unification-association-s4-PASS-c23
+ unification-association-s5-PASS-c23
+ unification-attributes-end-s1-PASS-c23
+ unification-attributes-end-s2-PASS-c23
+ unification-attributes-start-s1-PASS-c23
+ unification-attributes-start-s2-PASS-c23
+ unification-attribution-s1-PASS-c23
+ unification-attribution-s2-PASS-c23
+ unification-attribution-s3-PASS-c23
+ unification-attribution-s4-PASS-c23
+ unification-communication-s1-PASS-c23
+ unification-communication-s2-PASS-c23
+ unification-communication-s3-PASS-c23
+ unification-communication-s4-PASS-c23
+ unification-delegation-s1-PASS-c23
+ unification-delegation-s2-PASS-c23
+ unification-delegation-s3-PASS-c23
+ unification-delegation-s4-PASS-c23
+ unification-delegation-s5-PASS-c23
+ unification-derivation-s1-PASS-c23
+ unification-derivation-s2-PASS-c23
+ unification-derivation-s3-PASS-c23
+ unification-derivation-s4-PASS-c23
+ unification-derivation-s5-PASS-c23
+ unification-end-s5-PASS-c23-c27
+ unification-end-s6-PASS-c23-c27
+ unification-generation-s1-PASS-c23
+ unification-generation-s2-PASS-c23
+ unification-generation-s5-PASS-c23
+ unification-generation-s6-PASS-c23
+ unification-generation-s7-PASS-c23-c24
+ unification-generation-s8-PASS-c23-c24
+ unification-influence-s1-PASS-c23
+ unification-invalidation-s1-PASS-c23
+ unification-invalidation-s2-PASS-c23
+ unification-invalidation-s5-PASS-c23
+ unification-invalidation-s6-PASS-c23
+ unification-invalidation-s7-PASS-c23-c25
+ unification-invalidation-s8-PASS-c23-c25
+ unification-start-s5-PASS-c23-c26
+ unification-start-s6-PASS-c23-c26
+ unification-start-s7-PASS-c23-c26
+ unification-start-s8-PASS-c23-c26
+ unification-start-s9-PASS-c23-c26
+ unification-usage-f5-PASS-c23
+ unification-usage-f6-PASS-c23
+ unification-usage-f7-PASS-c23
+ unification-usage-s1-PASS-c23
+ unification-usage-s2-PASS-c23
+ unification-usage-s5-PASS-c23
+ unification-usage-s6-PASS-c23
+ unification-usage-s7-PASS-c23
+ unification-usage-s8-PASS-c23 +
+ unification-association-f1-FAIL-c23
+ unification-association-f2-FAIL-c23
+ unification-association-f3-FAIL-c23
+ unification-association-f4-FAIL-c23
+ unification-association-f5-FAIL-c23
+ unification-delegation-f1-FAIL-c23
+ unification-delegation-f2-FAIL-c23
+ unification-delegation-f3-FAIL-c23
+ unification-derivation-f1-FAIL-c23
+ unification-derivation-f2-FAIL-c23
+ unification-derivation-f3-FAIL-c23
+ unification-derivation-f4-FAIL-c23
+ unification-end-f1-FAIL-c23
+ unification-end-f2-FAIL-c23
+ unification-end-f3-FAIL-c23
+ unification-end-f5-FAIL-c23
+ unification-generation-f2-FAIL-c23
+ unification-generation-f3-FAIL-c23
+ unification-generation-f4-FAIL-c23
+ unification-generation-f5-FAIL-c23
+ unification-generation-f6-FAIL-c23
+ unification-generation-f7-FAIL-c23
+ unification-invalidation-f2-FAIL-c23
+ unification-invalidation-f3-FAIL-c23
+ unification-invalidation-f4-FAIL-c23
+ unification-invalidation-f5-FAIL-c23-c25
+ unification-invalidation-f6-FAIL-c23-c25
+ unification-invalidation-f7-FAIL-c23-c25
+ unification-start-f1-FAIL-c23
+ unification-start-f2-FAIL-c23
+ unification-start-f3-FAIL-c23
+ unification-start-f5-FAIL-c23
+ unification-start-f6-FAIL-c23
+ unification-start-f7-FAIL-c23
+ unification-start-f8-FAIL-c23
+ unification-usage-f2-FAIL-c23
+ unification-usage-f3-FAIL-c23
+ unification-usage-f4-FAIL-c23 +
Constraint 24 (unique-generation) + unification-generation-s3-PASS-c24
+ unification-generation-s7-PASS-c23-c24
+ unification-generation-s8-PASS-c23-c24 +
+ unification-generation-f1-FAIL-c24 +
Constraint 25 (unique-invalidation) + unification-invalidation-s3-PASS-c25
+ unification-invalidation-s7-PASS-c23-c25
+ unification-invalidation-s8-PASS-c23-c25 +
+ unification-invalidation-f1-FAIL-c25
+ unification-invalidation-f5-FAIL-c23-c25
+ unification-invalidation-f6-FAIL-c23-c25
+ unification-invalidation-f7-FAIL-c23-c25 +
Constraint 26 (unique-wasStartedBy) + unification-start-s1-PASS-c26
+ unification-start-s2-PASS-c26
+ unification-start-s3-PASS-c26
+ unification-start-s4-PASS-c26
+ unification-start-s5-PASS-c23-c26
+ unification-start-s6-PASS-c23-c26
+ unification-start-s7-PASS-c23-c26
+ unification-start-s8-PASS-c23-c26
+ unification-start-s9-PASS-c23-c26 +
+ unification-start-f4-FAIL-c26 +
Constraint 27 (unique-wasEndedBy) + unification-end-s1-PASS-c27
+ unification-end-s2-PASS-c27
+ unification-end-s3-PASS-c27
+ unification-end-s4-PASS-c27
+ unification-end-s5-PASS-c23-c27
+ unification-end-s6-PASS-c23-c27 +
+ unification-end-f4-FAIL-c27 +
Constraint 28 (unique-startTime) + unification-activity-start-s1-PASS-c28 + + unification-activity-start-f1-FAIL-c28 +
Constraint 29 (unique-endTime) + unification-activity-end-s1-PASS-c29 + + unification-activity-end-f1-FAIL-c29 +
Constraint 30 (start-precedes-end) + ordering-activity1-PASS-c30 + + +
Constraint 31 (start-start-ordering) + ordering-activity4-PASS-c31 + + +
Constraint 32 (end-end-ordering) + ordering-activity5-PASS-c32 + + +
Constraint 33 (usage-within-activity) + ordering-activity2-PASS-c33 + + +
Constraint 34 (generation-within-activity) + ordering-activity3-PASS-c34 + + +
Constraint 35 (wasInformedBy-ordering) + ordering-communication-PASS-c35 + + +
Constraint 36 (generation-precedes-invalidation) + ordering-entity1-PASS-c36-c37-c38
+ ordering-entity2-PASS-c36 +
+ +
Constraint 37 (generation-precedes-usage) + ordering-entity1-PASS-c36-c37-c38 + + +
Constraint 38 (usage-precedes-invalidation) + ordering-entity1-PASS-c36-c37-c38 + + +
Constraint 39 (generation-generation-ordering) + ordering-entity3-PASS-c39 + + +
Constraint 40 (invalidation-invalidation-ordering) + ordering-entity4-PASS-c40 + + +
Constraint 41 (derivation-usage-generation-ordering) + ordering-derivation3-PASS-c41-c42 + + +
Constraint 42 (derivation-generation-generation-ordering) + ordering-derivation1-PASS-c42
+ ordering-derivation3-PASS-c41-c42
+ ordering-specialization3-PASS-c42-c45 +
+ ordering-derivation2-FAIL-c42
+ ordering-specialization4-FAIL-c42-c45 +
Constraint 43 (wasStartedBy-ordering) + ordering-starts1-PASS-c43 + + +
Constraint 44 (wasEndedBy-ordering) + ordering-ends1-PASS-c44 + + +
Constraint 45 (specialization-generation-ordering) + ordering-specialization1-PASS-c45
+ ordering-specialization3-PASS-c42-c45 +
+ ordering-specialization4-FAIL-c42-c45 +
Constraint 46 (specialization-invalidation-ordering) + ordering-specialization2-PASS-c46 + + +
Constraint 47 (wasAssociatedWith-ordering) + ordering-association1-PASS-c47
+ ordering-association2-PASS-c47 +
+ +
Constraint 48 (wasAttributedTo-ordering) + ordering-attribution1-PASS-c48
+ ordering-attribution2-PASS-c48 +
+ +
Constraint 49 (actedOnBehalfOf-ordering) + ordering-delegation1-PASS-c49
+ ordering-delegation2-PASS-c49 +
+ +
Constraint 50 (typing) + type-s1-PASS-c50-c55
+ type-s2-PASS-c50-c55 +
+ type-f1-FAIL-c50-c55
+ type-f2-FAIL-c50-c55 +
Constraint 51 (impossible-unspecified-derivation-generation-use) + + + prov-o-property-hadGeneration-FAIL-c51-DM
+ prov-o-property-hadUsage-FAIL-c51-DM +
Constraint 52 (impossible-specialization-reflexive) + + + unification-specialization-f3-FAIL-c52
+ unification-specialization-f4-FAIL-c52 +
Constraint 53 (impossible-property-overlap) + + + type-f4-FAIL-c53 +
Constraint 54 (impossible-object-property-overlap) + + + type-f3-FAIL-c54 +
Constraint 55 (entity-activity-disjoint) + type-s1-PASS-c50-c55
+ type-s2-PASS-c50-c55 +
+ type-f1-FAIL-c50-c55
+ type-f2-FAIL-c50-c55
+ unification-bundle-f1-FAIL-c55-c56 +
Constraint 56 (membership-empty-collection) + + + type-collection-FAIL-c56
+ unification-bundle-f1-FAIL-c55-c56 +
Malformed statement(s) + + + unification-association-f6-FAIL-DM
+ unification-attribution-f1-FAIL-DM
+ unification-attribution-f2-FAIL-DM
+ unification-communication-f1-FAIL-DM
+ unification-communication-f2-FAIL-DM
+ unification-delegation-f6-FAIL-DM
+ unification-influence-f1-FAIL-DM
+ unification-influence-f2-FAIL-DM
+ unification-membership-f1-FAIL-DM
+ unification-specialization-f1-FAIL-DM
+ unification-specialization-f2-FAIL-DM
+ prov-o-property-hadGeneration-FAIL-c51-DM
+ prov-o-property-hadUsage-FAIL-c51-DM +
+ +
+ + + + + diff --git a/app/specs/standards/texts/5c22358902f6811ae943937a786250dcb1f57b90698966c924d219f2438d7b35 b/app/specs/standards/texts/5c22358902f6811ae943937a786250dcb1f57b90698966c924d219f2438d7b35 new file mode 100644 index 00000000..d3224581 --- /dev/null +++ b/app/specs/standards/texts/5c22358902f6811ae943937a786250dcb1f57b90698966c924d219f2438d7b35 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/5cd9187cc95f96857990a11e2305ecbb1395277adfb68921aab05822f7c7a6ae b/app/specs/standards/texts/5cd9187cc95f96857990a11e2305ecbb1395277adfb68921aab05822f7c7a6ae new file mode 100644 index 00000000..b2a76005 --- /dev/null +++ b/app/specs/standards/texts/5cd9187cc95f96857990a11e2305ecbb1395277adfb68921aab05822f7c7a6ae @@ -0,0 +1,5 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,-) +endDocument diff --git a/app/specs/standards/texts/5e487fbeea147d0f86de7079bce5a2ca249049470deb0ff696b562e6326112d8 b/app/specs/standards/texts/5e487fbeea147d0f86de7079bce5a2ca249049470deb0ff696b562e6326112d8 new file mode 100644 index 00000000..c272a71e --- /dev/null +++ b/app/specs/standards/texts/5e487fbeea147d0f86de7079bce5a2ca249049470deb0ff696b562e6326112d8 @@ -0,0 +1,9 @@ +document + +prefix ex + +entity(ex:e1) +entity(ex:e2,[prov:type='prov:EmptyCollection']) +hadMember(ex:e2,ex:e1) + +endDocument diff --git a/app/specs/standards/texts/5ea5f005160cda1bf90b729109a4ac1f81c6c5b708dc98a9d41dafc36176a708 b/app/specs/standards/texts/5ea5f005160cda1bf90b729109a4ac1f81c6c5b708dc98a9d41dafc36176a708 new file mode 100644 index 00000000..581569f5 --- /dev/null +++ b/app/specs/standards/texts/5ea5f005160cda1bf90b729109a4ac1f81c6c5b708dc98a9d41dafc36176a708 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/628b999e213c9a2620f7c327f7d6347d8d7242953d00612653755685af42665b b/app/specs/standards/texts/628b999e213c9a2620f7c327f7d6347d8d7242953d00612653755685af42665b new file mode 100644 index 00000000..e1f5d12c --- /dev/null +++ b/app/specs/standards/texts/628b999e213c9a2620f7c327f7d6347d8d7242953d00612653755685af42665b @@ -0,0 +1,10 @@ +document + +prefix ex + +entity(ex:e1) +entity(ex:e2) + +specializationOf(-, ex:e1) + +endDocument diff --git a/app/specs/standards/texts/65309533dce5dc8644df38fef08c2dcb144c87661db3e0f83ffb1fd55176afba b/app/specs/standards/texts/65309533dce5dc8644df38fef08c2dcb144c87661db3e0f83ffb1fd55176afba new file mode 100644 index 00000000..1be0a0f8 --- /dev/null +++ b/app/specs/standards/texts/65309533dce5dc8644df38fef08c2dcb144c87661db3e0f83ffb1fd55176afba @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, -) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/6d7a172ff3e3005efa5467304da09a117bfd90544eb23cc0cc263f4cc3e9e80b b/app/specs/standards/texts/6d7a172ff3e3005efa5467304da09a117bfd90544eb23cc0cc263f4cc3e9e80b new file mode 100644 index 00000000..8bba9242 --- /dev/null +++ b/app/specs/standards/texts/6d7a172ff3e3005efa5467304da09a117bfd90544eb23cc0cc263f4cc3e9e80b @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:ag2,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/6dc05db5c3c94f16663d78d9bb973c3bfabe15cc8413ef6deda5db2606dd9f93 b/app/specs/standards/texts/6dc05db5c3c94f16663d78d9bb973c3bfabe15cc8413ef6deda5db2606dd9f93 new file mode 100644 index 00000000..e8583d7d --- /dev/null +++ b/app/specs/standards/texts/6dc05db5c3c94f16663d78d9bb973c3bfabe15cc8413ef6deda5db2606dd9f93 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/6dcc1d4c48a8439c30852ac4de0a09004b22cb46daa193fff861b9b559fe95cf b/app/specs/standards/texts/6dcc1d4c48a8439c30852ac4de0a09004b22cb46daa193fff861b9b559fe95cf new file mode 100644 index 00000000..cb8bc2d5 --- /dev/null +++ b/app/specs/standards/texts/6dcc1d4c48a8439c30852ac4de0a09004b22cb46daa193fff861b9b559fe95cf @@ -0,0 +1,10 @@ +document +prefix ex +entity(ex:ag1) +agent(ex:ag1) +entity(ex:ag2) +agent(ex:ag2) +actedOnBehalfOf(ex:del;ex:ag2,ex:ag1,-) +wasGeneratedBy(ex:gen1;ex:ag1,-,-) +wasInvalidatedBy(ex:inv2;ex:ag2,-,-) +endDocument diff --git a/app/specs/standards/texts/6e779e38f102b7b67c3a0005a4454dd644ff1a29552ff4845520014ce5d0bd46 b/app/specs/standards/texts/6e779e38f102b7b67c3a0005a4454dd644ff1a29552ff4845520014ce5d0bd46 new file mode 100644 index 00000000..aaf4e696 --- /dev/null +++ b/app/specs/standards/texts/6e779e38f102b7b67c3a0005a4454dd644ff1a29552ff4845520014ce5d0bd46 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,2012-11-16T16:05:00) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/70e0cd4aee38b8025986e97c8b2a2086386d5653e50fa99acf8ad151245c58b9 b/app/specs/standards/texts/70e0cd4aee38b8025986e97c8b2a2086386d5653e50fa99acf8ad151245c58b9 new file mode 100644 index 00000000..55d3932d --- /dev/null +++ b/app/specs/standards/texts/70e0cd4aee38b8025986e97c8b2a2086386d5653e50fa99acf8ad151245c58b9 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00) +wasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/713b52bfe482226f919b14e976a563ab6499e58e84b104c914d79cb191919fab b/app/specs/standards/texts/713b52bfe482226f919b14e976a563ab6499e58e84b104c914d79cb191919fab new file mode 100644 index 00000000..2b0cb3c5 --- /dev/null +++ b/app/specs/standards/texts/713b52bfe482226f919b14e976a563ab6499e58e84b104c914d79cb191919fab @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,2012-11-16T16:05:00) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/714ac0371bf32afb9b729a36f49c05a4ca8d04a6c35f92cb505eab71164c60ef b/app/specs/standards/texts/714ac0371bf32afb9b729a36f49c05a4ca8d04a6c35f92cb505eab71164c60ef new file mode 100644 index 00000000..6d73b735 --- /dev/null +++ b/app/specs/standards/texts/714ac0371bf32afb9b729a36f49c05a4ca8d04a6c35f92cb505eab71164c60ef @@ -0,0 +1,9 @@ +document + default + prefix ex + + activity(def:illustrationActivity,2012-04-03T00:00:00Z,2012-04-03T00:00:25Z) + entity(def:bar_chart,[prov:type='ex:Chart']) + wasDerivedFrom(def:bar_chart, def:aggregatedByRegions, -, def:illustration, -) + wasGeneratedBy(def:illustration;-,def:illustrationActivity,2012-04-03T00:00:11Z,[prov:type='prov:InstantaneousEvent']) +endDocument diff --git a/app/specs/standards/texts/7375154366f35db1cb2dc705f2bfcc0977725ddd1c20a8b19841cb2a90884788 b/app/specs/standards/texts/7375154366f35db1cb2dc705f2bfcc0977725ddd1c20a8b19841cb2a90884788 new file mode 100644 index 00000000..bd76aac1 --- /dev/null +++ b/app/specs/standards/texts/7375154366f35db1cb2dc705f2bfcc0977725ddd1c20a8b19841cb2a90884788 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:a1,-,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/76382982f3d11b0fa78edd193ec5b5f10926dd39e53b5e05885b201bedd8b3f7 b/app/specs/standards/texts/76382982f3d11b0fa78edd193ec5b5f10926dd39e53b5e05885b201bedd8b3f7 new file mode 100644 index 00000000..e1bcf23a --- /dev/null +++ b/app/specs/standards/texts/76382982f3d11b0fa78edd193ec5b5f10926dd39e53b5e05885b201bedd8b3f7 @@ -0,0 +1,7 @@ +document + + prefix ex + + wasInfluencedBy(ex:infl1;ex:x1, ex:x2) + wasInfluencedBy(ex:infl1;ex:x1, ex:x2) +endDocument diff --git a/app/specs/standards/texts/7767ea6bacaee9ae4f638650d46ed28a63b63796a4382255b6a6800422dc3cd9 b/app/specs/standards/texts/7767ea6bacaee9ae4f638650d46ed28a63b63796a4382255b6a6800422dc3cd9 new file mode 100644 index 00000000..6133ca51 --- /dev/null +++ b/app/specs/standards/texts/7767ea6bacaee9ae4f638650d46ed28a63b63796a4382255b6a6800422dc3cd9 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1-other,-) +endDocument diff --git a/app/specs/standards/texts/77a1708e792eae8392d2f15e8b9bc06c1709f80806c84765073b27b0c76fa13c b/app/specs/standards/texts/77a1708e792eae8392d2f15e8b9bc06c1709f80806c84765073b27b0c76fa13c new file mode 100644 index 00000000..ea89f174 --- /dev/null +++ b/app/specs/standards/texts/77a1708e792eae8392d2f15e8b9bc06c1709f80806c84765073b27b0c76fa13c @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/786fca9c9a2d6ab9199dd2ab8351cd64106350de9fd67d6e8ad449f1fe9f6b17 b/app/specs/standards/texts/786fca9c9a2d6ab9199dd2ab8351cd64106350de9fd67d6e8ad449f1fe9f6b17 new file mode 100644 index 00000000..6d6b7a5a --- /dev/null +++ b/app/specs/standards/texts/786fca9c9a2d6ab9199dd2ab8351cd64106350de9fd67d6e8ad449f1fe9f6b17 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,-,ex:e1) +endDocument diff --git a/app/specs/standards/texts/7a9ace2b6ffced439e843d204f5c2b0e74648d76dab120d0ec66ebef41987465 b/app/specs/standards/texts/7a9ace2b6ffced439e843d204f5c2b0e74648d76dab120d0ec66ebef41987465 new file mode 100644 index 00000000..c5de2147 --- /dev/null +++ b/app/specs/standards/texts/7a9ace2b6ffced439e843d204f5c2b0e74648d76dab120d0ec66ebef41987465 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +endDocument diff --git a/app/specs/standards/texts/7b5744ef3e0ccb44a354897e3af426f8107b3b59bd8527c9c3d6e765a27dde17 b/app/specs/standards/texts/7b5744ef3e0ccb44a354897e3af426f8107b3b59bd8527c9c3d6e765a27dde17 new file mode 100644 index 00000000..10024add --- /dev/null +++ b/app/specs/standards/texts/7b5744ef3e0ccb44a354897e3af426f8107b3b59bd8527c9c3d6e765a27dde17 @@ -0,0 +1,6 @@ +document + prefix ex + + activity(ex:a1,-,-) + activity(ex:a1,-,-) +endDocument diff --git a/app/specs/standards/texts/7d65b2d3ce0031b21df15d523d8b9289d0738b7cb94383c19b1e2bf978c012be b/app/specs/standards/texts/7d65b2d3ce0031b21df15d523d8b9289d0738b7cb94383c19b1e2bf978c012be new file mode 100644 index 00000000..d9f27af7 --- /dev/null +++ b/app/specs/standards/texts/7d65b2d3ce0031b21df15d523d8b9289d0738b7cb94383c19b1e2bf978c012be @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a1,-,-) +entity(ex:e1) +entity(ex:e2) +wasEndedBy(ex:end1;ex:a1,ex:e1,-,-) +wasEndedBy(ex:end2;ex:a1,ex:e2,-,-) +endDocument diff --git a/app/specs/standards/texts/7eb7d52d901ad4e8560b3ecbc69148dfd9b9d7589ed4e7db25a0cf66668e841b b/app/specs/standards/texts/7eb7d52d901ad4e8560b3ecbc69148dfd9b9d7589ed4e7db25a0cf66668e841b new file mode 100644 index 00000000..ddf4ed63 --- /dev/null +++ b/app/specs/standards/texts/7eb7d52d901ad4e8560b3ecbc69148dfd9b9d7589ed4e7db25a0cf66668e841b @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:del1;ex:ag2-other,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/803f2ff7a266e8ed00967a412d9586c919a8f4cb9b7691877c8f47488a36783b b/app/specs/standards/texts/803f2ff7a266e8ed00967a412d9586c919a8f4cb9b7691877c8f47488a36783b new file mode 100644 index 00000000..8dabd6bc --- /dev/null +++ b/app/specs/standards/texts/803f2ff7a266e8ed00967a412d9586c919a8f4cb9b7691877c8f47488a36783b @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1-other;ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/81079667ac7711ed39b5931d152bda1c80637fc1b2f096a5d6012c7c393a878a b/app/specs/standards/texts/81079667ac7711ed39b5931d152bda1c80637fc1b2f096a5d6012c7c393a878a new file mode 100644 index 00000000..40ba0626 --- /dev/null +++ b/app/specs/standards/texts/81079667ac7711ed39b5931d152bda1c80637fc1b2f096a5d6012c7c393a878a @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/82f8e413b9411e0d4f07a3a2258bd8b930d066fd7e66b87f521bfca94a37f9fe b/app/specs/standards/texts/82f8e413b9411e0d4f07a3a2258bd8b930d066fd7e66b87f521bfca94a37f9fe new file mode 100644 index 00000000..3efbf4ba --- /dev/null +++ b/app/specs/standards/texts/82f8e413b9411e0d4f07a3a2258bd8b930d066fd7e66b87f521bfca94a37f9fe @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00) +wasEndedBy(ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:end1;ex:a1,-,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/8684b343c888b8de2d72f8d6d0467338dca3b92720d5a255410aff4661bb8c11 b/app/specs/standards/texts/8684b343c888b8de2d72f8d6d0467338dca3b92720d5a255410aff4661bb8c11 new file mode 100644 index 00000000..c2bd62be --- /dev/null +++ b/app/specs/standards/texts/8684b343c888b8de2d72f8d6d0467338dca3b92720d5a255410aff4661bb8c11 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,-,-) +endDocument diff --git a/app/specs/standards/texts/8749f19bf5900dac2fd36aec55e10729abefa2448c0e905a7d47ba41d769425e b/app/specs/standards/texts/8749f19bf5900dac2fd36aec55e10729abefa2448c0e905a7d47ba41d769425e new file mode 100644 index 00000000..642300d9 --- /dev/null +++ b/app/specs/standards/texts/8749f19bf5900dac2fd36aec55e10729abefa2448c0e905a7d47ba41d769425e @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1-other,-) +endDocument diff --git a/app/specs/standards/texts/8a94e38c200ca15ef8c8ae08966c952ef7d75e04cd22ef5fab18c0c891407fea b/app/specs/standards/texts/8a94e38c200ca15ef8c8ae08966c952ef7d75e04cd22ef5fab18c0c891407fea new file mode 100644 index 00000000..bb944210 --- /dev/null +++ b/app/specs/standards/texts/8a94e38c200ca15ef8c8ae08966c952ef7d75e04cd22ef5fab18c0c891407fea @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1-other,ex:e1) +endDocument diff --git a/app/specs/standards/texts/8de237f0da8ab091ae0fcf62c6d0d0bdac84a2a821173541b970d3c160bd9766 b/app/specs/standards/texts/8de237f0da8ab091ae0fcf62c6d0d0bdac84a2a821173541b970d3c160bd9766 new file mode 100644 index 00000000..975ddbf6 --- /dev/null +++ b/app/specs/standards/texts/8de237f0da8ab091ae0fcf62c6d0d0bdac84a2a821173541b970d3c160bd9766 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/9039c2f631b61c6a661f0142d312071d0fb851aa592bded117581c77d5982759 b/app/specs/standards/texts/9039c2f631b61c6a661f0142d312071d0fb851aa592bded117581c77d5982759 new file mode 100644 index 00000000..3786e3a6 --- /dev/null +++ b/app/specs/standards/texts/9039c2f631b61c6a661f0142d312071d0fb851aa592bded117581c77d5982759 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/90b2b6ecb858c8dd5e79a90b7f2edb40adf61d56c7ada0853ecb5a7c573a1c8d b/app/specs/standards/texts/90b2b6ecb858c8dd5e79a90b7f2edb40adf61d56c7ada0853ecb5a7c573a1c8d new file mode 100644 index 00000000..c3b4b81e --- /dev/null +++ b/app/specs/standards/texts/90b2b6ecb858c8dd5e79a90b7f2edb40adf61d56c7ada0853ecb5a7c573a1c8d @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -) +endDocument diff --git a/app/specs/standards/texts/90df6a1b2d11ee777add7deff5fecf2e3fda7171ac2e02e3c607fad0e3032522 b/app/specs/standards/texts/90df6a1b2d11ee777add7deff5fecf2e3fda7171ac2e02e3c607fad0e3032522 new file mode 100644 index 00000000..146a107d --- /dev/null +++ b/app/specs/standards/texts/90df6a1b2d11ee777add7deff5fecf2e3fda7171ac2e02e3c607fad0e3032522 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +specializationOf(ex:e2,ex:e1) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +wasDerivedFrom(ex:der1;ex:e1, ex:e2) +endDocument diff --git a/app/specs/standards/texts/93bc3f4ee29074927490d6ac9d05d40733ec72fcdbe7c15e2e2561df9095e0f6 b/app/specs/standards/texts/93bc3f4ee29074927490d6ac9d05d40733ec72fcdbe7c15e2e2561df9095e0f6 new file mode 100644 index 00000000..f2829a00 --- /dev/null +++ b/app/specs/standards/texts/93bc3f4ee29074927490d6ac9d05d40733ec72fcdbe7c15e2e2561df9095e0f6 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;-,ex:ag1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/94845a6fd369fe4a8aada8b5eac8acf58817dd94261585a109d82916b5ae6a58 b/app/specs/standards/texts/94845a6fd369fe4a8aada8b5eac8acf58817dd94261585a109d82916b5ae6a58 new file mode 100644 index 00000000..3fe4dae1 --- /dev/null +++ b/app/specs/standards/texts/94845a6fd369fe4a8aada8b5eac8acf58817dd94261585a109d82916b5ae6a58 @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +used(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/94ac9ec8520a712c40083335106d8548e8c24c8c596afbfa25918b33f673275d b/app/specs/standards/texts/94ac9ec8520a712c40083335106d8548e8c24c8c596afbfa25918b33f673275d new file mode 100644 index 00000000..84f706ff --- /dev/null +++ b/app/specs/standards/texts/94ac9ec8520a712c40083335106d8548e8c24c8c596afbfa25918b33f673275d @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2-other,-) +endDocument diff --git a/app/specs/standards/texts/9531653f4033b180fc2dfc9ce1a667ffa063c70113964f88859eaecb45fa5989 b/app/specs/standards/texts/9531653f4033b180fc2dfc9ce1a667ffa063c70113964f88859eaecb45fa5989 new file mode 100644 index 00000000..6b2940e1 --- /dev/null +++ b/app/specs/standards/texts/9531653f4033b180fc2dfc9ce1a667ffa063c70113964f88859eaecb45fa5989 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1;ex:a1-other,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/9d1722a9fc8dcff0e7f98a5aabe117f70a48f969f7e83f6c1f6755f174ba671d b/app/specs/standards/texts/9d1722a9fc8dcff0e7f98a5aabe117f70a48f969f7e83f6c1f6755f174ba671d new file mode 100644 index 00000000..6cb935e9 --- /dev/null +++ b/app/specs/standards/texts/9d1722a9fc8dcff0e7f98a5aabe117f70a48f969f7e83f6c1f6755f174ba671d @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/9d62962259a9a894590fe4393dc8f83355af51e156331ef1c8363aad17767221 b/app/specs/standards/texts/9d62962259a9a894590fe4393dc8f83355af51e156331ef1c8363aad17767221 new file mode 100644 index 00000000..7be2121e --- /dev/null +++ b/app/specs/standards/texts/9d62962259a9a894590fe4393dc8f83355af51e156331ef1c8363aad17767221 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00,[prov:type='ex:test1']) +wasStartedBy(ex:a1,ex:e1,ex:a2,-,[prov:type="ex:test1" %% xsd:string]) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,-,[prov:type="1" %% xsd:int]) +endDocument diff --git a/app/specs/standards/texts/9df13cfa38ea166249d17938ec799cdef17c7357ebf31d763793057bbaf602be b/app/specs/standards/texts/9df13cfa38ea166249d17938ec799cdef17c7357ebf31d763793057bbaf602be new file mode 100644 index 00000000..e12c1f32 --- /dev/null +++ b/app/specs/standards/texts/9df13cfa38ea166249d17938ec799cdef17c7357ebf31d763793057bbaf602be @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen2;ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/9e7fc76b61875389f73c008c6fadaf762ce2bb2980e482a7319e8950b4fc7ff2 b/app/specs/standards/texts/9e7fc76b61875389f73c008c6fadaf762ce2bb2980e482a7319e8950b4fc7ff2 new file mode 100644 index 00000000..e12ad9c9 --- /dev/null +++ b/app/specs/standards/texts/9e7fc76b61875389f73c008c6fadaf762ce2bb2980e482a7319e8950b4fc7ff2 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,-,-) +endDocument diff --git a/app/specs/standards/texts/9fc4a453d5ac211c1d84124a45cb94f499066af8e35c48ed7388915943a2969d b/app/specs/standards/texts/9fc4a453d5ac211c1d84124a45cb94f499066af8e35c48ed7388915943a2969d new file mode 100644 index 00000000..096d9ff3 --- /dev/null +++ b/app/specs/standards/texts/9fc4a453d5ac211c1d84124a45cb94f499066af8e35c48ed7388915943a2969d @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a1,-,-) +entity(ex:e1) +entity(ex:e2) +wasStartedBy(ex:start1;ex:a1,ex:e1,-,-) +wasStartedBy(ex:start2;ex:a1,ex:e2,-,-) +endDocument diff --git a/app/specs/standards/texts/a01349e1c95b7fd95088d0291e9f8dfba108a05835c33bf37517d152ea5c8a9e b/app/specs/standards/texts/a01349e1c95b7fd95088d0291e9f8dfba108a05835c33bf37517d152ea5c8a9e new file mode 100644 index 00000000..625edda4 --- /dev/null +++ b/app/specs/standards/texts/a01349e1c95b7fd95088d0291e9f8dfba108a05835c33bf37517d152ea5c8a9e @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:start1-other;ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/aab23ed9bcd7907000e1a576653e603ef0f05df561062047eaecb1beb7782bb1 b/app/specs/standards/texts/aab23ed9bcd7907000e1a576653e603ef0f05df561062047eaecb1beb7782bb1 new file mode 100644 index 00000000..70cb151f --- /dev/null +++ b/app/specs/standards/texts/aab23ed9bcd7907000e1a576653e603ef0f05df561062047eaecb1beb7782bb1 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +specializationOf(ex:e2,ex:e1) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/ac27e8e8e07bf8784e9075bd2c19e6726ee1380b2ebe36a706e9cec9a19fd456 b/app/specs/standards/texts/ac27e8e8e07bf8784e9075bd2c19e6726ee1380b2ebe36a706e9cec9a19fd456 new file mode 100644 index 00000000..996fe594 --- /dev/null +++ b/app/specs/standards/texts/ac27e8e8e07bf8784e9075bd2c19e6726ee1380b2ebe36a706e9cec9a19fd456 @@ -0,0 +1,13 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +activity(ex:a3,-,-) +activity(ex:a4,-,-) +wasGeneratedBy(ex:gen2;ex:e2,ex:a3,-) +wasEndedBy(ex:end2;ex:a2,ex:e2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,-,-) +wasInvalidatedBy(ex:inv1;ex:e1,ex:a4,-) +endDocument diff --git a/app/specs/standards/texts/ad8f5edc67a66b28f5e614c1fd1e1c9231e86f18faa36c0b34798477c866d300 b/app/specs/standards/texts/ad8f5edc67a66b28f5e614c1fd1e1c9231e86f18faa36c0b34798477c866d300 new file mode 100644 index 00000000..c2536317 --- /dev/null +++ b/app/specs/standards/texts/ad8f5edc67a66b28f5e614c1fd1e1c9231e86f18faa36c0b34798477c866d300 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, ex:use) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -) +endDocument diff --git a/app/specs/standards/texts/b11949051e4f09caa8343a3947c171a6f9f041a0bdf3fb7298ead2e109b88a9f b/app/specs/standards/texts/b11949051e4f09caa8343a3947c171a6f9f041a0bdf3fb7298ead2e109b88a9f new file mode 100644 index 00000000..5a6ff05e --- /dev/null +++ b/app/specs/standards/texts/b11949051e4f09caa8343a3947c171a6f9f041a0bdf3fb7298ead2e109b88a9f @@ -0,0 +1,5 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,2012-11-16T17:05:00) +endDocument diff --git a/app/specs/standards/texts/b22a88a102952d7781d0fb1f1f85170d7bbd13aa19b8baf520fc47997442fa2e b/app/specs/standards/texts/b22a88a102952d7781d0fb1f1f85170d7bbd13aa19b8baf520fc47997442fa2e new file mode 100644 index 00000000..6460ec8d --- /dev/null +++ b/app/specs/standards/texts/b22a88a102952d7781d0fb1f1f85170d7bbd13aa19b8baf520fc47997442fa2e @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/b2e39720a2c26b3a710057201ea49b9fd7548703fd78ae90b2b802fa61b63e89 b/app/specs/standards/texts/b2e39720a2c26b3a710057201ea49b9fd7548703fd78ae90b2b802fa61b63e89 new file mode 100644 index 00000000..1e09e96d --- /dev/null +++ b/app/specs/standards/texts/b2e39720a2c26b3a710057201ea49b9fd7548703fd78ae90b2b802fa61b63e89 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, -) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/b3a14b852871c4290e5e7b4b6d35be2617b82dafda0b854360ae0c06e17e9333 b/app/specs/standards/texts/b3a14b852871c4290e5e7b4b6d35be2617b82dafda0b854360ae0c06e17e9333 new file mode 100644 index 00000000..d139944d --- /dev/null +++ b/app/specs/standards/texts/b3a14b852871c4290e5e7b4b6d35be2617b82dafda0b854360ae0c06e17e9333 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:e1,ex:a1,2012-11-16T16:05:00) +used(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/b3faf08bc997eeb05307a9bc266bd1749cdc3b664495be048ec5336a11c09b1e b/app/specs/standards/texts/b3faf08bc997eeb05307a9bc266bd1749cdc3b664495be048ec5336a11c09b1e new file mode 100644 index 00000000..f2b81698 --- /dev/null +++ b/app/specs/standards/texts/b3faf08bc997eeb05307a9bc266bd1749cdc3b664495be048ec5336a11c09b1e @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1,ex:a1,2012-11-16T16:05:00) +used(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/b5936a35463d2b14cbb1d5f8c835fd2252d36ecd8a76c8a4ad9ee6b76af18596 b/app/specs/standards/texts/b5936a35463d2b14cbb1d5f8c835fd2252d36ecd8a76c8a4ad9ee6b76af18596 new file mode 100644 index 00000000..c42709a4 --- /dev/null +++ b/app/specs/standards/texts/b5936a35463d2b14cbb1d5f8c835fd2252d36ecd8a76c8a4ad9ee6b76af18596 @@ -0,0 +1,5 @@ +document + prefix ex + + wasInfluencedBy(ex:infl1; ex:x1, -) +endDocument diff --git a/app/specs/standards/texts/b5ac3b13040273dc900b3c8295697e9bbe093b416268e1af06f777cf82e57a5e b/app/specs/standards/texts/b5ac3b13040273dc900b3c8295697e9bbe093b416268e1af06f777cf82e57a5e new file mode 100644 index 00000000..47183ad6 --- /dev/null +++ b/app/specs/standards/texts/b5ac3b13040273dc900b3c8295697e9bbe093b416268e1af06f777cf82e57a5e @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00,[prov:type='ex:test1']) +wasEndedBy(ex:a1,ex:e1,ex:a2,-,[prov:type="ex:test1" %% xsd:string]) +wasEndedBy(ex:end1;ex:a1,-,ex:a2,-,[prov:type="1" %% xsd:int]) +endDocument diff --git a/app/specs/standards/texts/b6eac938535ade57951740df3916c49424dd1950d953c27bac93b89989da0f4c b/app/specs/standards/texts/b6eac938535ade57951740df3916c49424dd1950d953c27bac93b89989da0f4c new file mode 100644 index 00000000..c0c076f0 --- /dev/null +++ b/app/specs/standards/texts/b6eac938535ade57951740df3916c49424dd1950d953c27bac93b89989da0f4c @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,-,-) +endDocument diff --git a/app/specs/standards/texts/b7983b8e207c91af262e6408337ff123073babda46cb06241e7c5b2b4c2e26cc b/app/specs/standards/texts/b7983b8e207c91af262e6408337ff123073babda46cb06241e7c5b2b4c2e26cc new file mode 100644 index 00000000..b5e02ba4 --- /dev/null +++ b/app/specs/standards/texts/b7983b8e207c91af262e6408337ff123073babda46cb06241e7c5b2b4c2e26cc @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,2012-11-16T17:05:00) +wasEndedBy(ex:end1;ex:a1,-,-,2111-11-11T11:11:11) +endDocument diff --git a/app/specs/standards/texts/b820ef751453bb7e4720d36d08f798c7b01f0bf03abda92277932fe2e9b4001f b/app/specs/standards/texts/b820ef751453bb7e4720d36d08f798c7b01f0bf03abda92277932fe2e9b4001f new file mode 100644 index 00000000..26608e35 --- /dev/null +++ b/app/specs/standards/texts/b820ef751453bb7e4720d36d08f798c7b01f0bf03abda92277932fe2e9b4001f @@ -0,0 +1,5 @@ +document +prefix ex +activity(ex:a1,-,2012-11-16T17:05:00) +activity(ex:a1,-,-) +endDocument diff --git a/app/specs/standards/texts/b84583875d331ed8b823bae8166ddda4914739fb9e48f7c4ca2e26dae82e1ebe b/app/specs/standards/texts/b84583875d331ed8b823bae8166ddda4914739fb9e48f7c4ca2e26dae82e1ebe new file mode 100644 index 00000000..d40eb930 --- /dev/null +++ b/app/specs/standards/texts/b84583875d331ed8b823bae8166ddda4914739fb9e48f7c4ca2e26dae82e1ebe @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:a1,ex:a2) +wasInformedBy(ex:inf2;ex:a1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/bce6029c4a0b52a39783bc46c735e99f27eafaa932f0527f44eaeccfe2b8562b b/app/specs/standards/texts/bce6029c4a0b52a39783bc46c735e99f27eafaa932f0527f44eaeccfe2b8562b new file mode 100644 index 00000000..65960db1 --- /dev/null +++ b/app/specs/standards/texts/bce6029c4a0b52a39783bc46c735e99f27eafaa932f0527f44eaeccfe2b8562b @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,2013-11-16T16:05:00) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/bda78db0dd65cd838c381b49bc5a256ddf24d6d96bb120528fd235a44780be8c b/app/specs/standards/texts/bda78db0dd65cd838c381b49bc5a256ddf24d6d96bb120528fd235a44780be8c new file mode 100644 index 00000000..68fce4ff --- /dev/null +++ b/app/specs/standards/texts/bda78db0dd65cd838c381b49bc5a256ddf24d6d96bb120528fd235a44780be8c @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:inf1;ex:a1,ex:a2) +wasInformedBy(ex:inf2;ex:a1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/be5308551f2e46cee2b3d2bcccb30e94c97a18f77a06d97bc032c8714f9b25f4 b/app/specs/standards/texts/be5308551f2e46cee2b3d2bcccb30e94c97a18f77a06d97bc032c8714f9b25f4 new file mode 100644 index 00000000..5bffc49d --- /dev/null +++ b/app/specs/standards/texts/be5308551f2e46cee2b3d2bcccb30e94c97a18f77a06d97bc032c8714f9b25f4 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:end1;ex:a1-other,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/beb4cde4e009efaf3a32f15a2ab98d1e7fab8b264a43fe7c0c819f742a82cea4 b/app/specs/standards/texts/beb4cde4e009efaf3a32f15a2ab98d1e7fab8b264a43fe7c0c819f742a82cea4 new file mode 100644 index 00000000..7b95d118 --- /dev/null +++ b/app/specs/standards/texts/beb4cde4e009efaf3a32f15a2ab98d1e7fab8b264a43fe7c0c819f742a82cea4 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test1']) +wasStartedBy(ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test2']) +endDocument diff --git a/app/specs/standards/texts/bf58bc4d9c54162ac8611ca8f59a28158693318f6386e94f632ec5ee9f347492 b/app/specs/standards/texts/bf58bc4d9c54162ac8611ca8f59a28158693318f6386e94f632ec5ee9f347492 new file mode 100644 index 00000000..a04893a1 --- /dev/null +++ b/app/specs/standards/texts/bf58bc4d9c54162ac8611ca8f59a28158693318f6386e94f632ec5ee9f347492 @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:inf1;ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/bfaafebcb206c3333eb3ebc6de95ec38aec89b20b3bc139892b5cdbedf15d34b b/app/specs/standards/texts/bfaafebcb206c3333eb3ebc6de95ec38aec89b20b3bc139892b5cdbedf15d34b new file mode 100644 index 00000000..9f0b1bab --- /dev/null +++ b/app/specs/standards/texts/bfaafebcb206c3333eb3ebc6de95ec38aec89b20b3bc139892b5cdbedf15d34b @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/c11a4d3ceaad5ef8f0c22eaa1d9e2fe4aabeed3653b1a3e84ff5af2fc6b65399 b/app/specs/standards/texts/c11a4d3ceaad5ef8f0c22eaa1d9e2fe4aabeed3653b1a3e84ff5af2fc6b65399 new file mode 100644 index 00000000..09528f2b --- /dev/null +++ b/app/specs/standards/texts/c11a4d3ceaad5ef8f0c22eaa1d9e2fe4aabeed3653b1a3e84ff5af2fc6b65399 @@ -0,0 +1,13 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +activity(ex:a3,-,-) +activity(ex:a4,-,-) +wasGeneratedBy(ex:gen2;ex:e2,ex:a3,-) +wasStartedBy(ex:start2;ex:a2,ex:e2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,-,-) +wasInvalidatedBy(ex:inv1;ex:e1,ex:a4,-) +endDocument diff --git a/app/specs/standards/texts/c3d5ee966e605dd6e2fc131f1c2fa2af35ea657d9cc238dc365f8c639b93ffd7 b/app/specs/standards/texts/c3d5ee966e605dd6e2fc131f1c2fa2af35ea657d9cc238dc365f8c639b93ffd7 new file mode 100644 index 00000000..b378efe4 --- /dev/null +++ b/app/specs/standards/texts/c3d5ee966e605dd6e2fc131f1c2fa2af35ea657d9cc238dc365f8c639b93ffd7 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1-other;ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/c3d71bf1157efdeb0cd8e09853fe8c326e6638ea50a5d2891d2018d8b5704476 b/app/specs/standards/texts/c3d71bf1157efdeb0cd8e09853fe8c326e6638ea50a5d2891d2018d8b5704476 new file mode 100644 index 00000000..7ec77373 --- /dev/null +++ b/app/specs/standards/texts/c3d71bf1157efdeb0cd8e09853fe8c326e6638ea50a5d2891d2018d8b5704476 @@ -0,0 +1,6 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:del1;ex:e1, -) +endDocument diff --git a/app/specs/standards/texts/c480a25f475331dc624788801fb216ec431179f93d38dced9911a73c30bd4a18 b/app/specs/standards/texts/c480a25f475331dc624788801fb216ec431179f93d38dced9911a73c30bd4a18 new file mode 100644 index 00000000..eb24be56 --- /dev/null +++ b/app/specs/standards/texts/c480a25f475331dc624788801fb216ec431179f93d38dced9911a73c30bd4a18 @@ -0,0 +1,6 @@ +document + prefix ex + + entity(ex:e1, [prov:type='ex:test1', prov:type='prov:Bundle']) + agent(ex:e1, [prov:type='ex:test2', prov:type='prov:SoftwareAgent', prov:type="http://www.w3.org/ns/prov#Person" %% xsd:anyURI, prov:type="http://openprovenance.org/validation/type/Organization" %% xsd:anyURI, prov:type="prov:Activity" %% xsd:string]) +endDocument diff --git a/app/specs/standards/texts/c5fa436c297351fedb361f7424d48fd2ea2fcbbadf1b723ca985005bdb21a7b4 b/app/specs/standards/texts/c5fa436c297351fedb361f7424d48fd2ea2fcbbadf1b723ca985005bdb21a7b4 new file mode 100644 index 00000000..a290fac5 --- /dev/null +++ b/app/specs/standards/texts/c5fa436c297351fedb361f7424d48fd2ea2fcbbadf1b723ca985005bdb21a7b4 @@ -0,0 +1,10 @@ +document + +prefix ex + +entity(ex:e1) +entity(ex:e2) + +hadMember(ex:e2, -) + +endDocument diff --git a/app/specs/standards/texts/c6a34dc06a6446a589ed46f871b81972b003b779469904bd23644fc5cfec052f b/app/specs/standards/texts/c6a34dc06a6446a589ed46f871b81972b003b779469904bd23644fc5cfec052f new file mode 100644 index 00000000..b8120cbb --- /dev/null +++ b/app/specs/standards/texts/c6a34dc06a6446a589ed46f871b81972b003b779469904bd23644fc5cfec052f @@ -0,0 +1,6 @@ +document +prefix ex +activity(ex:a1,2012-11-16T16:05:00,-) +activity(ex:a1,-,2012-11-16T17:05:00) +wasEndedBy(ex:end1;ex:a1,-,-,2012-11-16T17:05:00) +endDocument diff --git a/app/specs/standards/texts/c7320ed45cc643eca0819b0616835529dfb35dc819eaf50deaf209ee1e974e49 b/app/specs/standards/texts/c7320ed45cc643eca0819b0616835529dfb35dc819eaf50deaf209ee1e974e49 new file mode 100644 index 00000000..70cd70b6 --- /dev/null +++ b/app/specs/standards/texts/c7320ed45cc643eca0819b0616835529dfb35dc819eaf50deaf209ee1e974e49 @@ -0,0 +1,3162 @@ + + + +PROV-N: The Provenance Notation + + + + + + + + + + + + + + + + + + + + + + + + + + +
+

+ + W3C + +

+

PROV-N: The Provenance Notation

+ +

W3C Recommendation 30 April 2013

+
+ +
This version:
+
http://www.w3.org/TR/2013/REC-prov-n-20130430/
+
Latest published version:
+
http://www.w3.org/TR/prov-n/
+ + + + +
Implementation report:
+
http://www.w3.org/TR/2013/NOTE-prov-implementations-20130430/
+ + + +
Previous version:
+
http://www.w3.org/TR/2013/PR-prov-n-20130312/ (color-coded diff)
+ + +
Editors:
+
Luc Moreau, University of Southampton
+
Paolo Missier, Newcastle University
+ + +
Contributors:
+
James Cheney, University of Edinburgh
+
Stian Soiland-Reyes, University of Manchester
+ + +
+ +

+ Please refer to the errata for this document, which may include some normative corrections. +

+ + + +

+ The English version of this specification is the only normative version. Non-normative + translations may also be available. +

+ + + + + + +
+
+

Abstract

+ +

+Provenance is information about entities, activities, and people +involved in producing a piece of data or thing, which can be used + to form assessments about its quality, reliability or trustworthiness. +PROV-DM is the conceptual data model that forms a basis for the W3C +provenance (PROV) family of specifications. +PROV-DM distinguishes core structures, forming the essence of provenance information, from +extended structures catering for more specific uses of provenance. +PROV-DM is organized in six components, respectively dealing with: +(1) entities and activities, and the time at which they were created, used, or ended; +(2) derivations of entities from entities; +(3) agents bearing responsibility for entities that were generated and activities that happened; +(4) a notion of bundle, a mechanism to support provenance of provenance; and, +(5) properties to link entities that refer to the same thing; +(6) collections forming a logical structure for its members. +

+

To provide examples of the PROV data model, the PROV notation (PROV-N) is introduced: aimed at human consumption, PROV-N allows serializations of PROV +instances to be created in a compact manner. PROV-N facilitates the +mapping of the PROV data model to concrete syntax, and is used as the basis for a +formal semantics of PROV. The purpose of this document is to define the PROV-N notation. +

+ +

The PROV Document Overview describes the overall state of PROV, and should be read before other PROV documents.

+

Status of This Document

+ + + +

+ This section describes the status of this document at the time of its publication. Other + documents may supersede this document. A list of current W3C publications and the latest revision + of this technical report can be found in the W3C technical reports + index at http://www.w3.org/TR/. +

+ +

PROV Family of Documents

+This document is part of the PROV family of documents, a set of documents defining various aspects that are necessary to achieve the vision of inter-operable +interchange of provenance information in heterogeneous environments such as the Web. These documents are listed below. Please consult the [PROV-OVERVIEW] for a guide to reading these documents. + + +

Endorsed By W3C

+ +

This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. It is a stable document and may be used as reference material or cited from another document. W3C's role in making the Recommendation is to draw attention to the specification and to promote its widespread deployment. This enhances the functionality and interoperability of the Web.

+ +

Please Send Comments

+ +

+ This document was published by the Provenance Working Group as a Recommendation. + + + If you wish to make comments regarding this document, please send them to + public-prov-comments@w3.org + (subscribe, + archives). + + + + + All comments are welcome. + + + +

+ + This document was produced by a group operating under the + 5 February 2004 W3C Patent Policy. + + + + + W3C maintains a public list of any patent disclosures + + made in connection with the deliverables of the group; that page also includes instructions for + disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains + Essential Claim(s) must disclose the + information in accordance with section + 6 of the W3C Patent Policy. + + +

+ + + + +

Table of Contents

+ + + + + + + +
+

1. Introduction

+ +

Provenance is a record that describes the people, +institutions, entities, and activities, involved in producing, +influencing, or delivering a piece of data or a thing in the world. Two +companion specifications respectively define PROV-DM, a data model for +provenance, allowing provenance descriptions to be expressed [PROV-DM] and a set of constraints that provenance descriptions are expected to satisfy [PROV-CONSTRAINTS]. +

+ +
+

1.1 Purpose of this Document and Target Audience

+ +A key goal of PROV is the specification of a machine-processable data model for provenance. However, communicating provenance between humans is also important when teaching, illustrating, formalizing, and discussing provenance-related issues. + + + +With these two requirements in mind, this document introduces PROV-N, the PROV notation, a syntax designed to write instances of the PROV data model according to the following design principles: +
    +
  • Technology independence. PROV-N provides a simple syntax that can be mapped to several technologies. + +
  • Human readability. PROV-N follows a functional syntax style that is meant to be easily human-readable so it can be used in illustrative examples, such as those presented in the PROV documents suite. + +
  • Formality. PROV-N is defined through a formal grammar amenable to be used with parser generators. + +
+ +PROV-N has several known uses: +
    +
  • It is the notation used in the examples found in [PROV-DM], as well as in the definition of PROV constraints [PROV-CONSTRAINTS];
  • +
  • It is a source language for the encoding of PROV data model instances into a variety of target languages, including amongst others RDF [PROV-RDF] and XML [PROV-XML];
  • +
  • It provides the basis for a formal semantics of the PROV data model [PROV-SEM], in which an interpretation is given to each element of the PROV-N language. +
+ +

This document introduces the PROV-N grammar along with examples of its usage.

+

Its target audience is twofold: +

    +
  • Developers of provenance management applications, as well as implementors of new PROV data model encodings, and thus in particular of PROV-N parsers. These readers may be interested in the entire structure of the grammar, starting from the top level nonterminal +document.
  • +
  • Readers of the [PROV-DM] and of [PROV-CONSTRAINTS] documents, who are interested in the details of the formal language underpinning the notation used in the examples and in the definition of the constraints. Those readers may find the expression nonterminal a useful entry point into the grammar.
  • +
+ +
+ +
+

1.2 Compliance with this Document

+ + +

For the purpose of compliance, all sections of this document are normative, except +Appendix A, +Appendix B, and +Appendix C.2. +

    +
  • Information in tables is normative.
  • +
  • Text in boxes labeled "Example" is informative. +
  • Productions (displayed in boxes) are normative, as opposed to the separate file grouping all productions for convenience of programmers, which is informative. +
+
+ + +
+

1.3 Structure of this Document

+ +

This document is structured as follows. + +

Section 2 provides general consideration about the PROV-N grammar.

+ +

Section 3 presents the grammar of all expressions of the language grouped according to the PROV data model components.

+ +

Section 4 defines the grammar of document, a house-keeping construct of PROV-N capable of packaging up PROV-N expressions and namespace declarations.

+ +

Section 5 defines the extensibility mechanism for the PROV-N notation.

+ +

Section 6 defines media type for the PROV-N notation.

+ + +
+ + +
+

1.4 Notational Conventions

+ + +

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL + NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and + "OPTIONAL" in this document are to be interpreted as described in + [RFC2119].

+ + + + +

+The following namespaces prefixes are used throughout this document. + +

+ + + + + + +
Table 1: Prefix and Namespaces used in this specification
prefixnamespace uri definition
provhttp://www.w3.org/ns/prov#The PROV namespace (see Section 3.7.4)
xsdhttp://www.w3.org/2000/10/XMLSchema#XML Schema Namespace [XMLSCHEMA11-2]
(others)(various)All other namespace prefixes are used in examples only.
In particular, URIs starting with "http://example.com" represent
some application-dependent URI [RFC3986]
+
+ +
+ +
+ +
+

2. General grammar considerations

+ +

For convenience, all productions presented in this document have been grouped in a +separate file.

+ +
+

2.1 Functional-style Syntax

+ +

PROV-N adopts a functional-style syntax consisting of a predicate name and an ordered list of terms.

+ +

+All PROV data model types have an identifier. Furthermore, some expressions also admit additional elements that further characterize it.

+
+

The following expression should be read as "entity e1". +

entity(e1)
+
+
+
+

The following expression should be read as "activity a2, which occurred +between 2011-11-16T16:00:00 and 2011-11-16T16:00:01". +

entity(e1)
+activity(a2, 2011-11-16T16:00:00, 2011-11-16T16:00:01)
+
+
+ +

+All PROV data model relations involve two primary elements, the subject and the object, in this order. Furthermore, some expressions also admit additional elements that further characterize it. +

+

The following expression should be read as "e2 was derived from e1". Here e2 is the subject, and e1 is the object. +

wasDerivedFrom(e2, e1)
+
+
+ +
+

The following expression expands the above derivation relation by providing +additional elements the optional activity a, the generation g2, and the usage u1: +

wasDerivedFrom(e2, e1, a, g2, u1)
+
+
+ +
+ +
+

2.2 EBNF Grammar

+ +

The grammar is specified using a subset of the Extended Backus-Naur +Form (EBNF) notation, as defined in Extensible Markup Language (XML) 1.1 +[XML11] section 6 +Notation. +

+ +

+The text below provides an introduction to the EBNF notation used in +this document.

+ + +

+ EBNF specifies a series of production rules (production). +A production rule in the grammar defines a symbol + expr (nonterminal symbol) + using the following form:

+ + +
+ expr  ::= term +
+

Symbols are written with an initial capital letter if they are the start symbol of a regular language, otherwise with an initial lowercase letter. +A production rule in the grammar defines a symbol + <TERMINAL> (terminal symbol) + using the following form:

+
+ <TERMINAL>  ::= term +
+ + + + + +

Within the term on the right-hand side of a rule, the following +terms are used to match strings of one or more characters: +

    +
  • + expr: matches production for nonterminal symbol expr +
  • + + +
  • + TERMINAL: matches production for terminal symbol TERMINAL +
  • + +
  • + "abc": matches the literal string inside the single quotes. +
  • + + +
  • + (term)?: optional, matches term or nothing. +
  • + +
  • + (term)+: matches one or more occurrences of term. +
  • + +
  • + (term)*: matches zero or more occurrences of term. +
  • + +
  • + (term | term): matches one of the two terms. +
  • + +
+ + +

Where suitable, the PROV-N grammar reuses production and terminal names of the SPARQL grammar [RDF-SPARQL-QUERY].

+ +
+ +
+

2.3 Main Productions

+ +

Two productions are entry points to the grammar.

+ +

The production expression +provides the structure for the core expressions of PROV-N. + + + + +

+ +
[2]    expression    ::=    ( entityExpression | activityExpression | generationExpression | usageExpression | startExpression | endExpression | invalidationExpression | communicationExpression | agentExpression | associationExpression | attributionExpression | delegationExpression | derivationExpression | influenceExpression | alternateExpression | specializationExpression | membershipExpression | extensibilityExpression )
+ + +

Each of the symbols included in expression above, i.e., entityExpression, activityExpression etc., corresponds to one concept (e.g., Entity, Activity, etc.) of the PROV data model.

+ + +

Alternatively, the production rule document +provides the overall structure of PROV-N descriptions. It is a wrapper for + a set of expressions, such that the text for an element matches the corresponding expression production, and some namespace declarations.

+ +
+ + +
+

2.4 Optional terms in expressions

+ +Some terms in an expression may be optional. For example: + +
+
wasDerivedFrom(e2, e1, a, g2, u1)
+wasDerivedFrom(e2, e1)
+
+In a derivation expression, the activity, generation, and usage are optional terms. They are specified in the first derivation, but not in the second. +
+ +
+
activity(a2, 2011-11-16T16:00:00, 2011-11-16T16:00:01)
+activity(a1)
+
+The start and end times for an activity are optional. They are specified in the first expression, but not in the second. +
+ +

The general rule for optionals is that, if none of the optionals are used in the expression, then they are simply omitted, resulting in a simpler expression as in the examples above.

+However, it may be the case that only some of the optional terms are omitted. Because the position of the terms in the expression matters, an additional marker must be used to indicate that a particular term is not available. The symbol '-' is used for this purpose. + +
+

In the first expression below, all optionals are specified. However in the second and third, only one optional is specified, forcing the use of the marker for the missing terms. + +

wasDerivedFrom(e2, e1, a, g2, u1)
+wasDerivedFrom(e2, e1, -, -, u1)
+wasDerivedFrom(e2, e1, a, -, -)
+
+
+Note that the more succinct form is just shorthand for a complete expression with all the markers specified: +
+
activity(a1)
+activity(a1, -, -)
+
+
+ + +
+ +
+

2.5 Identifiers and attributes

+ +

Almost all expressions defined in the grammar include an identifier (see Section 3.7.1 for the full syntax of identifiers). Most expressions +can also include a set of attribute-value pairs, delimited by square brackets. Identifiers are optional except for Entities, Activities, and Agents. Identifiers are always the first term in any expression. Optional identifiers MUST be separated using a semi-colon ';', but where the identifiers are required, a regular comma ',' MUST be used. This makes it possible to completely omit an optional identifier with no ambiguity arising. Also, if the set of attribute-value pairs is present, it is always the last term in any expression.

+ +
+

Derivation has an optional identifier. In the first expression, the identifier is not available, while it is explicit in the second. The third example shows that one can optionally indicate the missing identifier using the - marker. This is equivalent to the first expression.

+
wasDerivedFrom(e2, e1)
+wasDerivedFrom(d; e2, e1)
+wasDerivedFrom(-; e2, e1)
+
+
+ +Lack of attributes can be equivalently expressed by omitting the list, or by using an empty list. + + + +
+

The first and second activity expressions do not specify any attributes, and are equivalent. + +The third activity expression specifies two attributes. +

activity(ex:a1)
+activity(ex:a1, [])
+activity(ex:a1, [ex:param1="a", ex:param2="b"])
+
+
+ +
+ +
+

2.6 Comments

+ + +Comments in PROV-N take two forms: +
    +
  • '//' outside an IRI_REF or STRING_LITERAL; such comments continue to the end of line (marked by characters U+000D or U+000A) or end of file if there is no end of line after the comment marker. + +
  • '/*' ... '*/', outside an IRI_REF or STRING_LITERAL. +
+

Comments are treated as white space.

+ +
+ +
+ +
+

3. PROV-N Productions per Component

+ +

This section introduces grammar productions for each expression, followed by small examples of expressions illustrating the grammar. Strings conforming to the grammar are valid expressions in the PROV-N language.

+ +
+

3.1 Component 1: Entities and Activities

+ +
+

3.1.1 Entity

+ + +

+ +

+ + + + +
[3]    entityExpression    ::=    "entity" "(" identifier optionalAttributeValuePairs ")"
[4]    optionalAttributeValuePairs    ::=    ( "," "[" attributeValuePairs "]" )?
[5]    attributeValuePairs    ::=    ( | attributeValuePair ( "," attributeValuePair )* )
[6]    attributeValuePair    ::=    attribute "=" literal
+ + +

The following table summarizes how each constituent of a PROV-DM Entity maps to a PROV-N syntax element.

+ + + + +
+
entity(tr:WD-prov-dm-20111215, [ prov:type="document" ])
+
+ Here tr:WD-prov-dm-20111215 is the entity identifier, and [ prov:type="document" ] groups the optional attributes, only one in this example, with their values. +

+entity(tr:WD-prov-dm-20111215)
+
+Here, the optional attributes are absent. +
+ + + +
+
+

3.1.2 Activity

+ + + + + + +
[7]    activityExpression    ::=    "activity" "(" identifier ( "," timeOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
[8]    timeOrMarker    ::=    ( time | "-" )
+ +

The following table summarizes how each constituent of a PROV-DM Activity maps to a PROV-N syntax element.

+ + + + +
+
activity(ex:a10, 2011-11-16T16:00:00, 2011-11-16T16:00:01, [prov:type="createFile"])
+
+

Here ex:a10 is the activity identifier, 2011-11-16T16:00:00 and 2011-11-16T16:00:01 are the optional start and end times for the activity, and [prov:type="createFile"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. +
activity(ex:a10)
+activity(ex:a10, -, -)
+activity(ex:a10, -, -, [prov:type="edit"])
+activity(ex:a10, -, 2011-11-16T16:00:00)
+activity(ex:a10, 2011-11-16T16:00:00, -)
+activity(ex:a10, 2011-11-16T16:00:00, -, [prov:type="createFile"])
+activity(ex:a10, [prov:type="edit"])
+
+
+ + +
+
+

3.1.3 Generation

+ + + + + + + + + + + + +
[9]    generationExpression    ::=    "wasGeneratedBy" "(" optionalIdentifier eIdentifier ( "," aIdentifierOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
[10]    optionalIdentifier    ::=    ( identifierOrMarker ";" )?
[11]    identifierOrMarker    ::=    ( identifier | "-" )
+ +

The following table summarizes how each constituent of a PROV-DM Generation maps to a PROV-N syntax element.

+ + + +
+ +
wasGeneratedBy(ex:g1; tr:WD-prov-dm-20111215, ex:edit1, 2011-11-16T16:00:00,  [ex:fct="save"])
+
+

Here ex:g1 is the optional generation identifier, tr:WD-prov-dm-20111215 is the identifier of the entity being generated, + ex:edit1 is the optional identifier of the generating activity, 2011-11-16T16:00:00 is the optional generation time, and [ex:fct="save"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + +
wasGeneratedBy(e2, a1, -)
+wasGeneratedBy(e2, a1, 2011-11-16T16:00:00)
+wasGeneratedBy(e2, a1, -, [ex:fct="save"])     
+wasGeneratedBy(e2, [ex:fct="save"])     
+wasGeneratedBy(ex:g1; e)
+wasGeneratedBy(ex:g1; e, a, tr:WD-prov-dm-20111215)
+
+
+ +

Additional semantic rules (Section 3.7.5) apply to generationExpression.

+ + + + + +
+ +
+

3.1.4 Usage

+ + + + +
[12]    usageExpression    ::=    "used" "(" optionalIdentifier aIdentifier ( "," eIdentifierOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Usage maps to a PROV-N syntax element.

+ + +
+ +
used(ex:u1; ex:act2, ar3:0111, 2011-11-16T16:00:00, [ex:fct="load"])
+ 
+

Here ex:u1 is the optional usage identifier, ex:act2 is the identifier of the using activity, + ar3:0111 is the identifier of the entity being used, + 2011-11-16T16:00:00 is the optional usage time, and [ex:fct="load"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + +
used(ex:act2)
+used(ex:act2, ar3:0111, 2011-11-16T16:00:00)
+used(a1,e1, -, [ex:fct="load"])
+used(ex:u1; ex:act2, ar3:0111, -)
+
+
+ +

Additional semantic rules (Section 3.7.5) apply to usageExpression.

+ + + +
+ +
+

3.1.5 Communication

+ + + + + +
[13]    communicationExpression    ::=    "wasInformedBy" "(" optionalIdentifier aIdentifier "," aIdentifier optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Communication maps to a PROV-N syntax element.

+ + + + +
+
wasInformedBy(ex:inf1; ex:a1, ex:a2, [ex:param1="a", ex:param2="b"])
+
+

Here ex:inf1 is the optional communication identifier, ex:a1 is the identifier of the informed activity, + ex:a2 is the identifier of the informant activity, +and [ex:param1="a", ex:param2="b"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + +
wasInformedBy(ex:a1, ex:a2)
+wasInformedBy(ex:a1, ex:a2, [ex:param1="a", ex:param2="b"])
+wasInformedBy(ex:i; ex:a1, ex:a2)
+wasInformedBy(ex:i; ex:a1, ex:a2, [ex:param1="a", ex:param2="b"])
+
+
+
+ + + +
+

3.1.6 Start

+ + + + +
[14]    startExpression    ::=    "wasStartedBy" "(" optionalIdentifier aIdentifier ( "," eIdentifierOrMarker "," aIdentifierOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
+ +

The following table summarizes how each constituent of a PROV-DM Start maps to a PROV-N syntax element.

+ + + + +
+ +
wasStartedBy(ex:start; ex:act2, ex:trigger, ex:act1, 2011-11-16T16:00:00, [ex:param="a"])
+  
+

Here start is the optional start identifier, ex:act2 is the identifier of the started activity, + ex:trigger is the optional identifier for the entity that triggered the activity start, + ex:act1 is the optional identifier for the activity that generated the (possibly unspecified) entity ex:trigger, + 2011-11-16T16:00:00 is the optional start time, and [ex:param="a"] is a list of optional attributes.

+ The remaining examples show cases where some of the optionals are omitted. + +
wasStartedBy(ex:act2, -, ex:act1, -)
+wasStartedBy(ex:act2, -, ex:act1, 2011-11-16T16:00:00)
+wasStartedBy(ex:act2, -, -, 2011-11-16T16:00:00)
+wasStartedBy(ex:act2, [ex:param="a"])
+wasStartedBy(ex:start; ex:act2, e, ex:act1, 2011-11-16T16:00:00)
+
+
+ + +

Additional semantic rules (Section 3.7.5) apply to startExpression.

+ + +
+ +
+

3.1.7 End

+ + + +
[15]    endExpression    ::=    "wasEndedBy" "(" optionalIdentifier aIdentifier ( "," eIdentifierOrMarker "," aIdentifierOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM End maps to a PROV-N syntax element.

+ + + +
+ +
wasEndedBy(ex:end; ex:act2, ex:trigger, ex:act3,  2011-11-16T16:00:00, [ex:param="a"])
+  
+

Here end is the optional end identifier, +ex:act2 is the identifier of the ending activity, + ex:trigger is the identifier of the entity that triggered the activity end, + ex:act3 is the optional identifier for the activity that generated the (possibly unspecified) entity ex:trigger, + 2011-11-16T16:00:00 is the optional usage time, and [ex:param="a"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + + +
wasEndedBy(ex:act2, ex:trigger, -, -)
+wasEndedBy(ex:act2, ex:trigger, -, 2011-11-16T16:00:00)
+wasEndedBy(ex:act2, -, -, 2011-11-16T16:00:00)
+wasEndedBy(ex:act2, -, -, 2011-11-16T16:00:00, [ex:param="a"])
+wasEndedBy(ex:end; ex:act2)
+wasEndedBy(ex:end; ex:act2, ex:trigger, -, 2011-11-16T16:00:00)
+
+
+ + +

Additional semantic rules (Section 3.7.5) apply to endExpression.

+ +
+ + + +
+

3.1.8 Invalidation

+ + + + + + + +
[16]    invalidationExpression    ::=    "wasInvalidatedBy" "(" optionalIdentifier eIdentifier ( "," aIdentifierOrMarker "," timeOrMarker )? optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Invalidation maps to a PROV-N syntax element.

+ + +
+ +
wasInvalidatedBy(ex:inv; tr:WD-prov-dm-20111215, ex:edit1, 2011-11-16T16:00:00,  [ex:fct="save"])
+
+

Here ex:inv is the optional invalidation identifier, tr:WD-prov-dm-20111215 is the identifier of the entity being invalidated, + ex:edit1 is the optional identifier of the invalidating activity, 2011-11-16T16:00:00 is the optional invalidation time, and [ex:fct="save"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + +
wasInvalidatedBy(tr:WD-prov-dm-20111215, ex:edit1, -)
+wasInvalidatedBy(tr:WD-prov-dm-20111215, ex:edit1, 2011-11-16T16:00:00)
+wasInvalidatedBy(e2, a1, -, [ex:fct="save"])     
+wasInvalidatedBy(e2, -, -, [ex:fct="save"])     
+wasInvalidatedBy(ex:inv; tr:WD-prov-dm-20111215, ex:edit1, -)
+wasInvalidatedBy(tr:WD-prov-dm-20111215, ex:edit1, -)
+
+
+ + +

Additional semantic rules (Section 3.7.5) apply to invalidationExpression.

+ + +
+ + + + +
+ +
+

3.2 Component 2: Derivations

+
+

3.2.1 Derivation

+ + + +
[17]    derivationExpression    ::=    "wasDerivedFrom" "(" optionalIdentifier eIdentifier "," eIdentifier ( "," aIdentifierOrMarker "," gIdentifierOrMarker "," uIdentifierOrMarker )? optionalAttributeValuePairs ")"
+ +

The following table summarizes how each constituent of a PROV-DM Derivation maps to a PROV-N syntax element.

+ + + + + + +
+
wasDerivedFrom(ex:d; e2, e1, a, g2, u1, [ex:comment="a righteous derivation"])
+  
+

Here + d is the optional derivation identifier, + e2 is the identifier for the entity being derived, + e1 is the identifier of the entity from which e2 is derived, + a is the optional identifier of the activity which used/generated the entities, + g2 is the optional identifier of the generation, + u1 is the optional identifier of the usage, + and [ex:comment="a righteous derivation"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + + +
wasDerivedFrom(e2, e1)
+wasDerivedFrom(e2, e1, a, g2, u1)
+wasDerivedFrom(e2, e1, -, g2, u1)
+wasDerivedFrom(e2, e1, a, -, u1)
+wasDerivedFrom(e2, e1, a, g2, -)
+wasDerivedFrom(e2, e1, a, -, -)
+wasDerivedFrom(e2, e1, -, -, u1)
+wasDerivedFrom(e2, e1, -, -, -)
+wasDerivedFrom(ex:d; e2, e1, a, g2, u1)
+wasDerivedFrom(-; e2, e1, a, g2, u1)
+
+
+ +
+
+

3.2.2 Revision

+ +

+PROV-N provides no dedicated syntax for Revision. Instead, a Revision MUST be expressed as a +derivationExpression with attribute prov:type='prov:Revision'.

+ + + +
+
wasDerivedFrom(ex:d; e2, e1, a, g2, u1, 
+               [prov:type='prov:Revision', 
+                ex:comment="a righteous derivation"])
+  
+

Here, the derivation from +Example 19 +is extended with a prov:type attribute and value prov:Revision. The expression 'prov:Revision' is convenienceNotation to denote a QUALIFIED_NAME literal (See Section 3.7.3. Literal). +

+ + +
+
+

3.2.3 Quotation

+ +

+PROV-N provides no dedicated syntax for Quotation. Instead, a Quotation MUST be expressed as a +derivationExpression with attribute prov:type='prov:Quotation'.

+ + + + + +
+
wasDerivedFrom(ex:quoteId1; ex:blockQuote,ex:blog, ex:act1, ex:g, ex:u,
+               [ prov:type='prov:Quotation' ]) 
+ 
+ +

Here, the derivation is provided with a prov:type attribute and value prov:Quotation. +

+ + +
+ + +
+

3.2.4 Primary Source

+ + +

+PROV-N provides no dedicated syntax for PrimarySource. Instead, a PrimarySource MUST be expressed as a +derivationExpression with attribute prov:type='prov:Primary-Source'.

+ + +
+
wasDerivedFrom(ex:sourceId1;  ex:e1, ex:e2, ex:act, ex:g, ex:u, 
+               [ prov:type='prov:PrimarySource' ])
+
+

Here, the derivation is provided with a prov:type attribute and value prov:PrimarySource. +

+
+ + +
+ +
+ + +
+

3.3 Component 3: Agents, Responsibility, and Influence

+
+

3.3.1 Agent

+ + + + + + + +
[18]    agentExpression    ::=    "agent" "(" identifier optionalAttributeValuePairs ")"
+ +

The following table summarizes how each constituent of a PROV-DM Agent maps to a PROV-N syntax element.

+ + +

+PROV-N provides no dedicated syntax for Person, Organization, SoftwareAgent. Instead, a Person, an Organization, or a SoftwareAgent MUST be expressed as an +agentExpression with attribute +prov:type='prov:Person', +prov:type='prov:Organization', or +prov:type='prov:SoftwareAgent', respectively.

+ + +
+
agent(ex:ag4, [ prov:type='prov:Person', ex:name="David" ])
+
+

Here ag is the agent identifier, and + [ prov:type='prov:Person', ex:name="David" ] is a list of optional attributes.

+In the next example, the optional attributes are omitted. + +
agent(ex:ag4)
+
+
+ + +
+
+

3.3.2 Attribution

+ + + + + + +
[19]    attributionExpression    ::=    "wasAttributedTo" "(" optionalIdentifier eIdentifier "," agIdentifier optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Attribution maps to a PROV-N syntax element.

+ + + + +
+ +
wasAttributedTo(ex:attr; e, ag, [ex:license='cc:attributionURL' ])
+  
+

Here attr is the optional attribution identifier, e is an entity identifier, + ag is the identifier of the agent to whom the entity is ascribed, +and [ex:license='cc:attributionURL' ] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + +
wasAttributedTo(e, ag)
+wasAttributedTo(e, ag, [ex:license='cc:attributionURL' ])
+
+
+ +
+ + +
+

3.3.3 Association

+ + + + + + +
[20]    associationExpression    ::=    "wasAssociatedWith" "(" optionalIdentifier aIdentifier ( "," agIdentifierOrMarker "," eIdentifierOrMarker )? optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Association maps to a PROV-N syntax element.

+ + + +

+PROV-N provides no dedicated syntax for Plan. Instead, a Plan MUST be expressed as an +entityExpression with attribute prov:type='prov:Plan'.

+ + +
+
wasAssociatedWith(ex:assoc; ex:a1, ex:ag1, ex:e1, [ex:param1="a", ex:param2="b"])
+  
+ +

Here ex:assoc is the optional attribution identifier, + ex:a1 is an activity identifier, + ex:ag1 is the optional identifier of the agent associated to the activity, + ex:e1 is the optional identifier of the plan used by the agent in the context of the activity, + and [ex:param1="a", ex:param2="b"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + + + +
wasAssociatedWith(ex:a1, -, ex:e1)
+wasAssociatedWith(ex:a1, ex:ag1)
+wasAssociatedWith(ex:a1, ex:ag1, ex:e1)
+wasAssociatedWith(ex:a1, ex:ag1, ex:e1, [ex:param1="a", ex:param2="b"])
+wasAssociatedWith(ex:assoc; ex:a1, -, ex:e1)
+
+
+ + +

Additional semantic rules (Section 3.7.5) apply to associationExpression.

+ + +
+

The following expression illustrates a plan. +

  entity(ex:pl1,   [ prov:type='prov:Plan' ])
+
+
+ + + + +
+
+

3.3.4 Delegation

+ + + + + + +
[21]    delegationExpression    ::=    "actedOnBehalfOf" "(" optionalIdentifier agIdentifier "," agIdentifier ( "," aIdentifierOrMarker )? optionalAttributeValuePairs ")"
+ +

The following table summarizes how each constituent of a PROV-DM Delegation maps to a PROV-N syntax element.

+ + + + +
+ +
actedOnBehalfOf(ex:del1; ex:ag2, ex:ag1, ex:a, [prov:type="contract"])
+  
+

Here ex:del1 is the optional delegation identifier, + ex:ag2 is the identifier for the delegate agent, + ex:ag1 is the identifier of the responsible agent, + ex:a is the optional identifier of the activity for which the delegation link holds, + and [prov:type="contract"] is a list of optional attributes.

+The remaining examples show cases where some of the optionals are omitted. + + +
actedOnBehalfOf(ex:ag1, ex:ag2)
+actedOnBehalfOf(ex:ag1, ex:ag2, ex:a)
+actedOnBehalfOf(ex:ag1, ex:ag2, -, [prov:type="delegation"])
+actedOnBehalfOf(ex:ag2, ex:ag3, ex:a, [prov:type="contract"])
+actedOnBehalfOf(ex:del1; ex:ag2, ex:ag3, ex:a, [prov:type="contract"])
+
+
+ + +
+ +
+

3.3.5 Influence

+ + + + +
[22]    influenceExpression    ::=    "wasInfluencedBy" "(" optionalIdentifier eIdentifier "," eIdentifier optionalAttributeValuePairs ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Influence maps to a PROV-N syntax element.

+ + + +
+
wasInfluencedBy(ex:infl1;e2,e1,[ex:param="a"])
+  
+

Here, + ex:infl1 is the optional influence identifier, + ex:e2 is an entity identifier, + ex:e1 is the identifier for an ancestor entity that ex:e2 is influenced by, + and [ex:param="a"] is the optional set of attributes.

+The remaining examples show cases where some of the optionals are omitted. + + +
wasInfluencedBy(ex:e2,ex:e1)
+wasInfluencedBy(ex:e2,ex:e1,[ex:param="a"])
+wasInfluencedBy(ex:infl1; ex:e2,ex:e1)
+
+
+ +
+ +
+ +
+

3.4 Component 4: Bundles

+ +
+

3.4.1 Bundle Constructor

+ + + +
[23]    bundle    ::=    "bundle" identifier (namespaceDeclarations)? (expression)* "endBundle"
+ +

Bundles cannot be nested. It is for this reason that a bundle is not defined as an expression, to prevent the occurrence of a bundle inside another bundle.

+ +

Each identifier occurring in a bundle, including the bundle identifier itself, MUST be interpreted with respect to the namespace declarations of that bundle, or if the identifier's prefix is not declared in the bundle, with respect to the namespace declarations in the document.

+ + +

The following table summarizes how each constituent of a PROV-DM bundle maps to a PROV-N syntax element.

+ + + +
+
bundle ex:author-view
+  prefix ex  <http://example.org/>
+  agent(ex:Paolo,   [ prov:type='prov:Person' ])
+  agent(ex:Simon,   [ prov:type='prov:Person' ])
+  //...
+endBundle
+  
+

Here ex:author-view is the name of the bundle. +

+ + + + +
+ +
+ +
+

3.4.2 Bundle Type

+ +

+When described, a Bundle MUST be expressed as an entityExpression with attribute prov:type='prov:Bundle'.

+ +
+

The bundle of +Example 29 can be referred to as an entity, and its provenance described.

+
  entity(ex:author-view,   [ prov:type='prov:Bundle' ])
+
+
+
+
+ +
+

3.5 Component 5: Alternate Entities

+
+

3.5.1 Alternate

+ + + + + + + +
[24]    alternateExpression    ::=    "alternateOf" "(" eIdentifier "," eIdentifier ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Alternate maps to a PROV-N syntax element.

+
+ + + + + + + + + + +
AlternateNon-Terminal
alternate1eIdentifier
alternate2eIdentifier
+
+ +
+
alternateOf(tr:WD-prov-dm-20111215,ex:alternate-20111215)
+
+ Here tr:WD-prov-dm-20111215 is alternate for ex:alternate-20111215. +
+ + +
+
+

3.5.2 Specialization

+ + + + + + +
[25]    specializationExpression    ::=    "specializationOf" "(" eIdentifier "," eIdentifier ")"
+ +

The following table summarizes how each constituent of a PROV-DM Specialization maps to a PROV-N syntax element.

+ + + +
+
specializationOf(tr:WD-prov-dm-20111215,tr:prov-dm)
+
+ Here tr:WD-prov-dm-20111215 is a specialization of tr:prov-dm. +
+ +
+ + + + + + + +
+ + + +
+

3.6 Component 6: Collections

+ + +
+

3.6.1 Collection

+ + +

+PROV-N provides no dedicated syntax for Collection and EmptyCollection. Instead, a Collection or an EmptyCollection MUST be expressed as an +entityExpression with attribute +prov:type='prov:Collection', or +prov:type='prov:EmptyCollection', respectively.

+ + + +
+

The following two expressions are about a collection and an empty collection, respectively. +

  entity(ex:col1,   [ prov:type='prov:Collection' ])
+  entity(ex:col2,   [ prov:type='prov:EmptyCollection' ])
+
+
+
+ + +
+

3.6.2 Membership

+ + + + + +
[26]    membershipExpression    ::=    "hadMember" "(" cIdentifier "," eIdentifier ")"
+ + +

The following table summarizes how each constituent of a PROV-DM Membership maps to a PROV-N syntax element.

+
+ + + + + + + + +
MembershipNon-Terminal
collectioncIdentifier
entityeIdentifier
+
+ + + + +
+
   hadMember(ex:c, ex:e1)   // ex:c contained ex:e1
+   hadMember(ex:c, ex:e2)   // ex:c contained ex:e2 
+  
+

Here + ex:c is the identifier for the collection whose membership is stated, and + ex:e1 and ex:e2 are the entities that are members of collection ex:c. + + +

+ +
+ +
+ + + + + +
+

3.7 Further Expressions

+ +This section defines further expressions of PROV-N. + + +
+

3.7.1 Identifier

+ +

Various kinds of identifiers are used in productions.

+ + + + + + + + + + + + + + + +
[27]    eIdentifier    ::=    identifier
[28]    aIdentifier    ::=    identifier
[29]    agIdentifier    ::=    identifier
[30]    gIdentifier    ::=    identifier
[31]    uIdentifier    ::=    identifier
[32]    cIdentifier    ::=    identifier
[33]    eIdentifierOrMarker    ::=    ( eIdentifier | "-" )
[34]    aIdentifierOrMarker    ::=    ( aIdentifier | "-" )
[35]    agIdentifierOrMarker    ::=    ( agIdentifier | "-" )
[36]    gIdentifierOrMarker    ::=    ( gIdentifier | "-" )
[37]    uIdentifierOrMarker    ::=    ( uIdentifier | "-" )
[38]    identifier    ::=    QUALIFIED_NAME
+ + +

+A qualified name is a name subject to namespace interpretation. It consists of a namespace, denoted by an optional prefix, and a local name. +The PROV data model stipulates that a qualified name can be mapped to an IRI + by concatenating the IRI associated with the prefix and the local part. This section provides the exact details of this procedure for qualified names defined by PROV-N.

+ +

A qualified name's prefix is OPTIONAL. If a prefix occurs in a + qualified name, the prefix MUST refer to a namespace declared in a namespace declaration. In the absence of prefix, the qualified name + belongs to the default namespace.

+ + + + +

A PROV-N qualified name (production QUALIFIED_NAME) has a more permissive syntax than XML's QName [XML-NAMES] +and SPARQL PrefixedName [RDF-SPARQL-QUERY]. +A QUALIFIED_NAME consists of a prefix and a local part. Prefixes follow the production PN_PREFIX defined by SPARQL [RDF-SPARQL-QUERY]. Local parts have to be conformant with PN_LOCAL, which extends the original SPARQL PN_LOCAL definition +by allowing further characters (see PN_CHARS_OTHERS):

+
    +
  • an extra set of characters commonly encountered in IRIs; +
  • %-escaped characters (see PERCENT) to be interpreted as per + Section 3.1. Mapping of IRIs to URIs in [RFC3987];
  • +
  • and \-escaped characters (see PN_CHARS_ESC).
  • +
+ + + +

Given that +'=' (equal), +''' (single quote), +'(' (left bracket), +')' (right bracket), +',' (comma), +':' (colon), +';' (semi-colon), +'"' (double quote), +'[' (left square bracket), +']' (right square bracket) are used by the PROV notation as delimiters, they are not allowed in local parts. +Instead, among those characters, those that are permitted in SPARQL +IRI_REF are also allowed in PN_LOCAL if they are escaped by the '\' (backslash character) as per production PN_CHARS_ESC. Furthermore, '.' (dot), ':' (colon), '-' (hyphen) can also be \-escaped.

+ + + +

A PROV-N qualified name QUALIFIED_NAME can be mapped to a valid IRI [RFC3987] by concatenating the namespace denoted its local name PN_PREFIX to the local name PN_LOCAL, whose \-escaped characters have been unescaped by dropping the character '\' (backslash).

+ + + + + + + + + + +
[52]    <QUALIFIED_NAME>    ::=    ( PN_PREFIX ":" )? PN_LOCAL
| PN_PREFIX ":"
[53]    <PN_LOCAL>    ::=    ( PN_CHARS_U | [0-9] | PN_CHARS_OTHERS ) ( ( PN_CHARS | "." | PN_CHARS_OTHERS )* ( PN_CHARS | PN_CHARS_OTHERS ) )?
[54]    <PN_CHARS_OTHERS>    ::=    "/"
| "@"
| "~"
| "&"
| "+"
| "*"
| "?"
| "#"
| "$"
| "!"
| PERCENT
| PN_CHARS_ESC
[55]    <PN_CHARS_ESC>    ::=    "\" ( "=" | "'" | "(" | ")" | "," | "-" | ":" | ";" | "[" | "]" | "." )
[56]    <PERCENT>    ::=    "%" HEX HEX
[57]    <HEX>    ::=    [0-9]
| [A-F]
| [a-f]
+ + + +
+

Examples of articles on the BBC Web site seen as entities.

+
document
+  prefix bbc <http://www.bbc.co.uk/>
+  prefix bbcNews <http://www.bbc.co.uk/news/>
+
+  entity(bbc:)                          // bbc site itself
+  entity(bbc:news/)                     // bbc news
+  entity(bbc:news/world-asia-17507976)  // a given news article
+
+  entity(bbcNews:)                      // an alternative way of referring to the bbc news site
+
+endDocument
+
+
+ + +
+

Examples of entities with declared and default namespace.

+
document
+  default <http://example.org/2/>
+  prefix ex <http://example.org/1/>
+
+  entity(ex:a)     //  corresponds to IRI http://example.org/1/a
+  entity(ex:a/)    //  corresponds to IRI http://example.org/1/a/
+  entity(ex:a/b)   //  corresponds to IRI http://example.org/1/a/b
+  entity(b)        //  corresponds to IRI http://example.org/2/b
+  entity(ex:1234)  //  corresponds to IRI http://example.org/1/1234
+  entity(4567)     //  corresponds to IRI http://example.org/2/4567
+  entity(c/)       //  corresponds to IRI http://example.org/2/c/
+  entity(ex:/)     //  corresponds to IRI http://example.org/1//
+endDocument
+
+
+ + +
+

Examples of \-escaped characters.

+
document
+  prefix ex <http://example.org/>
+  default <http://example.org/default>
+
+  entity(ex:foo?a\=1)            // corresponds to IRI http://example.org/foo?a=1
+  entity(ex:\-)                  // corresponds to IRI http://example.org/-
+  entity(ex:?fred\=fish%20soup)  // corresponds to IRI http://example.org/?fred=fish%20soup
+
+  used(-;a1,e1,-)                // identifier not specified for usage  
+  used(\-;a1,e1,-)               // usage identifier corresponds to http://example.org/default-
+endDocument
+
+
+ + +

Note: The productions for the terminals QUALIFIED_NAME and PN_PREFIX are conflicting. +Indeed, for a tokenizer operating independently of the parse tree, abc matches both +QUALIFIED_NAME and +PN_PREFIX. + In the context of a namespaceDeclaration, a tokenizer should give preference to the production PN_PREFIX. +

+ + +
+ +
+

3.7.2 Attribute

+ + + + + +
[39]    attribute    ::=    QUALIFIED_NAME
+ + +

The reserved attributes in the PROV namespace are the following. +Their meaning is explained by [PROV-DM] (see Section 5.7.2: Attribute). +

+ +
    +
  1. prov:label +
  2. prov:location +
  3. prov:role +
  4. prov:type +
  5. prov:value +
+ + +
+ + + + + +
+

3.7.3 Literal

+ + + + + + + + + + + + +
[40]    literal    ::=    typedLiteral
| convenienceNotation
[41]    typedLiteral    ::=    STRING_LITERAL "%%" datatype
[42]    datatype    ::=    QUALIFIED_NAME
[43]    convenienceNotation    ::=    STRING_LITERAL (LANGTAG)?
| INT_LITERAL
| QUALIFIED_NAME_LITERAL
[58]    <STRING_LITERAL>    ::=    STRING_LITERAL2
| STRING_LITERAL_LONG2
[60]    <INT_LITERAL>    ::=    ("-")? (DIGIT)+
[62]    <DIGIT>    ::=    [0-9]
[61]    <QUALIFIED_NAME_LITERAL>    ::=    "'" QUALIFIED_NAME "'"
+ +

In production datatype, the QUALIFIED_NAME is used to denote a PROV data type [PROV-DM]. + + +

The non terminals +STRING_LITERAL, +INT_LITERAL, and +QUALIFIED_NAME_LITERAL +are syntactic sugar for quoted strings with datatype +xsd:string, +xsd:int, and +prov:QUALIFIED_NAME +respectively. +

+ +

In particular, a Literal may be an IRI-typed string (with datatype xsd:anyURI); such IRI has no specific interpretation in the context of PROV.

+ + +

Note: The productions for terminals QUALIFIED_NAME and +INT_LITERAL are conflicting. +Indeed, for a tokenizer operating independently of the parse tree, 1234 matches both INT_LITERAL and QUALIFIED_NAME (local name without prefix). In the context of +a convenienceNotation, a tokenizer should give preference to the production +INT_LITERAL. +

+ +
+

+The following examples illustrate convenience notations.

+ +

The two following expressions are strings; if datatype is not specified, it is xsd:string.

+
  "abc" %% xsd:string
+  "abc"
+
+ + +

The two following expressions are integers. For convenience, numbers, expressed as digits optionally preceded by a minus sign, can occur without quotes.

+
  "1234" %% xsd:integer
+  1234
+  "-1234" %% xsd:integer
+  -1234
+
+ +

The two following expressions are qualified names. Values of type qualified name can be conveniently expressed within single quotes.

+
  "ex:value" %% prov:QUALIFIED_NAME
+  'ex:value'
+
+
+ +
+

+The following examples respectively are the string "abc", the string (in French) "bonjour", the integer number 1, and the IRI "http://example.org/foo".

+
  "abc"
+  "bonjour"@fr
+  "1" %% xsd:integer
+  "http://example.org/foo" %% xsd:anyURI
+
+

The following examples respectively are the floating point number 1.01 and the boolean true.

+
  "1.01" %% xsd:float
+  "true" %% xsd:boolean
+
+
+ + + +
+
3.7.3.1 Reserved Type Values
+ +

The reserved type values in the PROV namespace are the following. +Their meaning is defined [PROV-DM] (see Section 5.7.2.4: prov:type). +

+ +
    +
  1. prov:Bundle +
  2. prov:Collection +
  3. prov:EmptyCollection +
  4. prov:Organization +
  5. prov:Person +
  6. prov:Plan +
  7. prov:PrimarySource +
  8. prov:Quotation +
  9. prov:Revision +
  10. prov:SoftwareAgent +
+ +
+

The agent ag is a person (type: prov:Person), whereas the entity +pl is a plan (type: prov:Plan).

+
agent(ag,  [ prov:type='prov:Person' ])
+entity(pl, [ prov:type='prov:Plan' ])
+
+
+ + +
+ +
+
3.7.3.2 Time Values
+ +

Time instants are defined according to xsd:dateTime [XMLSCHEMA11-2].

+ + + +
[44]    time    ::=    DATETIME
+ + +
+ +

The third argument in the following usage expression is a time instance, namely 4pm on 2011-11-16.

+
used(ex:act2, ar3:0111, 2011-11-16T16:00:00)
+
+
+ + + + +
+ + +
+ + + + + +
+

3.7.4 Namespace Declaration

+ + + + + + + + + +
[45]    namespaceDeclarations    ::=    ( defaultNamespaceDeclaration | namespaceDeclaration ) (namespaceDeclaration)*
[46]    namespaceDeclaration    ::=    "prefix" PN_PREFIX namespace
[47]    defaultNamespaceDeclaration    ::=    "default" IRI_REF
[48]    namespace    ::=    IRI_REF
+ +

A namespaceDeclaration consists of a binding between a prefix and a namespace. Every qualified name with this prefix in the scope of this declaration belongs to this namespace. +A defaultNamespaceDeclaration consists of a namespace. Every qualified name without prefix in the scope of this declaration belongs to this namespace. Scope of a prefix-namespace declaration is specified as follows:

+
    +
  • +The scope of a prefix-namespace declaration directly occurring in a bundle is the bundle itself.
  • +
  • +The scope of a prefix-namespace declaration directly occurring in a document is the document including the bundles it contains but excluding those bundles that re-declare this prefix.
  • +
+ +

A set of namespace declarations namespaceDeclarations MUST NOT re-declare the same prefix.

+ +

A set of namespace declarations namespaceDeclarations occurring in a bundle MAY re-declare a prefix declared in a surrounding document.

+ +

A namespace declaration namespaceDeclaration MUST NOT declare prefixes prov and xsd (see Table 1 for their IRI).

+ + + +
+

The following example declares three namespaces, one default, and two with explicit prefixes ex1 and ex2.

+
document
+  default <http://example.org/0/>
+  prefix ex1 <http://example.org/1/>
+  prefix ex2 <http://example.org/2/>
+...
+endDocument
+
+
+ + +
+

In the following example, a document declares a default namespace and the occurrence of +e001 directly occurring in the document refers to that namespace. +A nested bundle also declares a default namespace, but with a different IRI. +In that bundle, the occurrences of +e001, including the bundle name, refer to the latest default namespace.

+
document
+  default <http://example.org/1/>
+  entity(e001)                             // IRI: http://example.org/1/e001
+
+  bundle e001                              // IRI: http://example.org/2/e001
+    default <http://example.org/2/>
+    entity(e001)                           // IRI: http://example.org/2/e001
+  endBundle
+endDocument
+
+
+ + +
+

In the following example, a document declares a namespace with prefix ex and the occurrence of +ex:e001 directly occurring in the document refers to that namespace. +In a nested bundle, the occurrence of +ex:e001 also refers to the same namespace.

+
document
+  prefix ex <http://example.org/1/>
+  entity(ex:e001)                            // IRI: http://example.org/1/e001
+
+  bundle b
+    entity(ex:001)                           // IRI: http://example.org/1/e001
+  endBundle
+endDocument
+
+
+ + + + +
+ + + + + +
+

3.7.5 Summary of additional semantic rules

+ +

Some of the grammar productions allow for expressions that are syntactically correct, and yet according to [PROV-DM] they are not acceptable, because additional semantic rules are defined for those expressions. + The following table provides a summary of such expressions along with examples of syntactically correct but unacceptable forms, and the additional semantic rules.

+ +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Table 2: Summary of additional semantic rules for grammar productions
ProductionExamples of syntactically correct expressionsAdditional semantic rule
Generation expressionwasGeneratedBy(e2, -, -)
wasGeneratedBy(-; e2, -, -)
At least one of id, activity, time, and attributes MUST be present.
Usage expressionused(a2, -, -)
used(-; a2, -, -)
At least one of id, entity, time, and attributes MUST be present
Start expression wasStartedBy(e2, -, -, -)
wasStartedBy(-; e2, -, -, -)
At least one of id, trigger, starter, time, and attributes MUST be present
End expressionwasEndedBy(e2, -, -, -)
wasEndedBy(-; e2, -, -, -)
At least one of id, trigger, ender, time, and attributes MUST be present
Invalidation expressionwasInvalidatedBy(e2, -, -)
wasInvalidatedBy(-; e2, -, -)
At least one of id, activity, time, and attributes MUST be present
Association expressionwasAssociatedWith(a, -, -)
wasAssociatedWith(-; a, -, -)
At least one of id, agent, plan, and attributes MUST be present
+
+
+ +
+ + +
+ + + + + +
+

4. Document

+ +

A document is a house-keeping construct of PROV-N capable of packaging up PROV-N expressions and namespace declarations. A document forms a self-contained package of provenance descriptions for the purpose of exchanging them. A document may be used + to package up PROV-N expressions in response to a request for the provenance of something ([PROV-AQ]).

+ +

Given its status of house-keeping construct for the purpose of exchanging provenance expressions, a document is not defined as a PROV-N expression (production expression).

+ + + + + +

A document's text matches the document production.

+ + + +
[1]    document    ::=    "document" (namespaceDeclarations)? (expression)* (bundle)* "endDocument"
+ +

A document contains: +

    +
  • namespaceDeclarations: a set of namespace declarations namespaceDeclarations, declaring namespaces and associated prefixes, which can be used in attributes and identifiers occurring inside expressions or bundles;
  • +
  • expressions: a set of expressions, each matching expression;
  • +
  • bundles: a set of expressions, each matching +bundle.
  • +
+ + +

Thus, bundles MAY occur inside a document, but do not appear inside other bundles. +

+ + + +
+

+The following document contains expressions related to the provenance of entity +e2. +

+
document
+  default <http://anotherexample.org/>
+  prefix ex <http://example.org/>
+
+  entity(e2, [ prov:type="File", ex:path="/shared/crime.txt", ex:creator="Alice", 
+               ex:content="There was a lot of crime in London last month."])
+  activity(a1, 2011-11-16T16:05:00, -, [prov:type="edit"])
+  wasGeneratedBy(e2, a1, -, [ex:fct="save"])     
+  wasAssociatedWith(a1, ag2, -, [prov:role="author"])
+  agent(ag2, [ prov:type='prov:Person', ex:name="Bob" ])
+
+endDocument
+
+

This container could, for instance, be returned as the result of a query to a provenance store for the provenance of entity e2 [PROV-AQ]. +

+
+ + + +
+ +
+

5. Extensibility

+ +

The PROV data model is extensible by means of attributes prov:type and prov:role allowing subtyping of expressions. For some applications, novel syntax may also be convenient. Hence, the normative requirements are as follow.

+
    +
  • PROV-N compliant parsers MUST be able to parse expressions matching the extensibilityExpression production defined below. +
  • As PROV provides no definition for these expressions, PROV compliant implementations + MAY ignore these expressions.
  • +
  • Extensions to PROV and PROV-N MAY specify more specific productions and interpretations for these expressions, which applications MAY elect to follow.
  • +
+ + + + + + + + +
[49]    extensibilityExpression    ::=    QUALIFIED_NAME "(" optionalIdentifier extensibilityArgument ( "," extensibilityArgument )* optionalAttributeValuePairs ")"
[50]    extensibilityArgument    ::=    ( identifierOrMarker | literal | time | extensibilityExpression | extensibilityTuple )
[51]    extensibilityTuple    ::=    "{" extensibilityArgument ( "," extensibilityArgument )* "}"
| "(" extensibilityArgument ( "," extensibilityArgument )* ")"
+ +

Expressions compatible with the +extensibilityExpression production follow a general form of functional syntax, in which the predicate MUST be a +qualifiedName +with a non-empty prefix.

+ + + +
+

+Collections are sets of entities, whose membership can be expressed using the hadMember relation. The following example shows how one can express membership for dictionaries, an illustrative extension of Collections consisting of sets of key-entity pairs, where a key is a literal. The notation is a variation of that used for Collections membership, allowing multiple member elements to be declared, and in which the elements are pairs. The name of the relation is qualified with the extension-specific namespace http://example.org/dictionaries. +

+
  prefix dictExt <http://example.org/dictionaries#>
+  dictExt:hadMembers(mId; d, {("k1",e1), ("k2",e2), ("k3",e3)}, []) 
+
+ +Note that the generic extensibilityExpression production above allows for alternative notations to be used for expressing membership, if the designers of the extensions so desire. Here is an alternate syntax that is consistent with the productions: +
  prefix dictExt <http://example.org/dictionaries#>
+  dictExt:hadMembers(mid; d, dictExt:set(dictExt:pair("k1",e1), 
+                                         dictExt:pair("k2",e2), 
+                                         dictExt:pair("k3",e3)), 
+                            [dictExt:uniqueKeys="true"]) 
+
+ + +
+ + + + +
+ + +
+

6. Media Type

+ +

+The media type of PROV-N is text/provenance-notation. The content encoding of PROV-N content is UTF-8. +

+ + +
+
Contact:
+
Ivan Herman
+
See also:
+
How to Register a Media Type for a W3C Specification
+
Internet Media Type registration, consistency of use
TAG Finding 3 June 2002 (Revised 4 September 2002)
+
+

The Internet Media Type / MIME Type for PROV-N is "text/provenance-notation".

+

It is recommended that PROV-N files have the extension ".provn" (all lowercase) on all platforms.

+

It is recommended that PROV-N files stored on Macintosh HFS file systems be given a file type of "TEXT".

+

The information that follows has been registered with IANA.

+
+
Type name:
+
text
+
Subtype name:
+
provenance-notation
+
Required parameters:
+
charset — the value of charset MUST always be UTF-8.
+
Optional parameters:
+
None
+ +
Encoding considerations: 8bit
+
The syntax of PROV-N is expressed over code points in Unicode [UNICODE]. The encoding is always UTF-8 [UTF-8].
+
Unicode code points may also be expressed using an \uXXXX (U+0 to U+FFFF) or \UXXXXXXXX syntax (for U+10000 onwards) where X is a hexadecimal digit [0-9A-F]
+
Security considerations:
+
PROV-N is a general-purpose language for describing the provenance of things; applications may evaluate given data to infer more descriptions or to dereference URIs, invoking the security considerations of the scheme for that URI. Note in particular, the privacy issues in [RFC3023] section 10 for HTTP URIs. Data obtained from an inaccurate or malicious data source may lead to inaccurate or misleading conclusions, as well as the dereferencing of unintended URIs. Care must be taken to align the trust in consulted resources with the sensitivity of the intended use of the data.
+
PROV-N is used to express the provenance of arbitrary application data; security considerations will vary by domain of use. Security tools and protocols applicable to text (e.g. PGP encryption, MD5 sum validation, password-protected compression) may also be used on PROV-N documents. Security/privacy protocols must be imposed which reflect the sensitivity of the embedded information.
+
PROV-N can express data which is presented to the user, for example, by means of label attributes. Application rendering strings retrieved from untrusted PROV-N documents must ensure that malignant strings may not be used to mislead the reader. The security considerations in the media type registration for XML ([RFC3023] section 10) provide additional guidance around the expression of arbitrary data and markup.
+
PROV-N is a language for describing the provenance of things, and therefore a PROV-N document is metadata for other resources. Untrusted PROV-N documents may mislead its consumers by indicating that a third-party resource has a reputable lineage, when it has not. Provenance of PROV-N document should be sought.
+
PROV-N uses qualified names mappable to IRIs as term identifiers. Applications interpreting data expressed in PROV-N should address the security issues of + Internationalized Resource Identifiers (IRIs) [RFC3987] Section 8, as well as + Uniform Resource Identifier (URI): Generic Syntax [RFC3986] Section 7.
+
Multiple IRIs may have the same appearance. Characters in different scripts may +look similar (a Cyrillic "о" may appear similar to a Latin "o"). A character followed +by combining characters may have the same visual representation as another character +(LATIN SMALL LETTER E followed by COMBINING ACUTE ACCENT has the same visual representation +as LATIN SMALL LETTER E WITH ACUTE). + +Any person or application that is writing or interpreting data in PROV-N must take care to use the IRI that matches the intended semantics, and avoid IRIs that make look similar. +Further information about matching of similar characters can be found +in Unicode Security +Considerations [UNISEC] and +Internationalized Resource +Identifiers (IRIs) [RFC3987] Section 8. +
+
PROV-N offers an extensibility mechanism, which in turn may introduce additional security considerations. For example, predicates in extensibility expressions use qualified names, mappable to IRIs, and appropriate security considerations for IRIs apply too.
+ +
Interoperability considerations:
+
There are no known interoperability issues.
+
Published specification:
+
PROV-N: The Provenance Notation, Moreau, Missier, (eds), Cheney, Soiland-Reyes + http://www.w3.org/TR/prov-n/, 2012.
+
Applications which use this media type:
+
It may be used by any application for publishing provenance information. This format is designed to be a human-readable form of provenance.
+
Additional information:
+
Magic number(s):
+
PROV-N documents may have the strings 'document' near the beginning of the document.
+
File extension(s):
+
".provn"
+
Base URI:
+
There are no constructs in the PROV-N Syntax to change the Base IRI.
+
Macintosh file type code(s):
+
"TEXT"
+
Person & email address to contact for further information:
+
Ivan Herman, ivan@w3.org
+
Intended usage:
+
COMMON
+
Restrictions on usage:
+
None
+
Author/Change controller:
+
The PROV-N specification is the product of the World Wide Web Consortium's Provenance Working Group. The W3C has change control over this specification.
+
+ +
+ + + + + + + +
+

A. Change Log

This section is non-normative.

+ +
+

A.1 Changes since Proposed Recommendation

This section is non-normative.

+
    +
  • Changed the status of this document section. +
  • Changed all URLs to PROV documents. +
  • Updated URL to IANA registered text/provenance-notation mime type. +
  • Added ex: prefix to some identifiers in examples. +
  • The mapping table for the bundle production incorrectly referred to optionalIdentifier, which was not present in the production. It was replaced by identifier. +
  • Replaced "are optional attributes" by the grammatically more correct "is a list of optional attributes". +
+ +
+ + +
+

A.2 Changes since Candidate Recommendation

This section is non-normative.

+ +
    +
  • Checked that all fragments resolved. +
  • Changed the status of this document section: added new documents to the PROV Family of Document, and removed the how to read section, referring instead to PROV-OVERVIEW. +
  • Changed all URLs to PROV documents. +
  • Clarified a sentence about the (non) nesting of bundles. +
  • Added html link to provenance. +
  • Updated security consideration for extensibility feature of PROV-N following IANA feedback. +
+
+ + +
+

A.3 Changes since last call

This section is non-normative.

+

Please see the Responses to Public Comments on the Last Call Working Draft for more details about the justification of these changes.

+
    +
  • ISSUE-543: Uses key-entity pair terminology for example 43. +
  • ISSUE-538: Rephrasing of text in example 10. +
  • ISSUE-547: Aligned terminology and productions with prov-constraints document, renaming 'toplevel bundle' to 'document', and renaming 'named bundle' to 'bundle'. +
  • ISSUE-496: For each prov-n term, added a cross-reference to corresponding prov-dm term (see table following each production). Rephrased text related to scope of a namespace declaration. Added an informative file with all productions. +
  • ISSUE-573: Updated Media Type section. +
  • ISSUE-589: Updated scoping rule for prefix-namespace declaration. Also refrained from saying bundles are self-contained. +
  • Moved feature at Risk mention into a separate note. +
  • Editorial's pass pre-publication. +
+
+
+ +
+

B. Acknowledgements

This section is non-normative.

+

+ +This document has been produced by the Provenance Working Group, and its contents reflect extensive discussion within the Working Group as a whole. The editors extend special thanks to Sandro Hawke (W3C/MIT) and Ivan Herman (W3C/ERCIM), W3C contacts for the Provenance Working Group. +

+ +

+The editors acknowledge valuable contributions from the following: +Tom Baker, +David Booth, +Robert Freimuth, +Satrajit Ghosh, +Ralph Hodgson, +Renato Iannella, +Jacek Kopecky, +James Leigh, +Jacco van Ossenbruggen, +Alan Ruttenberg, +Reza Samavi, and +Antoine Zimmermann. +

+ +

+Members of the Provenance Working Group at the time of publication of this document were: + +Ilkay Altintas (Invited expert), +Reza B'Far (Oracle Corporation), +Khalid Belhajjame (University of Manchester), +James Cheney (University of Edinburgh, School of Informatics), +Sam Coppens (iMinds - Ghent University), +David Corsar (University of Aberdeen, Computing Science), +Stephen Cresswell (The National Archives), +Tom De Nies (iMinds - Ghent University), +Helena Deus (DERI Galway at the National University of Ireland, Galway, Ireland), +Simon Dobson (Invited expert), +Martin Doerr (Foundation for Research and Technology - Hellas(FORTH)), +Kai Eckert (Invited expert), +Jean-Pierre EVAIN (European Broadcasting Union, EBU-UER), +James Frew (Invited expert), +Irini Fundulaki (Foundation for Research and Technology - Hellas(FORTH)), +Daniel Garijo (Universidad Politécnica de Madrid), +Yolanda Gil (Invited expert), +Ryan Golden (Oracle Corporation), +Paul Groth (Vrije Universiteit), +Olaf Hartig (Invited expert), +David Hau (National Cancer Institute, NCI), +Sandro Hawke (W3C/MIT), +Jörn Hees (German Research Center for Artificial Intelligence (DFKI) Gmbh), +Ivan Herman, (W3C/ERCIM), +Ralph Hodgson (TopQuadrant), +Hook Hua (Invited expert), +Trung Dong Huynh (University of Southampton), +Graham Klyne (University of Oxford), +Michael Lang (Revelytix, Inc.), +Timothy Lebo (Rensselaer Polytechnic Institute), +James McCusker (Rensselaer Polytechnic Institute), +Deborah McGuinness (Rensselaer Polytechnic Institute), +Simon Miles (Invited expert), +Paolo Missier (School of Computing Science, Newcastle university), +Luc Moreau (University of Southampton), +James Myers (Rensselaer Polytechnic Institute), +Vinh Nguyen (Wright State University), +Edoardo Pignotti (University of Aberdeen, Computing Science), +Paulo da Silva Pinheiro (Rensselaer Polytechnic Institute), +Carl Reed (Open Geospatial Consortium), +Adam Retter (Invited Expert), +Christine Runnegar (Invited expert), +Satya Sahoo (Invited expert), +David Schaengold (Revelytix, Inc.), +Daniel Schutzer (FSTC, Financial Services Technology Consortium), +Yogesh Simmhan (Invited expert), +Stian Soiland-Reyes (University of Manchester), +Eric Stephan (Pacific Northwest National Laboratory), +Linda Stewart (The National Archives), +Ed Summers (Library of Congress), +Maria Theodoridou (Foundation for Research and Technology - Hellas(FORTH)), +Ted Thibodeau (OpenLink Software Inc.), +Curt Tilmes (National Aeronautics and Space Administration), +Craig Trim (IBM Corporation), +Stephan Zednik (Rensselaer Polytechnic Institute), +Jun Zhao (University of Oxford), +Yuting Zhao (University of Aberdeen, Computing Science). +

+ +
+ + + +

C. References

C.1 Normative references

[PROV-CONSTRAINTS]
James Cheney; Paolo Missier; Luc Moreau; eds. Constraints of the PROV Data Model. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-constraints-20130430/ +
[PROV-DM]
Luc Moreau; Paolo Missier; eds. PROV-DM: The PROV Data Model. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-dm-20130430/ +
[PROV-O]
Timothy Lebo; Satya Sahoo; Deborah McGuinness; eds. PROV-O: The PROV Ontology. 30 April 2013, W3C Recommendation. URL: http://www.w3.org/TR/2013/REC-prov-o-20130430/ +
[RDF-SPARQL-QUERY]
Andy Seaborne; Eric Prud'hommeaux. SPARQL Query Language for RDF. 15 January 2008. W3C Recommendation. URL: http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115 +
[RFC2119]
S. Bradner. Key words for use in RFCs to Indicate Requirement Levels. March 1997. Internet RFC 2119. URL: http://www.ietf.org/rfc/rfc2119.txt +
[RFC3023]
M. Murata; S. St.Laurent; D. Kohn. XML Media Types (RFC 3023). January 2001. RFC. URL: http://www.ietf.org/rfc/rfc3023.txt +
[RFC3986]
T. Berners-Lee; R. Fielding; L. Masinter. Uniform Resource Identifier (URI): Generic Syntax (RFC 3986). January 2005. RFC. URL: http://www.ietf.org/rfc/rfc3986.txt +
[RFC3987]
M. Dürst; M. Suignard. Internationalized Resource Identifiers (IRIs) (RFC 3987). January 2005. RFC. URL: http://www.ietf.org/rfc/rfc3987.txt +
[UNICODE]
The Unicode Consortium. The Unicode Standard. Defined by: The Unicode Standard, Version 6.2.0, (Mountain View, CA: The Unicode Consortium, 2012. ISBN 978-1-936213-07-8) , as updated from time to time by the publication of new versions URL: http://www.unicode.org/unicode/standard/versions/enumeratedversions.html +
[UTF-8]
F. Yergeau. UTF-8, a transformation format of ISO 10646. IETF RFC 3629. November 2003. URL: http://www.ietf.org/rfc/rfc3629.txt +
[XML-NAMES]
Richard Tobin et al. Namespaces in XML 1.0 (Third Edition). 8 December 2009. W3C Recommendation. URL: http://www.w3.org/TR/2009/REC-xml-names-20091208/ +
[XML11]
Eve Maler et al. Extensible Markup Language (XML) 1.1 (Second Edition). 16 August 2006. W3C Recommendation. URL: http://www.w3.org/TR/2006/REC-xml11-20060816 +
[XMLSCHEMA11-2]
Henry S. Thompson et al. W3C XML Schema Definition Language (XSD) 1.1 Part 2: Datatypes. 5 April 2012. W3C Recommendation. URL: http://www.w3.org/TR/2012/REC-xmlschema11-2-20120405/ +

C.2 Informative references

[PROV-AQ]
Graham Klyne; Paul Groth; eds. Provenance Access and Query. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-aq-20130430/ +
[PROV-DC]
Daniel Garijo; Kai Eckert; eds. Dublin Core to PROV Mapping. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-dc-20130430/ +
[PROV-DICTIONARY]
Tom De Nies; Sam Coppens; eds. PROV Dictionary: Modeling Provenance for Dictionary Data Structures. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-dictionary-20130430/ +
Luc Moreau; Timothy Lebo; eds. Linking Across Provenance Bundles. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-links-20130430/ +
[PROV-OVERVIEW]
Paul Groth; Luc Moreau; eds. PROV-OVERVIEW: An Overview of the PROV Family of Documents. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-overview-20130430/ +
[PROV-PRIMER]
Yolanda Gil; Simon Miles; eds. PROV Model Primer. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-primer-20130430/ +
[PROV-RDF]
James Cheney PROV-RDF Mapping 2012, Working in Progress. URL: http://www.w3.org/2011/prov/wiki/ProvRDF +
[PROV-SEM]
James Cheney; ed. Semantics of the PROV Data Model. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-sem-20130430. +
[PROV-XML]
Hook Hua; Curt Tilmes; Stephan Zednik; eds. PROV-XML: The PROV XML Schema. 30 April 2013, W3C Note. URL: http://www.w3.org/TR/2013/NOTE-prov-xml-20130430/ +
[UNISEC]
Mark Davis; Michel Suignard. Unicode Security Considerations. 4 August 2010. URL: http://www.unicode.org/reports/tr36/ +
diff --git a/app/specs/standards/texts/c73e23899d09d8e3cfb5cfc6956ac7db62a4228eb5dad4f3cb01b49dfadffc16 b/app/specs/standards/texts/c73e23899d09d8e3cfb5cfc6956ac7db62a4228eb5dad4f3cb01b49dfadffc16 new file mode 100644 index 00000000..5ee90cc2 --- /dev/null +++ b/app/specs/standards/texts/c73e23899d09d8e3cfb5cfc6956ac7db62a4228eb5dad4f3cb01b49dfadffc16 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/c75b835e5fcf3578e40525b1737fa7fac803f0d67a5e7dea8b8fc12fa19d7f52 b/app/specs/standards/texts/c75b835e5fcf3578e40525b1737fa7fac803f0d67a5e7dea8b8fc12fa19d7f52 new file mode 100644 index 00000000..19892b66 --- /dev/null +++ b/app/specs/standards/texts/c75b835e5fcf3578e40525b1737fa7fac803f0d67a5e7dea8b8fc12fa19d7f52 @@ -0,0 +1,9 @@ +document + prefix ex + + activity(ex:a1,-,-) + entity(ex:e1) + wasStartedBy(ex:start1;ex:a1,-,-,-) + wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) + wasEndedBy(ex:end1;ex:a1,-,-,-) +endDocument diff --git a/app/specs/standards/texts/c842c46d15cdf7e89ee7a310326dcb752484c2596a97b4d130b2ab037e65cf7c b/app/specs/standards/texts/c842c46d15cdf7e89ee7a310326dcb752484c2596a97b4d130b2ab037e65cf7c new file mode 100644 index 00000000..6cc89ac3 --- /dev/null +++ b/app/specs/standards/texts/c842c46d15cdf7e89ee7a310326dcb752484c2596a97b4d130b2ab037e65cf7c @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:a1,-,ex:a2,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/cbedef529a44d67b418cec15a7942948dbeca7c8e7084b7377a47b81ffbcaf61 b/app/specs/standards/texts/cbedef529a44d67b418cec15a7942948dbeca7c8e7084b7377a47b81ffbcaf61 new file mode 100644 index 00000000..864afeae --- /dev/null +++ b/app/specs/standards/texts/cbedef529a44d67b418cec15a7942948dbeca7c8e7084b7377a47b81ffbcaf61 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +activity(ex:a3,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:inv1;ex:e1,ex:a3,-) +endDocument diff --git a/app/specs/standards/texts/cc15c763caf1d92f51205671d92e3b06d0dd61487192cf55111c8351989f6313 b/app/specs/standards/texts/cc15c763caf1d92f51205671d92e3b06d0dd61487192cf55111c8351989f6313 new file mode 100644 index 00000000..1a12c91f --- /dev/null +++ b/app/specs/standards/texts/cc15c763caf1d92f51205671d92e3b06d0dd61487192cf55111c8351989f6313 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-) +wasEndedBy(ex:end1;ex:a1,ex:e1-other,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/cc20fb3639530a193e83436c763b11addbda1acdcfa0146a3ca5f648dce8ae88 b/app/specs/standards/texts/cc20fb3639530a193e83436c763b11addbda1acdcfa0146a3ca5f648dce8ae88 new file mode 100644 index 00000000..13b2e283 --- /dev/null +++ b/app/specs/standards/texts/cc20fb3639530a193e83436c763b11addbda1acdcfa0146a3ca5f648dce8ae88 @@ -0,0 +1,5 @@ +document + prefix ex + + wasInfluencedBy(ex:infl1;-, ex:x1) +endDocument diff --git a/app/specs/standards/texts/cd05ff844edde1c254f4339f0d7a867b621c2407014ffd9afb43496d5e247c98 b/app/specs/standards/texts/cd05ff844edde1c254f4339f0d7a867b621c2407014ffd9afb43496d5e247c98 new file mode 100644 index 00000000..5cd816ca --- /dev/null +++ b/app/specs/standards/texts/cd05ff844edde1c254f4339f0d7a867b621c2407014ffd9afb43496d5e247c98 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, -, ex:use) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/specs/standards/texts/d16e054420d708f81e5eb0d7ddd9057aa4ec899c37ca7f53bd098fa59853bddb b/app/specs/standards/texts/d16e054420d708f81e5eb0d7ddd9057aa4ec899c37ca7f53bd098fa59853bddb new file mode 100644 index 00000000..41f644c5 --- /dev/null +++ b/app/specs/standards/texts/d16e054420d708f81e5eb0d7ddd9057aa4ec899c37ca7f53bd098fa59853bddb @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test1']) +wasEndedBy(ex:a1,ex:e1,ex:a2,-,[prov:type='ex:test2']) +endDocument diff --git a/app/specs/standards/texts/d1f834c050400d233c963b9e4bf92dd767f8e49379a2a9566ebea575c2bf8886 b/app/specs/standards/texts/d1f834c050400d233c963b9e4bf92dd767f8e49379a2a9566ebea575c2bf8886 new file mode 100644 index 00000000..dbc5f960 --- /dev/null +++ b/app/specs/standards/texts/d1f834c050400d233c963b9e4bf92dd767f8e49379a2a9566ebea575c2bf8886 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/d25d05f739e5dcbbfc60a09e3e5ebfb63b287236a6a462a09b256bfe09e55e1f b/app/specs/standards/texts/d25d05f739e5dcbbfc60a09e3e5ebfb63b287236a6a462a09b256bfe09e55e1f new file mode 100644 index 00000000..495f25f4 --- /dev/null +++ b/app/specs/standards/texts/d25d05f739e5dcbbfc60a09e3e5ebfb63b287236a6a462a09b256bfe09e55e1f @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/d26bba26f5bb9ef42bc942b2a4b3a2e3434748e4a750fbf18a5c10aecf4d1354 b/app/specs/standards/texts/d26bba26f5bb9ef42bc942b2a4b3a2e3434748e4a750fbf18a5c10aecf4d1354 new file mode 100644 index 00000000..e51f3df5 --- /dev/null +++ b/app/specs/standards/texts/d26bba26f5bb9ef42bc942b2a4b3a2e3434748e4a750fbf18a5c10aecf4d1354 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/d332b9f131cdef7f1ca464a1a160fd7a8d22d24b0e4be20c804a3b09fd00d468 b/app/specs/standards/texts/d332b9f131cdef7f1ca464a1a160fd7a8d22d24b0e4be20c804a3b09fd00d468 new file mode 100644 index 00000000..9644cb7e --- /dev/null +++ b/app/specs/standards/texts/d332b9f131cdef7f1ca464a1a160fd7a8d22d24b0e4be20c804a3b09fd00d468 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1-other) +endDocument diff --git a/app/specs/standards/texts/d3ae171d3b3a2b1930c85666a31acf11cdc231cf6d4ef8e5147711bf4c6cf792 b/app/specs/standards/texts/d3ae171d3b3a2b1930c85666a31acf11cdc231cf6d4ef8e5147711bf4c6cf792 new file mode 100644 index 00000000..b990a53a --- /dev/null +++ b/app/specs/standards/texts/d3ae171d3b3a2b1930c85666a31acf11cdc231cf6d4ef8e5147711bf4c6cf792 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:e1,ex:a1,2012-11-16T16:05:00) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/d5e96e7294465996cbc7b7a16208c795df7d944af6b5f1fa8a69ab7635c4a65c b/app/specs/standards/texts/d5e96e7294465996cbc7b7a16208c795df7d944af6b5f1fa8a69ab7635c4a65c new file mode 100644 index 00000000..df21394a --- /dev/null +++ b/app/specs/standards/texts/d5e96e7294465996cbc7b7a16208c795df7d944af6b5f1fa8a69ab7635c4a65c @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00) +wasGeneratedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/d77ff8316daf1f19ee7db1ff57704794411c528bfccf566572f3a2e706df52c2 b/app/specs/standards/texts/d77ff8316daf1f19ee7db1ff57704794411c528bfccf566572f3a2e706df52c2 new file mode 100644 index 00000000..e5193d26 --- /dev/null +++ b/app/specs/standards/texts/d77ff8316daf1f19ee7db1ff57704794411c528bfccf566572f3a2e706df52c2 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +specializationOf(ex:e2,ex:e1) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +endDocument diff --git a/app/specs/standards/texts/d83a53c9ba33df698ce44c1c5398aed7cb71eafa11b05d812910e12c00358486 b/app/specs/standards/texts/d83a53c9ba33df698ce44c1c5398aed7cb71eafa11b05d812910e12c00358486 new file mode 100644 index 00000000..ed8b0c80 --- /dev/null +++ b/app/specs/standards/texts/d83a53c9ba33df698ce44c1c5398aed7cb71eafa11b05d812910e12c00358486 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,-,ex:a2,-) +wasStartedBy(ex:start1;ex:a1,-,-,2011-11-16T16:05:00) +wasStartedBy(ex:a1,ex:e1,ex:a2,2012-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/da88a2f01a67acb0be2ea0c1a16bf4c6e92bd14aa049d9b3a32fb983f38ce24e b/app/specs/standards/texts/da88a2f01a67acb0be2ea0c1a16bf4c6e92bd14aa049d9b3a32fb983f38ce24e new file mode 100644 index 00000000..35284689 --- /dev/null +++ b/app/specs/standards/texts/da88a2f01a67acb0be2ea0c1a16bf4c6e92bd14aa049d9b3a32fb983f38ce24e @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasStartedBy(ex:start1;ex:a1,ex:e1,ex:a2,-) +wasStartedBy(ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/db3235aa9529006383e4b4918c6cd92deca1e582d247d7bda56088fa1ca554cc b/app/specs/standards/texts/db3235aa9529006383e4b4918c6cd92deca1e582d247d7bda56088fa1ca554cc new file mode 100644 index 00000000..c8f47b41 --- /dev/null +++ b/app/specs/standards/texts/db3235aa9529006383e4b4918c6cd92deca1e582d247d7bda56088fa1ca554cc @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1-other,-) +endDocument diff --git a/app/specs/standards/texts/db8a8f4d8006860070c7ba1150982d55555c8eb10072369a45785909bbfb8145 b/app/specs/standards/texts/db8a8f4d8006860070c7ba1150982d55555c8eb10072369a45785909bbfb8145 new file mode 100644 index 00000000..607161a1 --- /dev/null +++ b/app/specs/standards/texts/db8a8f4d8006860070c7ba1150982d55555c8eb10072369a45785909bbfb8145 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInformedBy(ex:inf1;ex:a1,ex:a2) +wasInformedBy(ex:inf1;ex:a1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/ddc25ef9066d239990bc14312194a6b809ad2d6db6843cdf75439ca00ad0f446 b/app/specs/standards/texts/ddc25ef9066d239990bc14312194a6b809ad2d6db6843cdf75439ca00ad0f446 new file mode 100644 index 00000000..27b11592 --- /dev/null +++ b/app/specs/standards/texts/ddc25ef9066d239990bc14312194a6b809ad2d6db6843cdf75439ca00ad0f446 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasInvalidatedBy(ex:inv1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:inv2;ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/ddfac868d8040c349bd2e7742774a6b700cee3ae4d423803c09b0318139d9f73 b/app/specs/standards/texts/ddfac868d8040c349bd2e7742774a6b700cee3ae4d423803c09b0318139d9f73 new file mode 100644 index 00000000..805d4f6b --- /dev/null +++ b/app/specs/standards/texts/ddfac868d8040c349bd2e7742774a6b700cee3ae4d423803c09b0318139d9f73 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,-) +wasInvalidatedBy(ex:gen1;ex:e1-other,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/de24f9e04c366d1e1e2935ff227291074cede65fb73d986e79801ad69209527b b/app/specs/standards/texts/de24f9e04c366d1e1e2935ff227291074cede65fb73d986e79801ad69209527b new file mode 100644 index 00000000..3964bf66 --- /dev/null +++ b/app/specs/standards/texts/de24f9e04c366d1e1e2935ff227291074cede65fb73d986e79801ad69209527b @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/de2b097e6602e7ca17eab78743c88aac9da554882679a2bcdb0d9f9b0b938e1a b/app/specs/standards/texts/de2b097e6602e7ca17eab78743c88aac9da554882679a2bcdb0d9f9b0b938e1a new file mode 100644 index 00000000..0c42da8f --- /dev/null +++ b/app/specs/standards/texts/de2b097e6602e7ca17eab78743c88aac9da554882679a2bcdb0d9f9b0b938e1a @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:e1, ex:ag2) +wasAttributedTo(ex:e1, ex:ag2) +endDocument diff --git a/app/specs/standards/texts/dfa30539071ca49283b770da97896acce158bbce322cfc10977a38a09c24f48a b/app/specs/standards/texts/dfa30539071ca49283b770da97896acce158bbce322cfc10977a38a09c24f48a new file mode 100644 index 00000000..73a267a0 --- /dev/null +++ b/app/specs/standards/texts/dfa30539071ca49283b770da97896acce158bbce322cfc10977a38a09c24f48a @@ -0,0 +1,8 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +actedOnBehalfOf(ex:del2;ex:ag2,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/e1c54c4d67553b725e3ae87f6ff5b000c339d8b905c969308b21eb712bb054e3 b/app/specs/standards/texts/e1c54c4d67553b725e3ae87f6ff5b000c339d8b905c969308b21eb712bb054e3 new file mode 100644 index 00000000..b7ca9561 --- /dev/null +++ b/app/specs/standards/texts/e1c54c4d67553b725e3ae87f6ff5b000c339d8b905c969308b21eb712bb054e3 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use) +wasDerivedFrom(ex:der1;ex:e2, ex:e1, ex:a, ex:gen, ex:use) +endDocument diff --git a/app/specs/standards/texts/e24e1476227303166c005daa6e658f35693e1da6a678e57626ef7f85e9b28fb6 b/app/specs/standards/texts/e24e1476227303166c005daa6e658f35693e1da6a678e57626ef7f85e9b28fb6 new file mode 100644 index 00000000..ce8eca94 --- /dev/null +++ b/app/specs/standards/texts/e24e1476227303166c005daa6e658f35693e1da6a678e57626ef7f85e9b28fb6 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +used(ex:use1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/e4c6fcd30f9763a16c0cb7552f2298c326e2e41b24a9e8a112f9fb7fb7f7f752 b/app/specs/standards/texts/e4c6fcd30f9763a16c0cb7552f2298c326e2e41b24a9e8a112f9fb7fb7f7f752 new file mode 100644 index 00000000..a9293192 --- /dev/null +++ b/app/specs/standards/texts/e4c6fcd30f9763a16c0cb7552f2298c326e2e41b24a9e8a112f9fb7fb7f7f752 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +agent(ex:ag2) +wasAttributedTo(ex:e1, ex:ag2) +wasAttributedTo(ex:del2;ex:e1, ex:ag2) +endDocument diff --git a/app/specs/standards/texts/e4ce2797f747ab3d6ff898c7bfa3a2625cb6017d1b899e9db64c21e5c077f128 b/app/specs/standards/texts/e4ce2797f747ab3d6ff898c7bfa3a2625cb6017d1b899e9db64c21e5c077f128 new file mode 100644 index 00000000..6e30fcf6 --- /dev/null +++ b/app/specs/standards/texts/e4ce2797f747ab3d6ff898c7bfa3a2625cb6017d1b899e9db64c21e5c077f128 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:e1,ex:a1,2012-11-16T16:05:00) +wasInvalidatedBy(ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/e4f9e83af53ca681281d53383ab3da025b73c58ba2c01e33eb4f19708b9fd7c1 b/app/specs/standards/texts/e4f9e83af53ca681281d53383ab3da025b73c58ba2c01e33eb4f19708b9fd7c1 new file mode 100644 index 00000000..c14eea2e --- /dev/null +++ b/app/specs/standards/texts/e4f9e83af53ca681281d53383ab3da025b73c58ba2c01e33eb4f19708b9fd7c1 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:assoc1;ex:a1,ex:ag1,-) +endDocument diff --git a/app/specs/standards/texts/e8905e9d6cf642a1669d9967a33abf38ce0270ff1384c03b28c460222f48a3d9 b/app/specs/standards/texts/e8905e9d6cf642a1669d9967a33abf38ce0270ff1384c03b28c460222f48a3d9 new file mode 100644 index 00000000..c06f14f2 --- /dev/null +++ b/app/specs/standards/texts/e8905e9d6cf642a1669d9967a33abf38ce0270ff1384c03b28c460222f48a3d9 @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1,[prov:type='prov:Plan']) +activity(ex:a1,-,-) +agent(ex:ag1) +wasAssociatedWith(ex:a1,ex:ag1,ex:e1) +wasAssociatedWith(ex:a1,ex:ag1,ex:e1) +endDocument diff --git a/app/specs/standards/texts/eb72569a97a68aedc6f68c28a0878121316f773365f97bc0fbd2da9b15e04a80 b/app/specs/standards/texts/eb72569a97a68aedc6f68c28a0878121316f773365f97bc0fbd2da9b15e04a80 new file mode 100644 index 00000000..54291870 --- /dev/null +++ b/app/specs/standards/texts/eb72569a97a68aedc6f68c28a0878121316f773365f97bc0fbd2da9b15e04a80 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;-,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/ec5bcb0b29e491fd99a26aa3e9215f68e3a7e3d9ad6f4b361a8932cfc25dde58 b/app/specs/standards/texts/ec5bcb0b29e491fd99a26aa3e9215f68e3a7e3d9ad6f4b361a8932cfc25dde58 new file mode 100644 index 00000000..61dc8401 --- /dev/null +++ b/app/specs/standards/texts/ec5bcb0b29e491fd99a26aa3e9215f68e3a7e3d9ad6f4b361a8932cfc25dde58 @@ -0,0 +1,9 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +wasEndedBy(ex:end1;ex:a1,-,ex:a2,-) +wasEndedBy(ex:end1;ex:a1,-,-,2011-11-16T16:05:00) +wasEndedBy(ex:a1,ex:e1,ex:a2,-) +endDocument diff --git a/app/specs/standards/texts/ece2212f6d22a526cd3e33849aec97e3f3b85e0eb8d2c04748f875b8b6fb6b1b b/app/specs/standards/texts/ece2212f6d22a526cd3e33849aec97e3f3b85e0eb8d2c04748f875b8b6fb6b1b new file mode 100644 index 00000000..680c1b2a --- /dev/null +++ b/app/specs/standards/texts/ece2212f6d22a526cd3e33849aec97e3f3b85e0eb8d2c04748f875b8b6fb6b1b @@ -0,0 +1,8 @@ +document + default + + entity(proteinSample) + entity(digestedProteinSample1) + wasDerivedFrom(digestedProteinSample1, proteinSample, -, u1, -) + used(u1; -, Trypsin, -,[prov:role='treatmentEnzyme']) +endDocument diff --git a/app/specs/standards/texts/ee9f4185a41f2dacd8a849e20d9504e86c096bbb9775a568bdaa24d14e43bb95 b/app/specs/standards/texts/ee9f4185a41f2dacd8a849e20d9504e86c096bbb9775a568bdaa24d14e43bb95 new file mode 100644 index 00000000..f80d0533 --- /dev/null +++ b/app/specs/standards/texts/ee9f4185a41f2dacd8a849e20d9504e86c096bbb9775a568bdaa24d14e43bb95 @@ -0,0 +1,15 @@ +document +prefix ex +activity(ex:a,-,-) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +entity(ex:ag) +agent(ex:ag) +entity(ex:e1) +entity(ex:e2) +wasAssociatedWith(ex:assoc;ex:a,ex:ag,-) +wasStartedBy(ex:start1;ex:a,ex:e1,-,-) +wasGeneratedBy(ex:gen1;ex:ag,ex:a1,-) +wasInvalidatedBy(ex:inv1;ex:ag,ex:a2,-) +wasEndedBy(ex:end1;ex:a,ex:e2,-,-) +endDocument diff --git a/app/specs/standards/texts/f09ca1ce9a9ac6c57f9c932777ccc7e4de60e0c0f821902dad0fc2c96889a947 b/app/specs/standards/texts/f09ca1ce9a9ac6c57f9c932777ccc7e4de60e0c0f821902dad0fc2c96889a947 new file mode 100644 index 00000000..293739ef --- /dev/null +++ b/app/specs/standards/texts/f09ca1ce9a9ac6c57f9c932777ccc7e4de60e0c0f821902dad0fc2c96889a947 @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +wasGeneratedBy(ex:gen1;ex:e1-other,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/f7de0050dadcd95746368050e198b24c65489bd83a3d058d01af5894bd2fc124 b/app/specs/standards/texts/f7de0050dadcd95746368050e198b24c65489bd83a3d058d01af5894bd2fc124 new file mode 100644 index 00000000..afeaf2df --- /dev/null +++ b/app/specs/standards/texts/f7de0050dadcd95746368050e198b24c65489bd83a3d058d01af5894bd2fc124 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:a2,-,-) +agent(ex:ag2) +agent(ex:ag1) +actedOnBehalfOf(ex:del1;ex:ag2,ex:ag1,ex:a2) +endDocument diff --git a/app/specs/standards/texts/f8a30421d35a5ea18195b6905e8d622314594f90994ad305c35c2b98c87b8efb b/app/specs/standards/texts/f8a30421d35a5ea18195b6905e8d622314594f90994ad305c35c2b98c87b8efb new file mode 100644 index 00000000..ba82240d --- /dev/null +++ b/app/specs/standards/texts/f8a30421d35a5ea18195b6905e8d622314594f90994ad305c35c2b98c87b8efb @@ -0,0 +1,7 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2012-11-16T16:05:00) +wasInvalidatedBy(ex:gen1;ex:e1,ex:a1,2011-11-16T16:05:00) +endDocument diff --git a/app/specs/standards/texts/faee3bd15f5e9c6b86c642eef76ba01a36bc07cf0d8019fea0aa678fc54c2772 b/app/specs/standards/texts/faee3bd15f5e9c6b86c642eef76ba01a36bc07cf0d8019fea0aa678fc54c2772 new file mode 100644 index 00000000..03c72214 --- /dev/null +++ b/app/specs/standards/texts/faee3bd15f5e9c6b86c642eef76ba01a36bc07cf0d8019fea0aa678fc54c2772 @@ -0,0 +1,7 @@ +document +prefix ex +activity(ex:e1,-,-) +entity(ex:a1) +used(ex:use1;ex:e1,ex:a1,-) +used(ex:use1;ex:e1-other,ex:a1,-) +endDocument diff --git a/app/specs/standards/texts/fbc7ae4626c042dec6844858429c47fd94c7754b495d92e0907f2fbe71ca12bd b/app/specs/standards/texts/fbc7ae4626c042dec6844858429c47fd94c7754b495d92e0907f2fbe71ca12bd new file mode 100644 index 00000000..9f8bbce1 --- /dev/null +++ b/app/specs/standards/texts/fbc7ae4626c042dec6844858429c47fd94c7754b495d92e0907f2fbe71ca12bd @@ -0,0 +1,6 @@ +document + prefix ex + + entity(ex:e1, [prov:type='ex:test1']) + activity(ex:e1, -, -, [prov:type='ex:test2']) +endDocument diff --git a/app/specs/standards/texts/fc7878e9c52596932f8f781c2f1b6a0bf64244fa00226df869c17f6585678e1f b/app/specs/standards/texts/fc7878e9c52596932f8f781c2f1b6a0bf64244fa00226df869c17f6585678e1f new file mode 100644 index 00000000..f9ec612d --- /dev/null +++ b/app/specs/standards/texts/fc7878e9c52596932f8f781c2f1b6a0bf64244fa00226df869c17f6585678e1f @@ -0,0 +1,10 @@ +document +prefix ex +entity(ex:e1) +activity(ex:a1,-,-) +activity(ex:a2,-,-) +activity(ex:a3,-,-) +wasGeneratedBy(ex:gen1;ex:e1,ex:a1,-) +used(ex:use1;ex:a2,ex:e1,-) +wasInvalidatedBy(ex:inv1;ex:e1,ex:a3,-) +endDocument diff --git a/app/specs/standards/texts/ff6ea34b8e4d4945b6353cacd90c8256f65bd0aac98b05d55722e45e5b8b1aea b/app/specs/standards/texts/ff6ea34b8e4d4945b6353cacd90c8256f65bd0aac98b05d55722e45e5b8b1aea new file mode 100644 index 00000000..cc037cf0 --- /dev/null +++ b/app/specs/standards/texts/ff6ea34b8e4d4945b6353cacd90c8256f65bd0aac98b05d55722e45e5b8b1aea @@ -0,0 +1,8 @@ +document +prefix ex +entity(ex:e1) +entity(ex:e2) +wasGeneratedBy(ex:gen1;ex:e1,-,-) +wasGeneratedBy(ex:gen2;ex:e2,-,-) +wasDerivedFrom(ex:der1;ex:e2, ex:e1) +endDocument diff --git a/app/src/PrismProv.lex.tex b/app/src/PrismProv.lex.tex new file mode 100644 index 00000000..d139ed59 --- /dev/null +++ b/app/src/PrismProv.lex.tex @@ -0,0 +1,1924 @@ +\begin{lexlean}{PrismProv} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\title{Text application model} +\begin{semanticmodule} +structure{name: PvCtx, type_parameters: [], parameters: [], fields: [{name: d, type: Bytes}]} + +structure{ + name: PvPState, + type_parameters: [], + parameters: [], + fields: [ + {name: ph, type: Nat}, + {name: pos, type: Nat}, + {name: scope, type: Nat}, + {name: nb, type: Nat}, + {name: bid, type: Nat}, + {name: nv, type: Nat}, + {name: ns, type: Bytes}, + {name: terms, type: Bytes}, + {name: rows, type: Bytes}, + {name: cur, type: Bytes} + ] +} + +structure{ + name: PvCState, + type_parameters: [], + parameters: [], + fields: [ + {name: rows, type: Bytes}, + {name: par, type: Bytes}, + {name: nv, type: Nat}, + {name: bad, type: Nat} + ] +} + +structure{name: PvEState, type_parameters: [], parameters: [], fields: [{name: edges, type: Bytes}]} + +structure{name: PvMState, type_parameters: [], parameters: [], fields: [{name: marks, type: Bytes}]} + +definition{ + name: pvAt, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (match (prim index s i : (Option UInt8)) + | Option.none => 0 + | Option.some octet => (prim to_nat octet : Nat)), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvG16, + parameters: [s : Bytes, k : Nat], + result: Nat, + body: ((prim multiply (pvAt s k) 256 : Nat) + (pvAt s (k + 1))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvByte, + parameters: [n : Nat], + result: Bytes, + body: (match (prim slice 0x000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f202122232425262728292a2b2c2d2e2f303132333435363738393a3b3c3d3e3f404142434445464748494a4b4c4d4e4f505152535455565758595a5b5c5d5e5f606162636465666768696a6b6c6d6e6f707172737475767778797a7b7c7d7e7f808182838485868788898a8b8c8d8e8f909192939495969798999a9b9c9d9e9fa0a1a2a3a4a5a6a7a8a9aaabacadaeafb0b1b2b3b4b5b6b7b8b9babbbcbdbebfc0c1c2c3c4c5c6c7c8c9cacbcccdcecfd0d1d2d3d4d5d6d7d8d9dadbdcdddedfe0e1e2e3e4e5e6e7e8e9eaebecedeeeff0f1f2f3f4f5f6f7f8f9fafbfcfdfeff (prim remainder n 256 0 : Nat) 1 : (Option Bytes)) + | Option.none => 0x + | Option.some part => part) +} + +definition{ + name: pvU16, + parameters: [n : Nat], + result: Bytes, + body: (prim append (pvByte (prim quotient n 256 0 : Nat)) (pvByte n) : Bytes) +} + +definition{ + name: pvIn, + parameters: [b : Nat, lo : Nat, hi : Nat], + result: Bool, + body: ((lo false + | Nat.succ more => (if ((prim length d : Nat) last + | Nat.succ more => (let n : Nat := (pvLocLen d i); (if (n =? 0) then last else (if ((pvAt d i) =? 46) then (pvRun d (i + 1) last more) else (pvRun d (i + n) (i + n) more))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvPfxBody, + parameters: [d : Bytes, i : Nat, e : Nat, fuel : Nat], + result: Bool, + body: (match fuel + | Nat.zero => false + | Nat.succ more => (if (e e + | Nat.succ more => (if (e i + | Nat.succ more => (if ((prim length d : Nat) 0 + | Nat.succ more => (if ((prim length d : Nat) i + | Nat.succ more => (if (pvIsWs (pvAt d i)) then (pvWsFrom d (i + 1) more) else (if ((pvAt d i) =? 47) then (if ((pvAt d (i + 1)) =? 47) then (pvWsFrom d (pvEol d (i + 2) 65536) more) else (if ((pvAt d (i + 1)) =? 42) then (if ((pvBlock d (i + 2) 65536) =? 0) then i else (pvWsFrom d (pvBlock d (i + 2) 65536) more)) else i)) else i))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvWs, + parameters: [d : Bytes, i : Nat], + result: Nat, + body: (pvWsFrom d i 65536), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvEqAt, + parameters: [d : Bytes, i : Nat, k : Bytes, j : Nat, fuel : Nat], + result: Bool, + body: (match fuel + | Nat.zero => false + | Nat.succ more => (if ((prim length k : Nat) 0 + | Nat.succ more => (let b : Nat := (pvAt d i); (if (b =? 62) then (i + 1) else (if (b 0 + | Nat.succ more => (if ((prim length d : Nat) 0 + | Nat.succ more => (if ((prim length d : Nat) i + | Nat.succ more => (if (pvDigit (pvAt d i)) then (pvDigEnd d (i + 1) more) else i)), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvAlpha, + parameters: [b : Nat], + result: Bool, + body: ((pvIn b 65 90) || (pvIn b 97 122)) +} + +definition{ + name: pvAlphaEnd, + parameters: [d : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ more => (if (pvAlpha (pvAt d i)) then (pvAlphaEnd d (i + 1) more) else i)), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvAlnumEnd, + parameters: [d : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ more => (if ((pvAlpha (pvAt d i)) || (pvDigit (pvAt d i))) then (pvAlnumEnd d (i + 1) more) else i)), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvLangTail, + parameters: [d : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 0 + | Nat.succ more => (if ((pvAt d i) =? 45) then (if ((pvAlnumEnd d (i + 1) 65536) =? (i + 1)) then 0 else (pvLangTail d (pvAlnumEnd d (i + 1) 65536) more)) else i)), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvLangEnd, + parameters: [d : Bytes, i : Nat], + result: Nat, + body: (let a : Nat := (pvAlphaEnd d (i + 1) 65536); (if (a =? (i + 1)) then 0 else (pvLangTail d a 65536))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvIntEnd, + parameters: [d : Bytes, i : Nat], + result: Nat, + body: (let s : Nat := (if ((pvAt d i) =? 45) then (i + 1) else i); (let e : Nat := (pvDigEnd d s 65536); (if (e =? s) then 0 else e))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvDg, + parameters: [d : Bytes, i : Nat], + result: Nat, + body: (if (pvDigit (pvAt d i)) then (prim subtract (pvAt d i) 48 : Nat) else 10), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvN2, + parameters: [d : Bytes, i : Nat], + result: Nat, + body: (if (((pvDg d i) =? 10) || ((pvDg d (i + 1)) =? 10)) then 100 else ((prim multiply (pvDg d i) 10 : Nat) + (pvDg d (i + 1)))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvNum, + parameters: [d : Bytes, i : Nat, e : Nat, acc : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => acc + | Nat.succ more => (if (e false + | Nat.succ more => (if (e e + | Nat.succ more => (if (e false + | Nat.succ more => (if (n =? 0) then true else (if ((pvAt d a) =? (pvAt d b)) then (pvEqRange d (a + 1) (b + 1) (prim subtract n 1 : Nat) more) else false))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvTimeSame, + parameters: [d : Bytes, a : Nat, b : Nat], + result: Bool, + body: (let fa : Nat := ((pvYe d a) + 16); (let fb : Nat := ((pvYe d b) + 16); (let ea : Nat := (pvFracEnd d fa (pvTimeFe d a) 65536); (let eb : Nat := (pvFracEnd d fb (pvTimeFe d b) 65536); (if ((pvZoned d a) && (not (pvZoned d b))) then false else (if ((pvZoned d b) && (not (pvZoned d a))) then false else (if (not ((pvSecs d a) =? (pvSecs d b))) then false else (if (not ((prim subtract ea fa : Nat) =? (prim subtract eb fb : Nat))) then false else (pvEqRange d fa fb (prim subtract ea fa : Nat) 65536))))))))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvNsFind, + parameters: [d : Bytes, ns : Bytes, scope : Nat, ps : Nat, pe : Nat, k : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 0 + | Nat.succ more => (let o : Nat := (prim multiply k 9 : Nat); (if ((prim length ns : Nat) false + | Nat.succ more => (if (ca =? (65536 + aLe)) then (cb =? (65536 + bLe)) else (if (cb =? (65536 + bLe)) then false else (if ((pvAt d (prim remainder ca 65536 0 : Nat)) =? (pvAt d (prim remainder cb 65536 0 : Nat))) then (pvVEq d (pvCN d ca aE aLs aLe) aE aLs aLe (pvCN d cb bE bLs bLe) bE bLs bLe more) else false)))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvVLit, + parameters: [d : Bytes, ca : Nat, aE : Nat, aLs : Nat, aLe : Nat, k : Bytes, j : Nat, fuel : Nat], + result: Bool, + body: (match fuel + | Nat.zero => false + | Nat.succ more => (if (ca =? (65536 + aLe)) then (j =? (prim length k : Nat)) else (if ((prim length k : Nat) 0 + | Nat.succ more => (let n : Nat := (pvName d ns scope p); (if (n =? 0) then 0 else (let q : Nat := (pvWs d n); (if (not ((pvAt d q) =? 61)) then 0 else (let le : Nat := (pvLitEnd d ns scope (pvWs d (q + 1))); (if (le =? 0) then 0 else (let r : Nat := (pvWs d le); (if ((pvAt d r) =? 44) then (pvAttrLoop d ns scope (pvWs d (r + 1)) more) else (if ((pvAt d r) =? 93) then (r + 1) else 0)))))))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvAttrsEnd, + parameters: [d : Bytes, ns : Bytes, scope : Nat, i : Nat], + result: Nat, + body: (let p : Nat := (pvWs d (i + 1)); (if (not ((pvAt d i) =? 91)) then 0 else (if ((pvAt d p) =? 93) then (p + 1) else (pvAttrLoop d ns scope p 65536)))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvValIs, + parameters: [d : Bytes, ns : Bytes, scope : Nat, v : Nat, k : Bytes], + result: Bool, + body: (if ((pvAt d v) =? 39) then (pvQIs d ns scope (v + 1) (pvNameEnd d (v + 1)) k) else (if (not ((pvAt d v) =? 34)) then false else (let se : Nat := (pvStrEnd d v); (let r : Nat := (pvWs d se); (let t : Nat := (pvWs d (r + 2)); (let cs : Nat := (if (pvLong d v) then (v + 3) else (v + 1)); (let ce : Nat := (if (pvLong d v) then (prim subtract se 3 : Nat) else (prim subtract se 1 : Nat)); (if ((not ((pvAt d r) =? 37)) || (not ((pvAt d (r + 1)) =? 37))) then false else (if (pvQIs d ns scope t (pvNameEnd d t) (prim utf8_encode "http://www.w3.org/ns/prov#QUALIFIED_NAME" : Bytes)) then (if ((pvNameEnd d cs) =? ce) then (pvQIs d ns scope cs ce k) else false) else false))))))))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvAttrHas, + parameters: [d : Bytes, ns : Bytes, scope : Nat, p : Nat, k : Bytes, fuel : Nat], + result: Bool, + body: (match fuel + | Nat.zero => false + | Nat.succ more => (if ((pvAt d p) =? 93) then false else (let n : Nat := (pvNameEnd d p); (let v : Nat := (pvWs d ((pvWs d n) + 1)); (let r : Nat := (pvWs d (pvLitEnd d ns scope v)); (if (pvQIs d ns scope p n (prim utf8_encode "http://www.w3.org/ns/prov#type" : Bytes)) then (if (pvValIs d ns scope v k) then true else (if ((pvAt d r) =? 44) then (pvAttrHas d ns scope (pvWs d (r + 1)) k more) else false)) else (if ((pvAt d r) =? 44) then (pvAttrHas d ns scope (pvWs d (r + 1)) k more) else false))))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvKw, + parameters: [d : Bytes, i : Nat, n : Nat], + result: Nat, + body: (if (pvIs d i n (prim utf8_encode "entity" : Bytes)) then 1 else (if (pvIs d i n (prim utf8_encode "activity" : Bytes)) then 2 else (if (pvIs d i n (prim utf8_encode "agent" : Bytes)) then 3 else (if (pvIs d i n (prim utf8_encode "wasGeneratedBy" : Bytes)) then 4 else (if (pvIs d i n (prim utf8_encode "used" : Bytes)) then 5 else (if (pvIs d i n (prim utf8_encode "wasInformedBy" : Bytes)) then 6 else (if (pvIs d i n (prim utf8_encode "wasStartedBy" : Bytes)) then 7 else (if (pvIs d i n (prim utf8_encode "wasEndedBy" : Bytes)) then 8 else (if (pvIs d i n (prim utf8_encode "wasInvalidatedBy" : Bytes)) then 9 else (if (pvIs d i n (prim utf8_encode "wasDerivedFrom" : Bytes)) then 10 else (if (pvIs d i n (prim utf8_encode "wasAttributedTo" : Bytes)) then 11 else (if (pvIs d i n (prim utf8_encode "wasAssociatedWith" : Bytes)) then 12 else (if (pvIs d i n (prim utf8_encode "actedOnBehalfOf" : Bytes)) then 13 else (if (pvIs d i n (prim utf8_encode "wasInfluencedBy" : Bytes)) then 14 else (if (pvIs d i n (prim utf8_encode "alternateOf" : Bytes)) then 15 else (if (pvIs d i n (prim utf8_encode "specializationOf" : Bytes)) then 16 else (if (pvIs d i n (prim utf8_encode "hadMember" : Bytes)) then 17 else 0))))))))))))))))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvKinds, + parameters: [kw : Nat], + result: Nat, + body: (if (kw =? 2) then 61 else (if ((kw =? 4) || (kw =? 5)) then 57 else (if (kw =? 9) then 57 else (if ((kw =? 7) || (kw =? 8)) then 233 else (if (kw =? 10) then 677 else (if (kw =? 12) then 41 else (if (kw =? 13) then 37 else (if ((kw =? 1) || (kw =? 3)) then 1 else 5)))))))) +} + +definition{ + name: pvPow4, + parameters: [k : Nat], + result: Nat, + body: (if (k =? 0) then 1 else (if (k =? 1) then 4 else (if (k =? 2) then 16 else (if (k =? 3) then 64 else 256)))) +} + +definition{ + name: pvKind, + parameters: [kw : Nat, k : Nat], + result: Nat, + body: (prim remainder (prim quotient (pvKinds kw) (pvPow4 k) 0 : Nat) 4 0 : Nat) +} + +definition{ + name: pvReq, + parameters: [kw : Nat], + result: Nat, + body: (if (kw 0 + | Nat.succ more => (let q : Nat := (pvArgEnd d ns scope (pvKind kw k) p); (if (q =? 0) then 0 else (let r : Nat := (pvWs d q); (let s : Nat := (pvWs d (r + 1)); (let whole : Bool := (((k + 1) =? (pvReq kw)) || ((k + 1) =? ((pvReq kw) + (pvOpt kw)))); (if ((pvAt d r) =? 41) then (if (whole && true) then (r + 1) else 0) else (if (not ((pvAt d r) =? 44)) then 0 else (if ((pvAt d s) =? 91) then (if ((whole && true) && (kw (pvU24 0) + | Nat.succ more => (let b : Nat := (pvAt d p); (let top : Nat := (pvAt st (prim subtract (prim length st : Nat) 1 : Nat)); (let after : Nat := (if (mode =? 0) then 3 else 2); (if (mode 0x + | Option.some part => part) 2 more)))))) else (pvExt d ns scope q st 1 more))) else (if (b =? 41) then (if (top =? 3) then (pvU24 0) else (if ((prim length st : Nat) =? 1) then (pvU24 (p + 1)) else (pvExt d ns scope (pvWs d (p + 1)) (match (prim slice st 0 (prim subtract (prim length st : Nat) 1 : Nat) : (Option Bytes)) + | Option.none => 0x + | Option.some part => part) 2 more))) else (if (b =? 125) then (if (not (top =? 3)) then (pvU24 0) else (pvExt d ns scope (pvWs d (p + 1)) (match (prim slice st 0 (prim subtract (prim length st : Nat) 1 : Nat) : (Option Bytes)) + | Option.none => 0x + | Option.some part => part) 2 more)) else (pvU24 0)))))))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvStmtEnd, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, i : Nat, n : Nat, j : Nat], + result: Nat, + body: (if (kw =? 0) then (if ((pvColon d i n 65536) =? n) then 0 else (if ((pvNsOf d ns scope i n) =? 0) then 0 else (pvG24 (pvExt d ns scope (pvWs d (j + 1)) (pvByte 1) 0 1000000)))) else (pvArgs d ns scope kw 0 (pvArg0 d ns scope kw j) 16)), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvTokFrom, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, k : Nat, m : Nat, p : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 0 + | Nat.succ more => (if (m =? k) then p else (let r : Nat := (pvWs d (pvArgEnd d ns scope (pvKind kw m) p)); (if (not ((pvAt d r) =? 44)) then 0 else (if ((pvAt d (pvWs d (r + 1))) =? 91) then 0 else (pvTokFrom d ns scope kw k (m + 1) (pvWs d (r + 1)) more)))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvTok, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, j : Nat, k : Nat], + result: Nat, + body: (pvTokFrom d ns scope kw k 0 (pvArg0 d ns scope kw j) 16), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvIdTok, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, j : Nat], + result: Nat, + body: (if ((pvArg0 d ns scope kw j) =? (pvWs d (j + 1))) then 0 else (pvWs d (j + 1))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvAttrsAt, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, m : Nat, p : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 0 + | Nat.succ more => (let r : Nat := (pvWs d (pvArgEnd d ns scope (pvKind kw m) p)); (if (not ((pvAt d r) =? 44)) then 0 else (if ((pvAt d (pvWs d (r + 1))) =? 91) then (pvWs d (r + 1)) else (pvAttrsAt d ns scope kw (m + 1) (pvWs d (r + 1)) more))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvFlags, + parameters: [d : Bytes, ns : Bytes, scope : Nat, kw : Nat, j : Nat], + result: Nat, + body: (let a : Nat := (pvAttrsAt d ns scope kw 0 (pvArg0 d ns scope kw j) 16); (if (a =? 0) then 0 else (if (kw =? 1) then (if (pvAttrHas d ns scope (pvWs d (a + 1)) (prim utf8_encode "http://www.w3.org/ns/prov#EmptyCollection" : Bytes) 65536) then 1 else 0) else (if (kw =? 10) then (if (pvAttrHas d ns scope (pvWs d (a + 1)) (prim utf8_encode "http://www.w3.org/ns/prov#Revision" : Bytes) 65536) then 1 else 0) else 0)))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvTermSame, + parameters: [d : Bytes, terms : Bytes, k : Nat, kind : Nat, a : Nat, b : Nat, c : Nat, e : Nat], + result: Bool, + body: (let o : Nat := (prim multiply k 9 : Nat); (if (not ((pvAt terms o) =? kind)) then false else (if (kind =? 2) then (pvTimeSame d (pvG16 terms (o + 1)) a) else (pvVEq d (pvC0 d a b c e) b c e (pvC0 d (pvG16 terms (o + 1)) (pvG16 terms (o + 3)) (pvG16 terms (o + 5)) (pvG16 terms (o + 7))) (pvG16 terms (o + 3)) (pvG16 terms (o + 5)) (pvG16 terms (o + 7)) 65536)))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvTermFind, + parameters: [ + d : Bytes, + terms : Bytes, + kind : Nat, + a : Nat, + b : Nat, + c : Nat, + e : Nat, + k : Nat, + fuel : Nat + ], + result: Nat, + body: (match fuel + | Nat.zero => 0 + | Nat.succ more => (if ((prim length terms : Nat) (pvWalkStep c st) + | Nat.succ more => (let a : PvPState := (pvWalk c st more); (if (((project a ph) =? 0) || ((project a ph) =? 64)) then a else (pvWalk c a more)))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvRead, + parameters: [c : PvCtx], + result: PvPState, + body: (let i : Nat := (pvWs (project c d) 66); (let n : Nat := (pvNameEnd (project c d) i); (if (pvIs (project c d) i n (prim utf8_encode "document" : Bytes)) then (pvWalk c (record PvPState {ph := 9, pos := (pvWs (project c d) n), scope := 0, nb := 0, bid := 0, nv := 0, ns := 0x000000000400070021000004000700210042, terms := 0x, rows := 0x, cur := 0x}) 24) else (record PvPState {ph := 0, pos := 0, scope := 0, nb := 0, bid := 0, nv := 0, ns := 0x, terms := 0x, rows := 0x, cur := 0x})))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvRel, + parameters: [rows : Bytes, i : Nat], + result: Nat, + body: (pvAt rows (prim multiply i 16 : Nat)), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvFl, + parameters: [rows : Bytes, i : Nat], + result: Nat, + body: (pvAt rows ((prim multiply i 16 : Nat) + 1)), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvRaw, + parameters: [rows : Bytes, i : Nat, sl : Nat], + result: Nat, + body: (pvG16 rows (((prim multiply i 16 : Nat) + 4) + (prim multiply 2 sl : Nat))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvRes, + parameters: [par : Bytes, t : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => t + | Nat.succ more => (if (t 0 + | Nat.succ more => (if (lim 0 + | Nat.succ more => (if (lim true + | Nat.succ more => (if (n true + | Nat.succ more => (if (n 0 + | Nat.succ more => (if (n 0 + | Nat.succ more => (if (n true + | Nat.succ more => (if (n 0 + | Nat.succ more => (if (n 0 + | Nat.succ more => (if (i 0x + | Option.some part => part) (prim append (pvU16 t) (match (prim slice par ((prim multiply (prim subtract v 32768 : Nat) 2 : Nat) + 2) (prim subtract (prim length par : Nat) ((prim multiply (prim subtract v 32768 : Nat) 2 : Nat) + 2) : Nat) : (Option Bytes)) + | Option.none => 0x + | Option.some part => part) : Bytes) : Bytes) +} + +definition{ + name: pvDeltaA, + parameters: [ + r : Nat, + v : Nat, + a0 : Nat, + a1 : Nat, + a2 : Nat, + a3 : Nat, + a4 : Nat, + a5 : Nat, + b1 : Nat, + b2 : Nat, + fl : Nat + ], + result: Bytes, + body: (if (r =? 1) then (prim append (pvRow 4 0 v (v + 1) a2 (v + 2) 0 0) (pvRow 5 0 (v + 3) a1 (v + 1) (v + 4) 0 0) : Bytes) else (if (r =? 2) then (pvRow 6 0 v b1 a2 0 0 0) else (if (r =? 3) then (pvRow 4 0 v a0 (v + 1) (v + 2) 0 0) else (if (r =? 4) then (pvRow 9 0 v a0 (v + 1) (v + 2) 0 0) else (if (r =? 5) then (pvRow 7 0 v a0 (v + 1) (v + 2) a1 0) else (if (r =? 6) then (pvRow 8 0 v a0 (v + 1) (v + 2) a2 0) else (pvRow 4 0 v a2 a3 (v + 1) 0 0))))))) +} + +definition{ + name: pvNewA, + parameters: [r : Nat], + result: Nat, + body: (if (r =? 1) then 5 else (if (r =? 2) then 1 else (if (r =? 3) then 3 else (if (r =? 4) then 3 else (if (r =? 5) then 3 else (if (r =? 6) then 3 else 2)))))) +} + +definition{ + name: pvDeltaB, + parameters: [ + r : Nat, + v : Nat, + a0 : Nat, + a1 : Nat, + a2 : Nat, + a3 : Nat, + a4 : Nat, + a5 : Nat, + b1 : Nat, + b2 : Nat, + fl : Nat + ], + result: Bytes, + body: (if (r =? 9) then (pvRow 5 0 a5 a3 a2 v 0 0) else (if (r =? 10) then (pvRow 4 0 a4 a1 a3 v 0 0) else (if (r =? 11) then (pvRow 15 0 0 a1 a2 0 0 0) else (if (r =? 12) then (prim append (pvRow 4 0 v a1 (v + 1) (v + 2) 0 0) (pvRow 12 0 (v + 3) (v + 1) a2 (v + 4) 0 0) : Bytes) else (if (r =? 13) then (pvRow 12 0 v a3 a1 (v + 1) 0 0) else (if (r =? 14) then (pvRow 12 0 v a3 a2 (v + 1) 0 0) else (pvRow 14 0 a0 a1 a2 0 0 0))))))) +} + +definition{ + name: pvNewB, + parameters: [r : Nat], + result: Nat, + body: (if (r =? 9) then 1 else (if (r =? 10) then 1 else (if (r =? 11) then 0 else (if (r =? 12) then 5 else (if (r =? 13) then 2 else (if (r =? 14) then 2 else 0)))))) +} + +definition{ + name: pvDeltaC, + parameters: [ + r : Nat, + v : Nat, + a0 : Nat, + a1 : Nat, + a2 : Nat, + a3 : Nat, + a4 : Nat, + a5 : Nat, + b1 : Nat, + b2 : Nat, + fl : Nat + ], + result: Bytes, + body: (if (r =? 16) then (pvRow 15 0 0 a0 a0 0 0 0) else (if (r =? 17) then (pvRow 15 0 0 a1 b2 0 0 0) else (if (r =? 18) then (pvRow 15 0 0 a2 a1 0 0 0) else (if (r =? 19) then (pvRow 16 0 0 a1 b2 0 0 0) else (if (r =? 20) then (pvRow 15 0 0 a1 a2 0 0 0) else (pvRow 1 fl b1 0 0 0 0 0)))))) +} + +definition{ + name: pvNewC, + parameters: [r : Nat], + result: Nat, + body: (if (r =? 16) then 0 else (if (r =? 17) then 0 else (if (r =? 18) then 0 else (if (r =? 19) then 0 else (if (r =? 20) then 0 else 0))))) +} + +definition{ + name: pvDelta, + parameters: [ + r : Nat, + v : Nat, + a0 : Nat, + a1 : Nat, + a2 : Nat, + a3 : Nat, + a4 : Nat, + a5 : Nat, + b1 : Nat, + b2 : Nat, + fl : Nat + ], + result: Bytes, + body: (if (r 0 + | Nat.succ more => (if (5 (prim multiply 30 65536 : Nat) + | Nat.succ more => (if (28 (pvPack rows par nv 1) + | Nat.succ more => (let n : Nat := (prim quotient (prim length rows : Nat) 16 0 : Nat); (let nx : Nat := (pvChaseNext rows par r i n 1000000000000); (let r2 : Nat := (prim quotient nx 65536 0 : Nat); (let i2 : Nat := (prim remainder nx 65536 0 : Nat); (if (not (bad =? 0)) then (pvPack rows par nv bad) else (if (((30000 0x + | Option.some part => part) : Bytes) (nv + (pvNew r2)) bad r2 i2 1 more))))))))))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvPow2, + parameters: [n : Nat, acc : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => acc + | Nat.succ more => (if (n =? 0) then acc else (pvPow2 (prim subtract n 1 : Nat) (prim multiply acc 2 : Nat) more))), + recursive_argument: fuel +} + +definition{ + name: pvHas, + parameters: [mask : Nat, n : Nat], + result: Bool, + body: ((prim remainder (prim quotient mask (pvPow2 n 1 64) 0 : Nat) 2 0 : Nat) =? 1) +} + +definition{ + name: pvSet, + parameters: [mask : Nat, n : Nat], + result: Nat, + body: (if (pvHas mask n) then mask else (mask + (pvPow2 n 1 64))) +} + +definition{ + name: pvOr, + parameters: [a : Nat, b : Nat, n : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => a + | Nat.succ more => (if (56 true + | Nat.succ more => (if (n true + | Nat.succ more => (if (n true + | Nat.succ more => (if (n 2 + | Nat.succ more => (if (n (prim multiply (prim multiply n n : Nat) 32 : Nat) + | Nat.succ more => (let i : Nat := (prim quotient cur (prim multiply n 32 : Nat) 0 : Nat); (let j : Nat := (prim remainder (prim quotient cur 32 0 : Nat) n 0 : Nat); (let cs : Nat := (prim remainder cur 32 0 : Nat); (let cn : Nat := (pvEdgeCn rows par i j cs n); (if (n edges + | Nat.succ more => (if (n =? 0) then edges else (let nx : Nat := (pvEdgeNext (project s rows) (project s par) cur n 1000000000000); (let i : Nat := (prim quotient nx (prim multiply n 32 : Nat) 0 : Nat); (let j : Nat := (prim remainder (prim quotient nx 32 0 : Nat) n 0 : Nat); (let cs : Nat := (prim remainder nx 32 0 : Nat); (if ((prim multiply (prim multiply n n : Nat) 32 : Nat) ne + | Nat.succ more => (if (ne 0x + | Option.some part => part) (prim append (pvU16 v) (match (prim slice marks (o + 2) (prim subtract (prim length marks : Nat) (o + 2) : Nat) : (Option Bytes)) + | Option.none => 0x + | Option.some part => part) : Bytes) : Bytes) +} + +definition{ + name: pvReach, + parameters: [e : PvEState, marks : Bytes, k : Nat, ne : Nat, k1 : Nat, dirty : Nat, fuel : Nat], + result: Bytes, + body: (match fuel + | Nat.zero => marks + | Nat.succ more => (let nx : Nat := (pvReachNext (project e edges) marks k ne k1 1000000000); (if (ne mask + | Nat.succ more => (if (x =? v) then mask else (if (((pvMark marks x k1) =? 0) || ((pvMark marks x k1) =? 65535)) then mask else (pvPath edges marks (pvG16 edges (prim multiply (prim subtract (pvMark marks x k1) 1 : Nat) 5 : Nat)) v k1 (pvSet mask (pvAt edges ((prim multiply (prim subtract (pvMark marks x k1) 1 : Nat) 5 : Nat) + 4))) more)))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: pvCycle, + parameters: [e : PvEState, z : PvMState, k : Nat, ne : Nat, k1 : Nat, mask : Nat], + result: Nat, + body: (let u : Nat := (pvG16 (project e edges) (prim multiply k 5 : Nat)); (let v : Nat := (pvG16 (project e edges) ((prim multiply k 5 : Nat) + 2)); (let m : PvMState := (record PvMState {marks := (pvReach e (pvMarkSet (project z marks) (prim multiply (pvNode v k1) 2 : Nat) 65535) 0 ne k1 0 1000000000)}); (if (u =? v) then (pvSet mask 42) else (if ((pvMark (project m marks) u k1) =? 0) then mask else (pvPath (project e edges) (project m marks) u v k1 (pvSet mask 42) 100000)))))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvCycles, + parameters: [e : PvEState, z : PvMState, k : Nat, ne : Nat, k1 : Nat, mask : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 2 + | Nat.succ more => (if (ne 0x + | Nat.succ more => (if (n =? 0) then 0x else (if (n =? 1) then b else (let h : Bytes := (pvRep b (prim quotient n 2 0 : Nat) more); (if ((prim remainder n 2 0 : Nat) =? 1) then (prim append (prim append h h : Bytes) b : Bytes) else (prim append h h : Bytes)))))), + recursive_argument: fuel +} + +definition{ + name: pvFirst, + parameters: [rows : Bytes, k : Nat, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ more => (if ((prim length rows : Nat) i + | Nat.succ more => (if ((prim length rows : Nat) 0x + | Option.some part => part) (pvRep 0xffff (project p nv) 64) (project p nv) 0 1 0 0 1000000000000); (let ln : Nat := ((prim multiply (pvAt pk 3) 65536 : Nat) + (pvG16 pk 4)); (let s : PvCState := (record PvCState {rows := (match (prim slice pk 6 ln : (Option Bytes)) + | Option.none => 0x + | Option.some part => part), par := (match (prim slice pk (6 + ln) (prim subtract (prim length pk : Nat) (6 + ln) : Nat) : (Option Bytes)) + | Option.none => 0x + | Option.some part => part), nv := (pvG16 pk 0), bad := (pvAt pk 2)}); (if ((project s bad) =? 1) then 2 else (pvOrder s ((prim quotient (prim length (project p terms) : Nat) 9 0 : Nat) + 1) (pvChecks (project s rows) (project s par) 0 (prim quotient (prim length (project s rows) : Nat) 16 0 : Nat) (if ((project s bad) =? 0) then 0 else (pvPow2 (project s bad) 1 64)) 1000000)))))))), + axioms: [Quot.sound, propext] +} + +definition{ + name: pvInsts, + parameters: [p : PvPState, k : Nat, mask : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => 2 + | Nat.succ more => (if ((project p nb) true + | Nat.succ more => (if (i true + | Nat.succ more => (if ((prim length rows : Nat) acc + | Nat.succ more => (if (56 0x + | Option.some part => part) : Bytes)})) else (prim utf8_encode "invalid" : Bytes)), + axioms: [Quot.sound, propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/guests/steps/prov.json b/generators/guests/steps/prov.json new file mode 100644 index 00000000..7a968d12 --- /dev/null +++ b/generators/guests/steps/prov.json @@ -0,0 +1,11 @@ +{ + "steps": [ + { + "generator": "guestpin", + "inputs": [ + "app/specs/guests/prov/*.json" + ], + "output": "site/prov/guest.mjs" + } + ] +} diff --git a/generators/prov/bin/prism-generators b/generators/prov/bin/prism-generators new file mode 100755 index 00000000..5ab96702 Binary files /dev/null and b/generators/prov/bin/prism-generators differ diff --git a/generators/prov/lake-manifest.json b/generators/prov/lake-manifest.json new file mode 100644 index 00000000..055271ae --- /dev/null +++ b/generators/prov/lake-manifest.json @@ -0,0 +1 @@ +{"version":"1.2.0","packagesDir":".lake/packages","packages":[],"name":"PrismGenerators","lakeDir":".lake","fixedToolchain":false} diff --git a/generators/prov/lakefile.toml b/generators/prov/lakefile.toml new file mode 100644 index 00000000..b4d85eb6 --- /dev/null +++ b/generators/prov/lakefile.toml @@ -0,0 +1,6 @@ +name = "PrismGenerators" +version = "0.1.0" +defaultTargets = ["PrismGenerators"] + +[[lean_lib]] +name = "PrismGenerators" diff --git a/generators/prov/language/prism.arch/entries/arch-component-kind.toml b/generators/prov/language/prism.arch/entries/arch-component-kind.toml new file mode 100644 index 00000000..dbd4780f --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-component-kind.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-component-kind" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "ComponentKind" + +[[form]] +id = "arch-component-kind" +channel = "text" +surface = "architectural component kind" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-component.toml b/generators/prov/language/prism.arch/entries/arch-component.toml new file mode 100644 index 00000000..58c9461a --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-component.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-component" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "Component" + +[[form]] +id = "arch-component" +channel = "text" +surface = "architectural component" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/arch-concern.toml b/generators/prov/language/prism.arch/entries/arch-concern.toml new file mode 100644 index 00000000..cb3930f9 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-concern.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-concern" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "Concern" + +[[form]] +id = "arch-concern" +channel = "text" +surface = "architectural concern" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/arch-edge-kind.toml b/generators/prov/language/prism.arch/entries/arch-edge-kind.toml new file mode 100644 index 00000000..ff413a4b --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-edge-kind.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-edge-kind" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "EdgeKind" + +[[form]] +id = "arch-edge-kind" +channel = "text" +surface = "architectural edge kind" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-edge.toml b/generators/prov/language/prism.arch/entries/arch-edge.toml new file mode 100644 index 00000000..45ab5cec --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-edge.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-edge" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "Edge" + +[[form]] +id = "arch-edge" +channel = "text" +surface = "architectural edge" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/arch-model-kind.toml b/generators/prov/language/prism.arch/entries/arch-model-kind.toml new file mode 100644 index 00000000..0414bacc --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-model-kind.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-model-kind" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "ModelKind" + +[[form]] +id = "arch-model-kind" +channel = "text" +surface = "architecture model kind" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-stakeholder.toml b/generators/prov/language/prism.arch/entries/arch-stakeholder.toml new file mode 100644 index 00000000..b61425f5 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-stakeholder.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-stakeholder" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "Stakeholder" + +[[form]] +id = "arch-stakeholder" +channel = "text" +surface = "stakeholder" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/arch-standard-reference.toml b/generators/prov/language/prism.arch/entries/arch-standard-reference.toml new file mode 100644 index 00000000..1eac4a3e --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-standard-reference.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-standard-reference" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "StandardReference" + +[[form]] +id = "arch-standard-reference" +channel = "text" +surface = "standards reference" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-text-application-model.toml b/generators/prov/language/prism.arch/entries/arch-text-application-model.toml new file mode 100644 index 00000000..23ca3d90 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-text-application-model.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-text-application-model" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.View.Text.V1.Model" +component = "TextApplication" + +[[form]] +id = "arch-text-application-model" +channel = "text" +surface = "Text application model" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-view-class.toml b/generators/prov/language/prism.arch/entries/arch-view-class.toml new file mode 100644 index 00000000..a49493d6 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-view-class.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-view-class" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "ViewClass" + +[[form]] +id = "arch-view-class" +channel = "text" +surface = "architecture view class" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-view.toml b/generators/prov/language/prism.arch/entries/arch-view.toml new file mode 100644 index 00000000..8d17cc44 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-view.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-view" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "View" + +[[form]] +id = "arch-view" +channel = "text" +surface = "architecture view" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/arch-viewpoint-class.toml b/generators/prov/language/prism.arch/entries/arch-viewpoint-class.toml new file mode 100644 index 00000000..fb12ac47 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-viewpoint-class.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "arch-viewpoint-class" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "ViewpointClass" + +[[form]] +id = "arch-viewpoint-class" +channel = "text" +surface = "architecture viewpoint class" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/arch-viewpoint.toml b/generators/prov/language/prism.arch/entries/arch-viewpoint.toml new file mode 100644 index 00000000..6f7be6f7 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/arch-viewpoint.toml @@ -0,0 +1,18 @@ +spec = "lexlean/entry/1" +id = "arch-viewpoint" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Arch" +component = "Viewpoint" + +[[form]] +id = "arch-viewpoint" +channel = "text" +surface = "architecture viewpoint" +canonical_source = true +features = ["sentence-case", "singular"] + diff --git a/generators/prov/language/prism.arch/entries/holo-flat-validation-input.toml b/generators/prov/language/prism.arch/entries/holo-flat-validation-input.toml new file mode 100644 index 00000000..9489644b --- /dev/null +++ b/generators/prov/language/prism.arch/entries/holo-flat-validation-input.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "holo-flat-validation-input" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Holo" +component = "FlatValidationInput" + +[[form]] +id = "holo-flat-validation-input" +channel = "text" +surface = "flat validation input" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/holo-normalized-model.toml b/generators/prov/language/prism.arch/entries/holo-normalized-model.toml new file mode 100644 index 00000000..919f2c8a --- /dev/null +++ b/generators/prov/language/prism.arch/entries/holo-normalized-model.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "holo-normalized-model" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Holo" +component = "NormalizedHolo" + +[[form]] +id = "holo-normalized-model" +channel = "text" +surface = "normalized hologram model" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/holo-standards-profile.toml b/generators/prov/language/prism.arch/entries/holo-standards-profile.toml new file mode 100644 index 00000000..dfe90427 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/holo-standards-profile.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "holo-standards-profile" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Holo" +component = "StandardsProfile" + +[[form]] +id = "holo-standards-profile" +channel = "text" +surface = "fixed standards profile" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-bounded-byte-buffer.toml b/generators/prov/language/prism.arch/entries/prism-bounded-byte-buffer.toml new file mode 100644 index 00000000..745b919c --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-bounded-byte-buffer.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-bounded-byte-buffer" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Bytes" +component = "BoundedBuffer" + +[[form]] +id = "prism-bounded-byte-buffer" +channel = "text" +surface = "Bounded byte buffer" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-json-path-reader.toml b/generators/prov/language/prism.arch/entries/prism-json-path-reader.toml new file mode 100644 index 00000000..b50128a2 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-json-path-reader.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-json-path-reader" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Json" +component = "member" + +[[form]] +id = "prism-json-path-reader" +channel = "text" +surface = "JSON path reader" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-key-word-requirements.toml b/generators/prov/language/prism.arch/entries/prism-key-word-requirements.toml new file mode 100644 index 00000000..664f0931 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-key-word-requirements.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-key-word-requirements" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "GenBcp14" +component = "bcp14" + +[[form]] +id = "prism-key-word-requirements" +channel = "text" +surface = "Key word requirement extractor" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-message-digest.toml b/generators/prov/language/prism.arch/entries/prism-message-digest.toml new file mode 100644 index 00000000..c9d5f4ce --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-message-digest.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-message-digest" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Sha256" +component = "sha256" + +[[form]] +id = "prism-message-digest" +channel = "text" +surface = "Message digest" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-tar-archive-reader.toml b/generators/prov/language/prism.arch/entries/prism-tar-archive-reader.toml new file mode 100644 index 00000000..8e2441ac --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-tar-archive-reader.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-tar-archive-reader" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Tar" +component = "find" + +[[form]] +id = "prism-tar-archive-reader" +channel = "text" +surface = "Tar archive reader" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/entries/prism-unicode-text-codec.toml b/generators/prov/language/prism.arch/entries/prism-unicode-text-codec.toml new file mode 100644 index 00000000..ad3af5c1 --- /dev/null +++ b/generators/prov/language/prism.arch/entries/prism-unicode-text-codec.toml @@ -0,0 +1,17 @@ +spec = "lexlean/entry/1" +id = "prism-unicode-text-codec" +category = "label-word" +surface_arity = 0 +frame = "atom" + +[denotation] +kind = "document" +module = "Foundation.Utf8" +component = "encode" + +[[form]] +id = "prism-unicode-text-codec" +channel = "text" +surface = "Unicode text codec" +canonical_source = true +features = ["sentence-case", "singular"] diff --git a/generators/prov/language/prism.arch/lexicon.toml b/generators/prov/language/prism.arch/lexicon.toml new file mode 100644 index 00000000..7639a320 --- /dev/null +++ b/generators/prov/language/prism.arch/lexicon.toml @@ -0,0 +1,5 @@ +spec = "lexlean/lexicon/1" +package = "prism.arch" +version = "1.0.0" +language = "1.2" +imports = ["lexlean.core@1.2.0", "lexlean.std.bool@1.2.0", "lexlean.std.nat@1.2.0"] diff --git a/generators/prov/lean-toolchain b/generators/prov/lean-toolchain new file mode 100644 index 00000000..2b61957b --- /dev/null +++ b/generators/prov/lean-toolchain @@ -0,0 +1 @@ +leanprover/lean4:v4.32.1 diff --git a/generators/prov/lexlean.lock b/generators/prov/lexlean.lock new file mode 100644 index 00000000..d428801d --- /dev/null +++ b/generators/prov/lexlean.lock @@ -0,0 +1,57 @@ +spec = "lexlean/lock/2" +language = "1.2" +compiler_semantics = "1427f8b629013648a480454d67202788f2303f5396f1d7c70a7c350ddab6f694" +project_config_sha256 = "4111a11fc52fb515f47a1351ba3ab70575b922d76e707d9a74b2d4a4ccde1d1b" +lean_toolchain = "leanprover/lean4:v4.32.1" + +[[workspace_file]] +path = "lake-manifest.json" +sha256 = "b31a36ab847ab7e8a55654d120158f836d8d1de74b70f67cba78a81d1b5500de" + +[[workspace_file]] +path = "lakefile.toml" +sha256 = "103805f72ddaf01191bde32ccbe684b75f2e76521f5d970dc03a0c497e5b4f8b" + +[[workspace_file]] +path = "lean-toolchain" +sha256 = "8e3538e0ab5f81a3ee04927d8838c8c674e0e112838b4b3ce87ec218143276af" + +[[package]] +id = "lexlean.core" +version = "1.2.0" +kind = "builtin" +source = "embedded" +revision = "compiler-semantics" +tree_sha256 = "827317cae68c162f3a96c8a8de4e53ab348e7d3724fd2b834fa85ecde1a1b392" +manifest_sha256 = "271079763d269cc873531f515e56da960cd6321393b9460ff0e617666fa01d71" +imports = [] + +[[package]] +id = "lexlean.std.bool" +version = "1.2.0" +kind = "builtin" +source = "embedded" +revision = "compiler-semantics" +tree_sha256 = "3bc0fb09d706ffa7d5a1363302ea87c049acc7c7dcafde63c62682620c11be9b" +manifest_sha256 = "de58de2cf18a7a5a62d8c20649139d6dfe1f7b16b3130c75f150fbac5440a71e" +imports = ["lexlean.core@1.2.0"] + +[[package]] +id = "lexlean.std.nat" +version = "1.2.0" +kind = "builtin" +source = "embedded" +revision = "compiler-semantics" +tree_sha256 = "e0db021e01b91d651c43921d66f6b0023c8efbf17cac2ec53192ce5305e4e1ac" +manifest_sha256 = "6fb446b39e3c1c18a5f10cfa1f7aa2bd431837719eb0eb7489aadf452c9420a7" +imports = ["lexlean.core@1.2.0", "lexlean.std.bool@1.2.0"] + +[[package]] +id = "prism.arch" +version = "1.0.0" +kind = "path" +source = "language/prism.arch" +revision = "none" +tree_sha256 = "0f1b12936de2820026e6accea45a20bf7919e46c573243db3851d413e460199d" +manifest_sha256 = "14c95df8b512edacacdb1788b58ae90cf573b4e3f1dca0e41074bfde5a380c9f" +imports = ["lexlean.core@1.2.0", "lexlean.std.bool@1.2.0", "lexlean.std.nat@1.2.0"] diff --git a/generators/prov/lexlean.toml b/generators/prov/lexlean.toml new file mode 100644 index 00000000..73602c54 --- /dev/null +++ b/generators/prov/lexlean.toml @@ -0,0 +1,32 @@ +spec = "lexlean/project/1" +name = "prism-generators" +language = "1.2" +module_prefix = "PrismGenerators" +source_roots = ["src"] +entrypoints = ["src/Foundation/Bytes.lex.tex", "src/Foundation/Json.lex.tex", "src/Foundation/Tar.lex.tex", "src/Foundation/Utf8.lex.tex", "src/GenProv.lex.tex", "src/Generators.lex.tex"] +build_root = ".lexlean" +lockfile = "lexlean.lock" +lean_workspace = "." +lean_toolchain = "leanprover/lean4:v4.32.1" + +[[lexicon_source]] +package = "lexlean.std.nat" +kind = "builtin" + +[[lexicon_source]] +package = "prism.arch" +kind = "path" +path = "language/prism.arch" + +[limits] +max_file_bytes = 4194304 +max_total_source_bytes = 67108864 +max_primitive_atoms = 2000000 +max_token_lattice_edges = 4000000 +max_parse_states = 4000000 +max_ir_nodes = 2000000 +max_scope_depth = 1024 +max_import_depth = 128 +max_diagnostics = 256 +max_child_output_bytes = 16777216 +child_timeout_ms = 1800000 diff --git a/generators/prov/lock.json b/generators/prov/lock.json new file mode 100644 index 00000000..3f411a0c --- /dev/null +++ b/generators/prov/lock.json @@ -0,0 +1,5 @@ +{ + "comment": "Written by tools/generators/build.sh. GN-01 fails when generators/prov or its program no longer match.", + "sources": "2aa433d711fb98f9fda3a5badbab01336167570ac83bcddd9f2c2364aa1b7df2", + "program": "35095df2a20989b72fe994cf18a569735af1972ee88104ed72cc2bf638b1cb15" +} diff --git a/generators/prov/prismpm.toml b/generators/prov/prismpm.toml new file mode 100644 index 00000000..82d8249f --- /dev/null +++ b/generators/prov/prismpm.toml @@ -0,0 +1,9 @@ +spec = "prismpm/project/1" +project = "Generators" +lexlean_project = "lexlean.toml" +build_root = ".prism" + +[limits] +max_holo_bytes = 16777216 +max_entities = 100000 +max_diagnostics = 256 diff --git a/generators/prov/src/Foundation/Bytes.lex.tex b/generators/prov/src/Foundation/Bytes.lex.tex new file mode 100644 index 00000000..f54f9c02 --- /dev/null +++ b/generators/prov/src/Foundation/Bytes.lex.tex @@ -0,0 +1,68 @@ +\begin{lexlean}{Foundation.Bytes} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\title{Bounded byte buffer} +\begin{semanticmodule} +inductive{ + name: ByteOrder, + type_parameters: [], + parameters: [], + constructors: [{name: LittleEndian, fields: []}, {name: BigEndian, fields: []}] +} + +inductive{ + name: BufferError, + type_parameters: [], + parameters: [], + constructors: [ + {name: OutOfBounds, fields: []}, + {name: LengthOverflow, fields: []}, + {name: NonCanonical, fields: []} + ] +} + +structure{ + name: BoundedBuffer, + type_parameters: [], + parameters: [], + fields: [{name: bytes, type: Bytes}, {name: maximum, type: UInt64}] +} + +definition{ + name: appendBytes, + parameters: [left : Bytes, right : Bytes], + result: Bytes, + body: (prim append left right : Bytes) +} + +definition{ + name: byteLength, + parameters: [value : Bytes], + result: Nat, + body: (prim length value : Nat) +} + +definition{ + name: byteAt, + parameters: [value : Bytes, offset : Nat], + result: (Option UInt8), + body: (prim index value offset : (Option UInt8)) +} + +definition{ + name: sliceBytes, + parameters: [value : Bytes, start : Nat, count : Nat], + result: (Option Bytes), + body: (prim slice value start count : (Option Bytes)) +} + +definition{ + name: compareBytes, + parameters: [left : Bytes, right : Bytes], + result: Ordering, + body: (prim compare_bytes left right : Ordering), + axioms: [propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/Foundation/Json.lex.tex b/generators/prov/src/Foundation/Json.lex.tex new file mode 100644 index 00000000..396a7d7e --- /dev/null +++ b/generators/prov/src/Foundation/Json.lex.tex @@ -0,0 +1,241 @@ +\begin{lexlean}{Foundation.Json} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\importmodule{Foundation.Bytes} +\importmodule{Foundation.Tar} +\title{JSON path reader} +\begin{semanticmodule} +definition{ + name: at, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (Foundation.Tar::byteOr s i), + axioms: [Quot.sound, propext] +} + +definition{ + name: isSpace, + parameters: [b : Nat], + result: Bool, + body: ((b =? 32) || ((b =? 10) || ((b =? 13) || (b =? 9)))) +} + +definition{ + name: skipSpace, + parameters: [s : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ rest => (if (isSpace (at s i)) then (skipSpace s (i + 1) rest) else i)), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: space, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (skipSpace s i (Foundation.Bytes::byteLength s)), + axioms: [Quot.sound, propext] +} + +definition{ + name: stringEndFrom, + parameters: [s : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ rest => (let b : Nat := (at s i); (if (b =? 34) then i else (if (b =? 92) then (stringEndFrom s (i + 2) rest) else (if ((Foundation.Bytes::byteLength s) i + | Nat.succ rest => (let b : Nat := (at s i); (if ((Foundation.Bytes::byteLength s) i + | Nat.succ rest => (let b : Nat := (at s i); (if (((Foundation.Bytes::byteLength s) 0x + | Option.some b => b) +} + +definition{ + name: memberFrom, + parameters: [s : Bytes, i : Nat, key : Bytes, fuel : Nat], + result: (Option Nat), + body: (match fuel + | Nat.zero => (ctor Option.none [Nat]) + | Nat.succ rest => (if ((at s i) =? 34) then (let ke : Nat := (stringEnd s (i + 1)); (let colon : Nat := (space s (ke + 1)); (if ((at s colon) =? 58) then (let v : Nat := (space s (colon + 1)); (if (Foundation.Tar::sameBytes (span s (i + 1) ke) key) then (ctor Option.some [Nat] v) else (let next : Nat := (space s (valueEnd s v)); (if ((at s next) =? 44) then (memberFrom s (space s (next + 1)) key rest) else (ctor Option.none [Nat]))))) else (ctor Option.none [Nat])))) else (ctor Option.none [Nat]))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: member, + parameters: [s : Bytes, i : Nat, key : Bytes], + result: (Option Nat), + body: (if ((at s i) =? 123) then (memberFrom s (space s (i + 1)) key (Foundation.Bytes::byteLength s)) else (ctor Option.none [Nat])), + axioms: [Quot.sound, propext] +} + +definition{ + name: elementFrom, + parameters: [s : Bytes, i : Nat, n : Nat, fuel : Nat], + result: (Option Nat), + body: (match fuel + | Nat.zero => (ctor Option.none [Nat]) + | Nat.succ rest => (if ((at s i) =? 93) then (ctor Option.none [Nat]) else (match n + | Nat.zero => (ctor Option.some [Nat] i) + | Nat.succ m => (let next : Nat := (space s (valueEnd s i)); (if ((at s next) =? 44) then (elementFrom s (space s (next + 1)) m rest) else (ctor Option.none [Nat])))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: element, + parameters: [s : Bytes, i : Nat, n : Nat], + result: (Option Nat), + body: (if ((at s i) =? 91) then (elementFrom s (space s (i + 1)) n (Foundation.Bytes::byteLength s)) else (ctor Option.none [Nat])), + axioms: [Quot.sound, propext] +} + +definition{ + name: countFrom, + parameters: [s : Bytes, i : Nat, acc : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => acc + | Nat.succ rest => (if ((at s i) =? 93) then acc else (let next : Nat := (space s (valueEnd s i)); (if ((at s next) =? 44) then (countFrom s (space s (next + 1)) (acc + 1) rest) else (acc + 1))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: count, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (if ((at s i) =? 91) then (countFrom s (space s (i + 1)) 0 (Foundation.Bytes::byteLength s)) else 0), + axioms: [Quot.sound, propext] +} + +definition{ + name: escaped, + parameters: [b : Nat], + result: (Option Bytes), + body: (if (b =? 110) then (ctor Option.some [Bytes] 0x0a) else (if (b =? 116) then (ctor Option.some [Bytes] 0x09) else (if (b =? 114) then (ctor Option.some [Bytes] 0x0d) else (if (b =? 34) then (ctor Option.some [Bytes] 0x22) else (if (b =? 92) then (ctor Option.some [Bytes] 0x5c) else (if (b =? 47) then (ctor Option.some [Bytes] 0x2f) else (if (b =? 98) then (ctor Option.some [Bytes] 0x08) else (if (b =? 102) then (ctor Option.some [Bytes] 0x0c) else (ctor Option.none [Bytes]))))))))) +} + +definition{ + name: runEnd, + parameters: [s : Bytes, i : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ rest => (let b : Nat := (at s i); (if (((b =? 34) || (b =? 92)) || ((Foundation.Bytes::byteLength s) (ctor Option.none [Bytes]) + | Nat.succ rest => (let e : Nat := (runEnd s i (Foundation.Bytes::byteLength s)); (let got : Bytes := (Foundation.Bytes::appendBytes acc (span s i e)); (if ((at s e) =? 34) then (ctor Option.some [Bytes] got) else (if ((at s e) =? 92) then (match (escaped (at s (e + 1))) + | Option.none => (ctor Option.none [Bytes]) + | Option.some c => (unescapeFrom s (e + 2) (Foundation.Bytes::appendBytes got c) rest)) else (ctor Option.none [Bytes])))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: text, + parameters: [s : Bytes, i : Nat], + result: (Option Bytes), + body: (if ((at s i) =? 34) then (unescapeFrom s (i + 1) 0x (Foundation.Bytes::byteLength s)) else (ctor Option.none [Bytes])), + axioms: [Quot.sound, propext] +} + +definition{ + name: textAt, + parameters: [s : Bytes, i : (Option Nat)], + result: Bytes, + body: (match i + | Option.none => 0x + | Option.some v => (match (text s v) | Option.none => 0x | Option.some b => b)), + axioms: [Quot.sound, propext] +} + +definition{ + name: memberAt, + parameters: [s : Bytes, i : (Option Nat), key : Bytes], + result: (Option Nat), + body: (match i | Option.none => (ctor Option.none [Nat]) | Option.some v => (member s v key)), + axioms: [Quot.sound, propext] +} + +definition{ + name: elementAt, + parameters: [s : Bytes, i : (Option Nat), n : Nat], + result: (Option Nat), + body: (match i | Option.none => (ctor Option.none [Nat]) | Option.some v => (element s v n)), + axioms: [Quot.sound, propext] +} + +definition{ + name: countAt, + parameters: [s : Bytes, i : (Option Nat)], + result: Nat, + body: (match i | Option.none => 0 | Option.some v => (count s v)), + axioms: [Quot.sound, propext] +} + +definition{ + name: root, + parameters: [s : Bytes], + result: (Option Nat), + body: (ctor Option.some [Nat] (space s 0)), + axioms: [Quot.sound, propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/Foundation/Tar.lex.tex b/generators/prov/src/Foundation/Tar.lex.tex new file mode 100644 index 00000000..f6597aa4 --- /dev/null +++ b/generators/prov/src/Foundation/Tar.lex.tex @@ -0,0 +1,100 @@ +\begin{lexlean}{Foundation.Tar} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\importmodule{Foundation.Bytes} +\title{Tar archive reader} +\begin{semanticmodule} +definition{ + name: byteOr, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (match (Foundation.Bytes::byteAt s i) + | Option.none => 0 + | Option.some b => (prim to_nat b : Nat)), + axioms: [Quot.sound, propext] +} + +definition{ + name: sameBytes, + parameters: [left : Bytes, right : Bytes], + result: Bool, + body: (prim equal (prim compare_bytes left right : Ordering) (prim compare_bytes 0x00 0x00 : Ordering) : Bool), + axioms: [propext] +} + +definition{ + name: nulFrom, + parameters: [s : Bytes, i : Nat, stop : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ rest => (if (stop 0x + | Option.some b => b)), + axioms: [Quot.sound, propext] +} + +definition{ + name: octalFrom, + parameters: [s : Bytes, i : Nat, acc : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => acc + | Nat.succ rest => (let b : Nat := (byteOr s i); (if ((b (ctor Option.none [Bytes]) + | Nat.succ rest => (if ((byteOr s header) =? 0) then (ctor Option.none [Bytes]) else (let size : Nat := (entrySize s header); (if (sameBytes (entryName s header) path) then (Foundation.Bytes::sliceBytes s (header + 512) size) else (findFrom s path ((header + 512) + (padded size)) rest))))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: find, + parameters: [archive : Bytes, path : Bytes], + result: (Option Bytes), + body: (findFrom archive path 0 (prim quotient (Foundation.Bytes::byteLength archive) 512 0 : Nat)), + axioms: [Quot.sound, propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/Foundation/Utf8.lex.tex b/generators/prov/src/Foundation/Utf8.lex.tex new file mode 100644 index 00000000..7c90158a --- /dev/null +++ b/generators/prov/src/Foundation/Utf8.lex.tex @@ -0,0 +1,22 @@ +\begin{lexlean}{Foundation.Utf8} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\title{Unicode text codec} +\begin{semanticmodule} +definition{ + name: encode, + parameters: [value : String], + result: Bytes, + body: (prim utf8_encode value : Bytes) +} + +definition{ + name: decode, + parameters: [value : Bytes], + result: (Option String), + body: (prim utf8_decode value : (Option String)), + axioms: [Classical.choice, Quot.sound, propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/Foundation/View/Text/V1/Model.lex.tex b/generators/prov/src/Foundation/View/Text/V1/Model.lex.tex new file mode 100644 index 00000000..dcd17fae --- /dev/null +++ b/generators/prov/src/Foundation/View/Text/V1/Model.lex.tex @@ -0,0 +1,63 @@ +\begin{lexlean}{Foundation.View.Text.V1.Model} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\title{Text application model} +\begin{semanticmodule} +structure{ + name: TextView, + type_parameters: [], + parameters: [], + fields: [ + {name: title, type: String}, + {name: heading, type: String}, + {name: inputLabel, type: String}, + {name: submitLabel, type: String}, + {name: outputLabel, type: String}, + {name: inputError, type: String}, + {name: responseError, type: String} + ] +} + +structure{ + name: AcceptanceVector, + type_parameters: [], + parameters: [], + fields: [{name: request, type: Bytes}, {name: response, type: Bytes}] +} + +structure{ + name: TextApplication, + type_parameters: [], + parameters: [], + fields: [ + {name: profile, type: String}, + {name: name, type: String}, + {name: cargoName, type: String}, + {name: cargoVersion, type: String}, + {name: cargoDescription, type: String}, + {name: cargoRepository, type: String}, + {name: cargoHomepage, type: String}, + {name: libraryRoots, type: (List String)}, + {name: acceptanceVectors, type: (List AcceptanceVector)}, + {name: entryRoot, type: String}, + {name: coreContract, type: String}, + {name: requestMaximum, type: UInt32}, + {name: responseMaximum, type: UInt32}, + {name: guestAllocationMaximum, type: UInt32}, + {name: capabilitiesEmpty, type: Bool}, + {name: fatArchive, type: Bool}, + {name: primaryLayer, type: UInt8}, + {name: viewLayer, type: UInt8}, + {name: view, type: TextView} + ] +} + +definition{ + name: textApplicationProfile, + parameters: [], + result: String, + body: "prismpm/text-application/1" +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/Foundation/View/Text/V3/Model.lex.tex b/generators/prov/src/Foundation/View/Text/V3/Model.lex.tex new file mode 100644 index 00000000..af0ed114 --- /dev/null +++ b/generators/prov/src/Foundation/View/Text/V3/Model.lex.tex @@ -0,0 +1,410 @@ +\begin{lexlean}{Foundation.View.Text.V3.Model} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\importmodule{Foundation.View.Text.V1.Model} +\title{Text application model} +\begin{semanticmodule} +structure{ + name: TextCliOutcome, + type_parameters: [], + parameters: [], + fields: [{name: name, type: String}, {name: prefix, type: String}, {name: exitCode, type: UInt8}] +} + +structure{ + name: TextCliSection, + type_parameters: [], + parameters: [], + fields: [{name: title, type: String}, {name: body, type: String}] +} + +structure{ + name: TextCliExample, + type_parameters: [], + parameters: [], + fields: [{name: name, type: String}, {name: text, type: String}] +} + +structure{ + name: TextCli, + type_parameters: [], + parameters: [], + fields: [ + {name: command, type: String}, + {name: description, type: String}, + {name: usageCode, type: UInt8}, + {name: ioCode, type: UInt8}, + {name: limitCode, type: (Option UInt8)}, + {name: outcomes, type: (List TextCliOutcome)}, + {name: sections, type: (List TextCliSection)}, + {name: examples, type: (List TextCliExample)} + ] +} + +inductive{ + name: TextCliFailure, + type_parameters: [], + parameters: [], + constructors: [ + {name: UnknownFlag, fields: []}, + {name: ExtraArgument, fields: []}, + {name: MissingCommand, fields: []}, + {name: UnknownCommand, fields: []}, + {name: UnknownExample, fields: []}, + {name: InputMissing, fields: []}, + {name: InputOpen, fields: []}, + {name: InputType, fields: []}, + {name: InputRead, fields: []}, + {name: OutputWrite, fields: []}, + {name: InputLimit, fields: []}, + {name: AdapterAllocation, fields: []}, + {name: ComputeFailure, fields: []}, + {name: OutputLimit, fields: []}, + {name: ReportUnclassified, fields: []} + ] +} + +inductive{ + name: TextCliFailureClass, + type_parameters: [], + parameters: [], + constructors: [ + {name: Usage, fields: []}, + {name: Io, fields: []}, + {name: Limit, fields: []}, + {name: Fault, fields: []} + ] +} + +definition{ + name: failureClass, + parameters: [failure : TextCliFailure], + result: TextCliFailureClass, + body: (match failure + | TextCliFailure.UnknownFlag => (ctor TextCliFailureClass.Usage) + | TextCliFailure.ExtraArgument => (ctor TextCliFailureClass.Usage) + | TextCliFailure.MissingCommand => (ctor TextCliFailureClass.Usage) + | TextCliFailure.UnknownCommand => (ctor TextCliFailureClass.Usage) + | TextCliFailure.UnknownExample => (ctor TextCliFailureClass.Usage) + | TextCliFailure.InputMissing => (ctor TextCliFailureClass.Io) + | TextCliFailure.InputOpen => (ctor TextCliFailureClass.Io) + | TextCliFailure.InputType => (ctor TextCliFailureClass.Io) + | TextCliFailure.InputRead => (ctor TextCliFailureClass.Io) + | TextCliFailure.OutputWrite => (ctor TextCliFailureClass.Io) + | TextCliFailure.InputLimit => (ctor TextCliFailureClass.Limit) + | TextCliFailure.AdapterAllocation => (ctor TextCliFailureClass.Fault) + | TextCliFailure.ComputeFailure => (ctor TextCliFailureClass.Fault) + | TextCliFailure.OutputLimit => (ctor TextCliFailureClass.Fault) + | TextCliFailure.ReportUnclassified => (ctor TextCliFailureClass.Fault)), + axioms: [] +} + +inductive{ + name: FieldKind, + type_parameters: [], + parameters: [], + constructors: [ + {name: Text, fields: []}, + {name: Multiline, fields: []}, + {name: Natural, fields: []}, + {name: Choice, fields: []} + ] +} + +inductive{ + name: Palette, + type_parameters: [], + parameters: [], + constructors: [{name: Indigo, fields: []}, {name: Ocean, fields: []}] +} + +inductive{ + name: Density, + type_parameters: [], + parameters: [], + constructors: [{name: Comfortable, fields: []}, {name: Compact, fields: []}] +} + +inductive{ + name: Width, + type_parameters: [], + parameters: [], + constructors: [{name: Balanced, fields: []}, {name: Wide, fields: []}] +} + +inductive{ + name: ColorScheme, + type_parameters: [], + parameters: [], + constructors: [{name: System, fields: []}, {name: Light, fields: []}, {name: Dark, fields: []}] +} + +inductive{ + name: WasmCachePolicy, + type_parameters: [], + parameters: [], + constructors: [{name: NoStore, fields: []}] +} + +structure{ + name: Choice, + type_parameters: [], + parameters: [], + fields: [{name: value, type: String}, {name: label, type: String}] +} + +structure{ + name: Field, + type_parameters: [], + parameters: [], + fields: [ + {name: id, type: String}, + {name: label, type: String}, + {name: kind, type: FieldKind}, + {name: help, type: String}, + {name: placeholder, type: String}, + {name: initialValue, type: String}, + {name: required, type: Bool}, + {name: choices, type: (List Choice)} + ] +} + +structure{ + name: Example, + type_parameters: [], + parameters: [], + fields: [ + {name: id, type: String}, + {name: label, type: String}, + {name: description, type: String}, + {name: values, type: (List String)}, + {name: expectedResponse, type: String}, + {name: explanation, type: String} + ] +} + +structure{ + name: Operation, + type_parameters: [], + parameters: [], + fields: [ + {name: id, type: String}, + {name: label, type: String}, + {name: summary, type: String}, + {name: help, type: String}, + {name: requestPrefix, type: String}, + {name: fields, type: (List Field)}, + {name: examples, type: (List Example)} + ] +} + +structure{ + name: Section, + type_parameters: [], + parameters: [], + fields: [ + {name: id, type: String}, + {name: title, type: String}, + {name: paragraphs, type: (List String)} + ] +} + +structure{ + name: Link, + type_parameters: [], + parameters: [], + fields: [{name: label, type: String}, {name: httpsUrl, type: String}] +} + +structure{ + name: ErrorHint, + type_parameters: [], + parameters: [], + fields: [ + {name: code, type: String}, + {name: title, type: String}, + {name: explanation, type: String}, + {name: recovery, type: String}, + {name: fields, type: (List String)} + ] +} + +structure{ + name: StatusCopy, + type_parameters: [], + parameters: [], + fields: [ + {name: scriptRequired, type: String}, + {name: initializing, type: String}, + {name: ready, type: String}, + {name: running, type: String}, + {name: cancelling, type: String}, + {name: cancelled, type: String}, + {name: timeout, type: String}, + {name: loadError, type: String}, + {name: computeError, type: String}, + {name: inputError, type: String}, + {name: responseError, type: String} + ] +} + +structure{ + name: Design, + type_parameters: [], + parameters: [], + fields: [ + {name: palette, type: Palette}, + {name: density, type: Density}, + {name: width, type: Width}, + {name: colorScheme, type: ColorScheme} + ] +} + +structure{ + name: RawEditor, + type_parameters: [], + parameters: [], + fields: [ + {name: requestPrefix, type: String}, + {name: label, type: String}, + {name: help, type: String}, + {name: placeholder, type: String}, + {name: initialValue, type: String}, + {name: submitLabel, type: String}, + {name: responseLabel, type: String}, + {name: expanded, type: Bool} + ] +} + +structure{ + name: DisplaySpec, + type_parameters: [], + parameters: [], + fields: [ + {name: title, type: String}, + {name: emptyText, type: String}, + {name: rawLabel, type: String}, + {name: maximumCells, type: UInt32}, + {name: maximumDetails, type: UInt32} + ] +} + +structure{ + name: Execution, + type_parameters: [], + parameters: [], + fields: [ + {name: timeoutMilliseconds, type: UInt32}, + {name: cancelLabel, type: String}, + {name: retryLabel, type: String}, + {name: wasmCachePolicy, type: WasmCachePolicy} + ] +} + +structure{ + name: WorkbenchLabels, + type_parameters: [], + parameters: [], + fields: [ + {name: navigation, type: String}, + {name: operation, type: String}, + {name: examples, type: String}, + {name: loadExample, type: String}, + {name: compute, type: String}, + {name: guide, type: String}, + {name: links, type: String}, + {name: fields, type: String}, + {name: expectedResponse, type: String}, + {name: details, type: String}, + {name: resultTable, type: String}, + {name: row, type: String}, + {name: column, type: String}, + {name: request, type: String}, + {name: reset, type: String}, + {name: skipToWorkbench, type: String} + ] +} + +structure{ + name: WorkbenchView, + type_parameters: [], + parameters: [], + fields: [ + {name: title, type: String}, + {name: heading, type: String}, + {name: purpose, type: String}, + {name: audience, type: String}, + {name: guidance, type: (List String)}, + {name: initialOperation, type: String}, + {name: initialExample, type: String}, + {name: operations, type: (List Operation)}, + {name: sections, type: (List Section)}, + {name: links, type: (List Link)}, + {name: errors, type: (List ErrorHint)}, + {name: statuses, type: StatusCopy}, + {name: design, type: Design}, + {name: raw, type: RawEditor}, + {name: response, type: DisplaySpec}, + {name: execution, type: Execution}, + {name: labels, type: WorkbenchLabels} + ] +} + +structure{ + name: TextApplication, + type_parameters: [], + parameters: [], + fields: [ + {name: profile, type: String}, + {name: name, type: String}, + {name: cargoName, type: String}, + {name: cargoVersion, type: String}, + {name: cargoDescription, type: String}, + {name: cargoRepository, type: String}, + {name: cargoHomepage, type: String}, + {name: libraryRoots, type: (List String)}, + {name: acceptanceVectors, type: (List Foundation.View.Text.V1.Model::AcceptanceVector)}, + {name: entryRoot, type: String}, + {name: coreContract, type: String}, + {name: requestMaximum, type: UInt32}, + {name: responseMaximum, type: UInt32}, + {name: guestAllocationMaximum, type: UInt32}, + {name: coreMemoryPages, type: (Option UInt32)}, + {name: coreStackBytes, type: (Option UInt32)}, + {name: capabilitiesEmpty, type: Bool}, + {name: fatArchive, type: Bool}, + {name: primaryLayer, type: UInt8}, + {name: viewLayer, type: UInt8}, + {name: view, type: Foundation.View.Text.V1.Model::TextView}, + {name: cli, type: TextCli}, + {name: workbench, type: (Option WorkbenchView)} + ] +} + +definition{name: defaultCoreMemoryPages, parameters: [], result: UInt32, body: (32 : UInt32)} + +definition{name: defaultCoreStackBytes, parameters: [], result: UInt32, body: (65536 : UInt32)} + +definition{ + name: coreMemoryPagesOrDefault, + parameters: [pages : (Option UInt32)], + result: UInt32, + body: (match pages | Option.none => (defaultCoreMemoryPages) | Option.some value => value) +} + +definition{ + name: coreStackBytesOrDefault, + parameters: [bytes : (Option UInt32)], + result: UInt32, + body: (match bytes | Option.none => (defaultCoreStackBytes) | Option.some value => value) +} + +definition{ + name: textApplicationProfile, + parameters: [], + result: String, + body: "prismpm/text-application/3" +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/src/GenProv.lex.tex b/generators/prov/src/GenProv.lex.tex new file mode 100644 index 00000000..cc1f1096 --- /dev/null +++ b/generators/prov/src/GenProv.lex.tex @@ -0,0 +1,136 @@ +\begin{lexlean}{GenProv} +\useglossary{lexlean.std.bool@1.2.0} +\useglossary{lexlean.std.nat@1.2.0} +\useglossary{prism.arch@1.0.0} +\title{Text application model} +\begin{semanticmodule} +definition{ + name: prAt, + parameters: [s : Bytes, i : Nat], + result: Nat, + body: (match (prim index s i : (Option UInt8)) + | Option.none => 0 + | Option.some octet => (prim to_nat octet : Nat)), + axioms: [Quot.sound, propext] +} + +definition{ + name: prStarts, + parameters: [s : Bytes, i : Nat, k : Bytes, j : Nat, fuel : Nat], + result: Bool, + body: (match fuel + | Nat.zero => false + | Nat.succ more => (if ((prim length k : Nat) (prim length s : Nat) + | Nat.succ more => (if ((prim length s : Nat) false + | Nat.succ more => (if (e 0x + | Option.some part => part) +} + +definition{ + name: prNumEnd, + parameters: [s : Bytes, m : Nat], + result: Nat, + body: (prFind s (m + 30) (prim utf8_encode "\"" : Bytes) 65536), + axioms: [Quot.sound, propext] +} + +definition{ + name: prRef, + parameters: [s : Bytes, m : Nat], + result: Nat, + body: ((prFind s (prNumEnd s m) (prim utf8_encode "href=\"" : Bytes) 65536) + 6), + axioms: [Quot.sound, propext] +} + +definition{ + name: prRefEnd, + parameters: [s : Bytes, m : Nat], + result: Nat, + body: (prFind s (prRef s m) (prim utf8_encode "\"" : Bytes) 65536), + axioms: [Quot.sound, propext] +} + +definition{ + name: prTextEnd, + parameters: [s : Bytes, m : Nat], + result: Nat, + body: (prFind s ((prRefEnd s m) + 2) (prim utf8_encode "" : Bytes) 65536), + axioms: [Quot.sound, propext] +} + +definition{ + name: prKind, + parameters: [b : Nat], + result: Bytes, + body: (if (b =? 68) then (prim utf8_encode "definition" : Bytes) else (if (b =? 73) then (prim utf8_encode "inference" : Bytes) else (prim utf8_encode "constraint" : Bytes))) +} + +definition{ + name: prOk, + parameters: [s : Bytes, m : Nat], + result: Bool, + body: (let t : Nat := ((prRefEnd s m) + 2); (if ((prim length s : Nat) false + | Nat.succ more => (if ((prim length s : Nat) acc + | Nat.succ more => (if ((prim length s : Nat) i + | Nat.succ rest => (if ((Foundation.Tar::byteOr s i) =? 10) then i else (lineEnd s (i + 1) rest))), + axioms: [Quot.sound, propext], + recursive_argument: fuel +} + +definition{ + name: sliceOr, + parameters: [s : Bytes, start : Nat, count : Nat], + result: Bytes, + body: (match (Foundation.Bytes::sliceBytes s start count) + | Option.none => 0x + | Option.some b => b) +} + +definition{ + name: wordEnd, + parameters: [s : Bytes, i : Nat, stop : Nat, fuel : Nat], + result: Nat, + body: (match fuel + | Nat.zero => i + | Nat.succ rest => (if (stop (refused (Foundation.Bytes::appendBytes 0x6e6f2066696c6520 path)) + | Option.some content => (written content)), + axioms: [Quot.sound, propext] +} + +definition{ + name: dispatch, + parameters: [value : Bytes], + result: Bytes, + body: (let n : Nat := (Foundation.Bytes::byteLength value); (let eol : Nat := (lineEnd value 0 n); (if (n (refused (Foundation.Bytes::appendBytes 0x6e6f2066696c6520 0x6170702f73706563732f7374616e64617264732f74657874732f30653635643032333339333437616636663665353734346362363961393963663536343330653866643964643930346163343736353431363334333631323837)) + | Option.some piece => (if (GenProv::prAllOk piece 0 4096) then (written (GenProv::prLines piece 0 0x 4096)) else (refused 0x612072756c65207469746c6520776173206e6f742072656164))) else 0x696e76616c6964)))))))))), + axioms: [Quot.sound, propext] +} +\end{semanticmodule} +\end{lexlean} diff --git a/generators/prov/steps.json b/generators/prov/steps.json new file mode 100644 index 00000000..32c9e50a --- /dev/null +++ b/generators/prov/steps.json @@ -0,0 +1,10 @@ +{ + "comment": "The steps of the prov program (generators/prov/), run in order by tools/generators/run.sh. Its one step reads the PROV-CONSTRAINTS Recommendation piece by piece and writes one requirement for each numbered definition, inference and constraint.", + "steps": [ + { + "generator": "provrules", + "split": "app/specs/standards/texts/0e65d02339347af6f6e5744cb69a99cf56430e8fd9dd904ac476541634361287", + "output": "test/standards/generated/w3c-prov-constraints.jsonl" + } + ] +} diff --git a/site/prov/guest.mjs b/site/prov/guest.mjs new file mode 100644 index 00000000..9dee7762 --- /dev/null +++ b/site/prov/guest.mjs @@ -0,0 +1,34 @@ +// Generated by generators/guests from app/specs/guests (GU-01): the standalone +// guests of PrismProv, PrismProv, built by tools/guests/build.sh from the modules the +// Prism compiles, so the Node suites run every request without the holo. Each +// exports holo_alloc(len) and holo_run(ptr, len) -> (outPtr << 32 | outLen); +// bytes whose SHA-256 is not the pinned one are refused before they compile. + +export const GUESTS = { + invalid: { path: 'guest/prov-invalid.wasm', sha256: '4c7b6c75300bd636c2d6b880b1645f1e48fe74cc5199c779308a3f56734c12f9' }, + prov: { path: 'guest/prov.wasm', sha256: '4c7b6c75300bd636c2d6b880b1645f1e48fe74cc5199c779308a3f56734c12f9' }, +}; + +const hex = (u8) => Array.from(u8, (b) => b.toString(16).padStart(2, '0')).join(''); +const encoder = new TextEncoder(); +const decoder = new TextDecoder('utf-8', { fatal: true }); + +async function compile(bytes, sha256) { + const got = hex(new Uint8Array(await crypto.subtle.digest('SHA-256', bytes))); + if (got !== sha256) throw Object.assign(new Error(`guest refused: fingerprint ${got} is not ${sha256}`), { code: 'prov.guest' }); + return WebAssembly.compile(bytes); +} + +function run(x, line) { + const input = encoder.encode(line); + const ptr = x.holo_alloc(input.length); + new Uint8Array(x.memory.buffer, ptr, input.length).set(input); + const packed = BigInt.asUintN(64, BigInt(x.holo_run(ptr, input.length))); + return decoder.decode(new Uint8Array(x.memory.buffer, Number(packed >> 32n), Number(packed & 0xffffffffn))); +} + +// A fresh instance per request: the guest's allocator never frees, and no state carries over. +export async function openGuest(bytes, sha256) { + const module = await compile(bytes, sha256); + return async (line) => run((await WebAssembly.instantiate(module, {})).exports, line); +} diff --git a/site/prov/guest/prov-invalid.wasm b/site/prov/guest/prov-invalid.wasm new file mode 100644 index 00000000..110e1df5 Binary files /dev/null and b/site/prov/guest/prov-invalid.wasm differ diff --git a/site/prov/guest/prov.wasm b/site/prov/guest/prov.wasm new file mode 100644 index 00000000..110e1df5 Binary files /dev/null and b/site/prov/guest/prov.wasm differ diff --git a/test/parts/parts.txt b/test/parts/parts.txt index 60106f30..a685919b 100644 --- a/test/parts/parts.txt +++ b/test/parts/parts.txt @@ -52,6 +52,7 @@ app/src/PrismMessage.lex.tex app/src/PrismModels.lex.tex app/src/PrismModelsProofs.lex.tex app/src/PrismProofs.lex.tex +app/src/PrismProv.lex.tex app/src/PrismR4.lex.tex app/src/PrismR4Proofs.lex.tex app/src/PrismRealizability.lex.tex @@ -121,6 +122,7 @@ site/models/model-worker.mjs site/models/models.mjs site/person/icf-rows.mjs site/person/icf.mjs +site/prov/guest.mjs site/r4/decide.mjs site/r4/fingerprint.mjs site/r4/grant.mjs diff --git a/test/standards/generated/w3c-prov-constraints.jsonl b/test/standards/generated/w3c-prov-constraints.jsonl new file mode 100644 index 00000000..9571c2db --- /dev/null +++ b/test/standards/generated/w3c-prov-constraints.jsonl @@ -0,0 +1,56 @@ +{"id": "w3c-prov-constraints-1", "kind": "definition", "ref": "#optional-identifiers", "text": "Definition 1 (optional-identifiers)"} +{"id": "w3c-prov-constraints-2", "kind": "definition", "ref": "#optional-attributes", "text": "Definition 2 (optional-attributes)"} +{"id": "w3c-prov-constraints-3", "kind": "definition", "ref": "#definition-short-forms", "text": "Definition 3 (definition-short-forms)"} +{"id": "w3c-prov-constraints-4", "kind": "definition", "ref": "#optional-placeholders", "text": "Definition 4 (optional-placeholders)"} +{"id": "w3c-prov-constraints-5", "kind": "inference", "ref": "#communication-generation-use-inference", "text": "Inference 5 (communication-generation-use-inference)"} +{"id": "w3c-prov-constraints-6", "kind": "inference", "ref": "#generation-use-communication-inference", "text": "Inference 6 (generation-use-communication-inference)"} +{"id": "w3c-prov-constraints-7", "kind": "inference", "ref": "#entity-generation-invalidation-inference", "text": "Inference 7 (entity-generation-invalidation-inference)"} +{"id": "w3c-prov-constraints-8", "kind": "inference", "ref": "#activity-start-end-inference", "text": "Inference 8 (activity-start-end-inference)"} +{"id": "w3c-prov-constraints-9", "kind": "inference", "ref": "#wasStartedBy-inference", "text": "Inference 9 (wasStartedBy-inference)"} +{"id": "w3c-prov-constraints-10", "kind": "inference", "ref": "#wasEndedBy-inference", "text": "Inference 10 (wasEndedBy-inference)"} +{"id": "w3c-prov-constraints-11", "kind": "inference", "ref": "#derivation-generation-use-inference", "text": "Inference 11 (derivation-generation-use-inference)"} +{"id": "w3c-prov-constraints-12", "kind": "inference", "ref": "#revision-is-alternate-inference", "text": "Inference 12 (revision-is-alternate-inference)"} +{"id": "w3c-prov-constraints-13", "kind": "inference", "ref": "#attribution-inference", "text": "Inference 13 (attribution-inference)"} +{"id": "w3c-prov-constraints-14", "kind": "inference", "ref": "#delegation-inference", "text": "Inference 14 (delegation-inference)"} +{"id": "w3c-prov-constraints-15", "kind": "inference", "ref": "#influence-inference", "text": "Inference 15 (influence-inference)"} +{"id": "w3c-prov-constraints-16", "kind": "inference", "ref": "#alternate-reflexive", "text": "Inference 16 (alternate-reflexive)"} +{"id": "w3c-prov-constraints-17", "kind": "inference", "ref": "#alternate-transitive", "text": "Inference 17 (alternate-transitive)"} +{"id": "w3c-prov-constraints-18", "kind": "inference", "ref": "#alternate-symmetric", "text": "Inference 18 (alternate-symmetric)"} +{"id": "w3c-prov-constraints-19", "kind": "inference", "ref": "#specialization-transitive", "text": "Inference 19 (specialization-transitive)"} +{"id": "w3c-prov-constraints-20", "kind": "inference", "ref": "#specialization-alternate-inference", "text": "Inference 20 (specialization-alternate-inference)"} +{"id": "w3c-prov-constraints-21", "kind": "inference", "ref": "#specialization-attributes-inference", "text": "Inference 21 (specialization-attributes-inference)"} +{"id": "w3c-prov-constraints-22", "kind": "constraint", "ref": "#key-object", "text": "Constraint 22 (key-object)"} +{"id": "w3c-prov-constraints-23", "kind": "constraint", "ref": "#key-properties", "text": "Constraint 23 (key-properties)"} +{"id": "w3c-prov-constraints-24", "kind": "constraint", "ref": "#unique-generation", "text": "Constraint 24 (unique-generation)"} +{"id": "w3c-prov-constraints-25", "kind": "constraint", "ref": "#unique-invalidation", "text": "Constraint 25 (unique-invalidation)"} +{"id": "w3c-prov-constraints-26", "kind": "constraint", "ref": "#unique-wasStartedBy", "text": "Constraint 26 (unique-wasStartedBy)"} +{"id": "w3c-prov-constraints-27", "kind": "constraint", "ref": "#unique-wasEndedBy", "text": "Constraint 27 (unique-wasEndedBy)"} +{"id": "w3c-prov-constraints-28", "kind": "constraint", "ref": "#unique-startTime", "text": "Constraint 28 (unique-startTime)"} +{"id": "w3c-prov-constraints-29", "kind": "constraint", "ref": "#unique-endTime", "text": "Constraint 29 (unique-endTime)"} +{"id": "w3c-prov-constraints-30", "kind": "constraint", "ref": "#start-precedes-end", "text": "Constraint 30 (start-precedes-end)"} +{"id": "w3c-prov-constraints-31", "kind": "constraint", "ref": "#start-start-ordering", "text": "Constraint 31 (start-start-ordering)"} +{"id": "w3c-prov-constraints-32", "kind": "constraint", "ref": "#end-end-ordering", "text": "Constraint 32 (end-end-ordering)"} +{"id": "w3c-prov-constraints-33", "kind": "constraint", "ref": "#usage-within-activity", "text": "Constraint 33 (usage-within-activity)"} +{"id": "w3c-prov-constraints-34", "kind": "constraint", "ref": "#generation-within-activity", "text": "Constraint 34 (generation-within-activity)"} +{"id": "w3c-prov-constraints-35", "kind": "constraint", "ref": "#wasInformedBy-ordering", "text": "Constraint 35 (wasInformedBy-ordering)"} +{"id": "w3c-prov-constraints-36", "kind": "constraint", "ref": "#generation-precedes-invalidation", "text": "Constraint 36 (generation-precedes-invalidation)"} +{"id": "w3c-prov-constraints-37", "kind": "constraint", "ref": "#generation-precedes-usage", "text": "Constraint 37 (generation-precedes-usage)"} +{"id": "w3c-prov-constraints-38", "kind": "constraint", "ref": "#usage-precedes-invalidation", "text": "Constraint 38 (usage-precedes-invalidation)"} +{"id": "w3c-prov-constraints-39", "kind": "constraint", "ref": "#generation-generation-ordering", "text": "Constraint 39 (generation-generation-ordering)"} +{"id": "w3c-prov-constraints-40", "kind": "constraint", "ref": "#invalidation-invalidation-ordering", "text": "Constraint 40 (invalidation-invalidation-ordering)"} +{"id": "w3c-prov-constraints-41", "kind": "constraint", "ref": "#derivation-usage-generation-ordering", "text": "Constraint 41 (derivation-usage-generation-ordering)"} +{"id": "w3c-prov-constraints-42", "kind": "constraint", "ref": "#derivation-generation-generation-ordering", "text": "Constraint 42 (derivation-generation-generation-ordering)"} +{"id": "w3c-prov-constraints-43", "kind": "constraint", "ref": "#wasStartedBy-ordering", "text": "Constraint 43 (wasStartedBy-ordering)"} +{"id": "w3c-prov-constraints-44", "kind": "constraint", "ref": "#wasEndedBy-ordering", "text": "Constraint 44 (wasEndedBy-ordering)"} +{"id": "w3c-prov-constraints-45", "kind": "constraint", "ref": "#specialization-generation-ordering", "text": "Constraint 45 (specialization-generation-ordering)"} +{"id": "w3c-prov-constraints-46", "kind": "constraint", "ref": "#specialization-invalidation-ordering", "text": "Constraint 46 (specialization-invalidation-ordering)"} +{"id": "w3c-prov-constraints-47", "kind": "constraint", "ref": "#wasAssociatedWith-ordering", "text": "Constraint 47 (wasAssociatedWith-ordering)"} +{"id": "w3c-prov-constraints-48", "kind": "constraint", "ref": "#wasAttributedTo-ordering", "text": "Constraint 48 (wasAttributedTo-ordering)"} +{"id": "w3c-prov-constraints-49", "kind": "constraint", "ref": "#actedOnBehalfOf-ordering", "text": "Constraint 49 (actedOnBehalfOf-ordering)"} +{"id": "w3c-prov-constraints-50", "kind": "constraint", "ref": "#typing", "text": "Constraint 50 (typing)"} +{"id": "w3c-prov-constraints-51", "kind": "constraint", "ref": "#impossible-unspecified-derivation-generation-use", "text": "Constraint 51 (impossible-unspecified-derivation-generation-use)"} +{"id": "w3c-prov-constraints-52", "kind": "constraint", "ref": "#impossible-specialization-reflexive", "text": "Constraint 52 (impossible-specialization-reflexive)"} +{"id": "w3c-prov-constraints-53", "kind": "constraint", "ref": "#impossible-property-overlap", "text": "Constraint 53 (impossible-property-overlap)"} +{"id": "w3c-prov-constraints-54", "kind": "constraint", "ref": "#impossible-object-property-overlap", "text": "Constraint 54 (impossible-object-property-overlap)"} +{"id": "w3c-prov-constraints-55", "kind": "constraint", "ref": "#entity-activity-disjoint", "text": "Constraint 55 (entity-activity-disjoint)"} +{"id": "w3c-prov-constraints-56", "kind": "constraint", "ref": "#membership-empty-collection", "text": "Constraint 56 (membership-empty-collection)"} diff --git a/test/standards/requirements.json b/test/standards/requirements.json index d84e547a..4aef166e 100644 --- a/test/standards/requirements.json +++ b/test/standards/requirements.json @@ -11718,6 +11718,344 @@ "text": "If interpretations resulting from earlier processing steps are included they SHOULD appear as children of a single emma:derivation element within emma:emma." } ], + "w3c-prov-constraints": [ + { + "id": "w3c-prov-constraints-1", + "kind": "definition", + "ref": "#optional-identifiers", + "text": "Definition 1 (optional-identifiers)" + }, + { + "id": "w3c-prov-constraints-10", + "kind": "inference", + "ref": "#wasEndedBy-inference", + "text": "Inference 10 (wasEndedBy-inference)" + }, + { + "id": "w3c-prov-constraints-11", + "kind": "inference", + "ref": "#derivation-generation-use-inference", + "text": "Inference 11 (derivation-generation-use-inference)" + }, + { + "id": "w3c-prov-constraints-12", + "kind": "inference", + "ref": "#revision-is-alternate-inference", + "text": "Inference 12 (revision-is-alternate-inference)" + }, + { + "id": "w3c-prov-constraints-13", + "kind": "inference", + "ref": "#attribution-inference", + "text": "Inference 13 (attribution-inference)" + }, + { + "id": "w3c-prov-constraints-14", + "kind": "inference", + "ref": "#delegation-inference", + "text": "Inference 14 (delegation-inference)" + }, + { + "id": "w3c-prov-constraints-15", + "kind": "inference", + "ref": "#influence-inference", + "text": "Inference 15 (influence-inference)" + }, + { + "id": "w3c-prov-constraints-16", + "kind": "inference", + "ref": "#alternate-reflexive", + "text": "Inference 16 (alternate-reflexive)" + }, + { + "id": "w3c-prov-constraints-17", + "kind": "inference", + "ref": "#alternate-transitive", + "text": "Inference 17 (alternate-transitive)" + }, + { + "id": "w3c-prov-constraints-18", + "kind": "inference", + "ref": "#alternate-symmetric", + "text": "Inference 18 (alternate-symmetric)" + }, + { + "id": "w3c-prov-constraints-19", + "kind": "inference", + "ref": "#specialization-transitive", + "text": "Inference 19 (specialization-transitive)" + }, + { + "id": "w3c-prov-constraints-2", + "kind": "definition", + "ref": "#optional-attributes", + "text": "Definition 2 (optional-attributes)" + }, + { + "id": "w3c-prov-constraints-20", + "kind": "inference", + "ref": "#specialization-alternate-inference", + "text": "Inference 20 (specialization-alternate-inference)" + }, + { + "id": "w3c-prov-constraints-21", + "kind": "inference", + "ref": "#specialization-attributes-inference", + "text": "Inference 21 (specialization-attributes-inference)" + }, + { + "id": "w3c-prov-constraints-22", + "kind": "constraint", + "ref": "#key-object", + "text": "Constraint 22 (key-object)" + }, + { + "id": "w3c-prov-constraints-23", + "kind": "constraint", + "ref": "#key-properties", + "text": "Constraint 23 (key-properties)" + }, + { + "id": "w3c-prov-constraints-24", + "kind": "constraint", + "ref": "#unique-generation", + "text": "Constraint 24 (unique-generation)" + }, + { + "id": "w3c-prov-constraints-25", + "kind": "constraint", + "ref": "#unique-invalidation", + "text": "Constraint 25 (unique-invalidation)" + }, + { + "id": "w3c-prov-constraints-26", + "kind": "constraint", + "ref": "#unique-wasStartedBy", + "text": "Constraint 26 (unique-wasStartedBy)" + }, + { + "id": "w3c-prov-constraints-27", + "kind": "constraint", + "ref": "#unique-wasEndedBy", + "text": "Constraint 27 (unique-wasEndedBy)" + }, + { + "id": "w3c-prov-constraints-28", + "kind": "constraint", + "ref": "#unique-startTime", + "text": "Constraint 28 (unique-startTime)" + }, + { + "id": "w3c-prov-constraints-29", + "kind": "constraint", + "ref": "#unique-endTime", + "text": "Constraint 29 (unique-endTime)" + }, + { + "id": "w3c-prov-constraints-3", + "kind": "definition", + "ref": "#definition-short-forms", + "text": "Definition 3 (definition-short-forms)" + }, + { + "id": "w3c-prov-constraints-30", + "kind": "constraint", + "ref": "#start-precedes-end", + "text": "Constraint 30 (start-precedes-end)" + }, + { + "id": "w3c-prov-constraints-31", + "kind": "constraint", + "ref": "#start-start-ordering", + "text": "Constraint 31 (start-start-ordering)" + }, + { + "id": "w3c-prov-constraints-32", + "kind": "constraint", + "ref": "#end-end-ordering", + "text": "Constraint 32 (end-end-ordering)" + }, + { + "id": "w3c-prov-constraints-33", + "kind": "constraint", + "ref": "#usage-within-activity", + "text": "Constraint 33 (usage-within-activity)" + }, + { + "id": "w3c-prov-constraints-34", + "kind": "constraint", + "ref": "#generation-within-activity", + "text": "Constraint 34 (generation-within-activity)" + }, + { + "id": "w3c-prov-constraints-35", + "kind": "constraint", + "ref": "#wasInformedBy-ordering", + "text": "Constraint 35 (wasInformedBy-ordering)" + }, + { + "id": "w3c-prov-constraints-36", + "kind": "constraint", + "ref": "#generation-precedes-invalidation", + "text": "Constraint 36 (generation-precedes-invalidation)" + }, + { + "id": "w3c-prov-constraints-37", + "kind": "constraint", + "ref": "#generation-precedes-usage", + "text": "Constraint 37 (generation-precedes-usage)" + }, + { + "id": "w3c-prov-constraints-38", + "kind": "constraint", + "ref": "#usage-precedes-invalidation", + "text": "Constraint 38 (usage-precedes-invalidation)" + }, + { + "id": "w3c-prov-constraints-39", + "kind": "constraint", + "ref": "#generation-generation-ordering", + "text": "Constraint 39 (generation-generation-ordering)" + }, + { + "id": "w3c-prov-constraints-4", + "kind": "definition", + "ref": "#optional-placeholders", + "text": "Definition 4 (optional-placeholders)" + }, + { + "id": "w3c-prov-constraints-40", + "kind": "constraint", + "ref": "#invalidation-invalidation-ordering", + "text": "Constraint 40 (invalidation-invalidation-ordering)" + }, + { + "id": "w3c-prov-constraints-41", + "kind": "constraint", + "ref": "#derivation-usage-generation-ordering", + "text": "Constraint 41 (derivation-usage-generation-ordering)" + }, + { + "id": "w3c-prov-constraints-42", + "kind": "constraint", + "ref": "#derivation-generation-generation-ordering", + "text": "Constraint 42 (derivation-generation-generation-ordering)" + }, + { + "id": "w3c-prov-constraints-43", + "kind": "constraint", + "ref": "#wasStartedBy-ordering", + "text": "Constraint 43 (wasStartedBy-ordering)" + }, + { + "id": "w3c-prov-constraints-44", + "kind": "constraint", + "ref": "#wasEndedBy-ordering", + "text": "Constraint 44 (wasEndedBy-ordering)" + }, + { + "id": "w3c-prov-constraints-45", + "kind": "constraint", + "ref": "#specialization-generation-ordering", + "text": "Constraint 45 (specialization-generation-ordering)" + }, + { + "id": "w3c-prov-constraints-46", + "kind": "constraint", + "ref": "#specialization-invalidation-ordering", + "text": "Constraint 46 (specialization-invalidation-ordering)" + }, + { + "id": "w3c-prov-constraints-47", + "kind": "constraint", + "ref": "#wasAssociatedWith-ordering", + "text": "Constraint 47 (wasAssociatedWith-ordering)" + }, + { + "id": "w3c-prov-constraints-48", + "kind": "constraint", + "ref": "#wasAttributedTo-ordering", + "text": "Constraint 48 (wasAttributedTo-ordering)" + }, + { + "id": "w3c-prov-constraints-49", + "kind": "constraint", + "ref": "#actedOnBehalfOf-ordering", + "text": "Constraint 49 (actedOnBehalfOf-ordering)" + }, + { + "id": "w3c-prov-constraints-5", + "kind": "inference", + "ref": "#communication-generation-use-inference", + "text": "Inference 5 (communication-generation-use-inference)" + }, + { + "id": "w3c-prov-constraints-50", + "kind": "constraint", + "ref": "#typing", + "text": "Constraint 50 (typing)" + }, + { + "id": "w3c-prov-constraints-51", + "kind": "constraint", + "ref": "#impossible-unspecified-derivation-generation-use", + "text": "Constraint 51 (impossible-unspecified-derivation-generation-use)" + }, + { + "id": "w3c-prov-constraints-52", + "kind": "constraint", + "ref": "#impossible-specialization-reflexive", + "text": "Constraint 52 (impossible-specialization-reflexive)" + }, + { + "id": "w3c-prov-constraints-53", + "kind": "constraint", + "ref": "#impossible-property-overlap", + "text": "Constraint 53 (impossible-property-overlap)" + }, + { + "id": "w3c-prov-constraints-54", + "kind": "constraint", + "ref": "#impossible-object-property-overlap", + "text": "Constraint 54 (impossible-object-property-overlap)" + }, + { + "id": "w3c-prov-constraints-55", + "kind": "constraint", + "ref": "#entity-activity-disjoint", + "text": "Constraint 55 (entity-activity-disjoint)" + }, + { + "id": "w3c-prov-constraints-56", + "kind": "constraint", + "ref": "#membership-empty-collection", + "text": "Constraint 56 (membership-empty-collection)" + }, + { + "id": "w3c-prov-constraints-6", + "kind": "inference", + "ref": "#generation-use-communication-inference", + "text": "Inference 6 (generation-use-communication-inference)" + }, + { + "id": "w3c-prov-constraints-7", + "kind": "inference", + "ref": "#entity-generation-invalidation-inference", + "text": "Inference 7 (entity-generation-invalidation-inference)" + }, + { + "id": "w3c-prov-constraints-8", + "kind": "inference", + "ref": "#activity-start-end-inference", + "text": "Inference 8 (activity-start-end-inference)" + }, + { + "id": "w3c-prov-constraints-9", + "kind": "inference", + "ref": "#wasStartedBy-inference", + "text": "Inference 9 (wasStartedBy-inference)" + } + ], "w3c-scxml-1.0": [ { "id": "w3c-scxml-1.0-144",