{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "petri-communication-net-foundations-1962",
    "title": "Petri: communication nets, concurrency and conflict",
    "summary": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.\n\nA single list of successive global states can hide which parts of a computation depend on one another and which can proceed independently. Petri makes communication and local change the starting point: neighboring components act when their required local objects are present, while communication forms describe their relationship to the environment. A conflict marks competing enabled actions, rather than an unspecified bad outcome. The work includes memory and Turing-machine constructions and a proposal for further formalization. Its importance lies in an early net-based language for concurrent computation; later Petri-net theory, verification algorithms and tools remain separate contributions.",
    "boundary": "The 1962 historical work is read through the 1966 author-authorized English translation with errata, not an independently compared German original. diagrams/glyphs were not visually reconstructed. Post-1962 references in the translation do not prove original-version textual identity or move later results into 1962. Section 4 uses two-valued objects at locations, bounded local nodes and environment communication forms; Section 5 restricts conservative/reactive transitions. These are not automatically all later token-net semantics. Gluing conflict-free nets can introduce conflict. Physical signal-speed/information-density premises are postulates, not newly established universal physics; the critique concerns specified synchronous/global-state models, not a prohibition of finite computers. The Turing representation involves extendible construction and communication conditions, not an already completed infinite physical memory or finite deadline for arbitrary programs. Technical realization, universal physical interpretability and a complete CS 4 communication calculus are explicitly unresolved/outside the work; some derivations are sketches and diagrams abbreviate proofs. No full formal/graph/implementation replay or independent certification was performed.",
    "area": "Communication nets and concurrent computation",
    "topic": "Computing",
    "year": 1962,
    "lane": "HUMAN",
    "result": "THEORY",
    "package_id": "petri-communication-net-foundations-1962",
    "target": {
      "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
      "version": 1,
      "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
    },
    "humans": [
      "Carl Adam Petri"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "lamport-logical-clocks",
      "turing",
      "chandy-lamport-distributed-snapshots-1985"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "wrs24-petri-1966-authorized-translation",
        "title": "Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata",
        "url": "https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf"
      },
      {
        "id": "wrs24-petri-1962-hamburg-original-metadata",
        "title": "Hamburg INFDok: original1962 Kommunikation mit Automaten dissertation metadata",
        "url": "https://edoc.sub.uni-hamburg.de/informatik/frontdoor.php?source_opus=160"
      },
      {
        "id": "wrs24-petri-1962-hamburg-bibliography",
        "title": "Hamburg Petri Nets Bibliography:1962 original and1966 translation",
        "url": "https://www.informatik.uni-hamburg.de/TGI/pnbib/p/petri_c_a33.html"
      }
    ],
    "points": "260000",
    "published_grade": {
      "id": "petri-communication-net-foundations-1962",
      "entry_id": "petri-communication-net-foundations-1962",
      "band": "S",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
        "version": 1,
        "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
      },
      "what_changed": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.",
      "scope": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states. The 1962 historical work is read through the 1966 author-authorized English translation with errata, not an independently compared German original. diagrams/glyphs were not visually reconstructed. Post-1962 references in the translation do not prove original-version textual identity or move later results into 1962. Section 4 uses two-valued objects at locations, bounded local nodes and environment communication forms; Section 5 restricts conservative/reactive transitions. These are not automatically all later token-net semantics. Gluing conflict-free nets can introduce conflict. Physical signal-speed/information-density premises are postulates, not newly established universal physics; the critique concerns specified synchronous/global-state models, not a prohibition of finite computers. The Turing representation involves extendible construction and communication conditions, not an already completed infinite physical memory or finite deadline for arbitrary programs. Technical realization, universal physical interpretability and a complete CS 4 communication calculus are explicitly unresolved/outside the work; some derivations are sketches and diagrams abbreviate proofs. No full formal/graph/implementation replay or independent certification was performed.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
        "version": 1,
        "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Carl Adam Petri",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata",
            "url": "https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata",
            "url": "https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-1",
          "kind": "source_reference",
          "source": {
            "citation": "Hamburg INFDok: original1962 Kommunikation mit Automaten dissertation metadata",
            "url": "https://edoc.sub.uni-hamburg.de/informatik/frontdoor.php?source_opus=160"
          }
        },
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-2",
          "kind": "source_reference",
          "source": {
            "citation": "Hamburg Petri Nets Bibliography:1962 original and1966 translation",
            "url": "https://www.informatik.uni-hamburg.de/TGI/pnbib/p/petri_c_a33.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "The 1962 historical work is read through the 1966 author-authorized English translation with errata, not an independently compared German original. diagrams/glyphs were not visually reconstructed. Post-1962 references in the translation do not prove original-version textual identity or move later results into 1962. Section 4 uses two-valued objects at locations, bounded local nodes and environment communication forms; Section 5 restricts conservative/reactive transitions. These are not automatically all later token-net semantics. Gluing conflict-free nets can introduce conflict. Physical signal-speed/information-density premises are postulates, not newly established universal physics; the critique concerns specified synchronous/global-state models, not a prohibition of finite computers. The Turing representation involves extendible construction and communication conditions, not an already completed infinite physical memory or finite deadline for arbitrary programs. Technical realization, universal physical interpretability and a complete CS 4 communication calculus are explicitly unresolved/outside the work; some derivations are sketches and diagrams abbreviate proofs. No full formal/graph/implementation replay or independent certification was performed.",
        "domain": "Communication nets and concurrent computation"
      },
      "sources": [
        {
          "citation": "Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata",
          "url": "https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf"
        },
        {
          "citation": "Hamburg INFDok: original1962 Kommunikation mit Automaten dissertation metadata",
          "url": "https://edoc.sub.uni-hamburg.de/informatik/frontdoor.php?source_opus=160"
        },
        {
          "citation": "Hamburg Petri Nets Bibliography:1962 original and1966 translation",
          "url": "https://www.informatik.uni-hamburg.de/TGI/pnbib/p/petri_c_a33.html"
        }
      ],
      "statement": "# Petri: communication nets, concurrency and conflict\n\nPetri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.\n\nA single list of successive global states can hide which parts of a computation depend on one another and which can proceed independently. Petri makes communication and local change the starting point: neighboring components act when their required local objects are present, while communication forms describe their relationship to the environment. A conflict marks competing enabled actions, rather than an unspecified bad outcome. The work includes memory and Turing-machine constructions and a proposal for further formalization. Its importance lies in an early net-based language for concurrent computation; later Petri-net theory, verification algorithms and tools remain separate contributions.\n\n## Scientific scope\n\nThe 1962 historical work is read through the 1966 author-authorized English translation with errata, not an independently compared German original. diagrams/glyphs were not visually reconstructed. Post-1962 references in the translation do not prove original-version textual identity or move later results into 1962. Section 4 uses two-valued objects at locations, bounded local nodes and environment communication forms; Section 5 restricts conservative/reactive transitions. These are not automatically all later token-net semantics. Gluing conflict-free nets can introduce conflict. Physical signal-speed/information-density premises are postulates, not newly established universal physics; the critique concerns specified synchronous/global-state models, not a prohibition of finite computers. The Turing representation involves extendible construction and communication conditions, not an already completed infinite physical memory or finite deadline for arbitrary programs. Technical realization, universal physical interpretability and a complete CS 4 communication calculus are explicitly unresolved/outside the work; some derivations are sketches and diagrams abbreviate proofs. No full formal/graph/implementation replay or independent certification was performed.\n\n## People and systems\n\nCarl Adam Petri\n\n\n\n## Original sources\n\n- [Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata](https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf)\n- [Hamburg INFDok: original1962 Kommunikation mit Automaten dissertation metadata](https://edoc.sub.uni-hamburg.de/informatik/frontdoor.php?source_opus=160)\n- [Hamburg Petri Nets Bibliography:1962 original and1966 translation](https://www.informatik.uni-hamburg.de/TGI/pnbib/p/petri_c_a33.html)\n",
      "summary": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.\n\nA single list of successive global states can hide which parts of a computation depend on one another and which can proceed independently. Petri makes communication and local change the starting point: neighboring components act when their required local objects are present, while communication forms describe their relationship to the environment. A conflict marks competing enabled actions, rather than an unspecified bad outcome. The work includes memory and Turing-machine constructions and a proposal for further formalization. Its importance lies in an early net-based language for concurrent computation; later Petri-net theory, verification algorithms and tools remain separate contributions.",
      "title": "Petri: communication nets, concurrency and conflict"
    },
    "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
      "version": 1,
      "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:175d5776bf6dc88b336fb29b43cd85a246b33ae55de85d759e30dbdc4f16f144"
  },
  "target": {
    "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
    "version": 1,
    "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "petri-communication-net-foundations-1962",
    "entry_id": "petri-communication-net-foundations-1962",
    "revision": 1,
    "title": "Petri: communication nets, concurrency and conflict",
    "context": "Communication nets and concurrent computation",
    "track": "Communication nets and concurrent computation",
    "band": "S",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-04",
    "evidence_cutoff": "2026-10-04",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states.",
    "scope": "Petri develops communication nets built from discrete locations and local actions, with explicit causality, parallelism and conflict, and presents constructions for asynchronous, extensible computation instead of assuming one global sequence of machine states. The 1962 historical work is read through the 1966 author-authorized English translation with errata, not an independently compared German original. diagrams/glyphs were not visually reconstructed. Post-1962 references in the translation do not prove original-version textual identity or move later results into 1962. Section 4 uses two-valued objects at locations, bounded local nodes and environment communication forms; Section 5 restricts conservative/reactive transitions. These are not automatically all later token-net semantics. Gluing conflict-free nets can introduce conflict. Physical signal-speed/information-density premises are postulates, not newly established universal physics; the critique concerns specified synchronous/global-state models, not a prohibition of finite computers. The Turing representation involves extendible construction and communication conditions, not an already completed infinite physical memory or finite deadline for arbitrary programs. Technical realization, universal physical interpretability and a complete CS 4 communication calculus are explicitly unresolved/outside the work; some derivations are sketches and diagrams abbreviate proofs. No full formal/graph/implementation replay or independent certification was performed.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Petri, Communication with Automata: author-authorized 1966 English translation of 1962 dissertation, with errata",
        "url": "https://edoc.sub.uni-hamburg.de/informatik/volltexte/2010/155/pdf/diss_petri_engl.pdf",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Hamburg INFDok: original 1962 Kommunikation mit Automaten dissertation metadata",
        "url": "https://edoc.sub.uni-hamburg.de/informatik/frontdoor.php?source_opus=160",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      },
      {
        "title": "Hamburg Petri Nets Bibliography:1962 original and 1966 translation",
        "url": "https://www.informatik.uni-hamburg.de/TGI/pnbib/p/petri_c_a33.html",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Carl Adam Petri",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:90955c0f-a860-4625-a49e-965987d16740",
      "version": 1,
      "content_hash": "sha256:cdba0296b0580f224a294aa91e1535866490f276d099b03a84b9ee9793c698b4"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "260000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}