Petri: communication nets, concurrency and conflict

What is recorded here?

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. A 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.

Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.

Scientific scope

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.

Read the original work

• Petri, Communication with Automata: author-authorized1966 English translation of1962 dissertation, with errata
• Hamburg INFDok: original1962 Kommunikation mit Automaten dissertation metadata
• Hamburg Petri Nets Bibliography:1962 original and1966 translation

This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.

People and systems

Carl Adam Petri

Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.