
In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the collective token interpretation. To this end we propose a more general form of event structure, matching the expressive power of such nets. These new event structures and nets are connected by relating both notions with configuration structures, which can be regarded as representations of either event structures or nets that capture their behaviour in terms of action occurrences and the causal relationships between them, but abstract from any auxiliary structure. A configuration structure can also be considered logically, as a class of propositional models, or - equivalently - as a propositional theory in disjunctive normal from. Converting this theory to conjunctive normal form is the key idea in the translation of such a structure into a net. For a variety of classes of event structures we characterise the associated classes of configuration structures in terms of their closure properties, as well as in terms of the axiomatisability of the associated propositional theories by formulae of simple prescribed forms, and in terms of structural properties of the associated Petri nets.
Contributed to the Festschrift for Mogens Nielsen's 60th birthday
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, configuration structures, Petri nets, propositional logic, Theoretical Computer Science, Logic in Computer Science (cs.LO), Configuration structures, Concurrency, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), F.3.2, Propositional logic, concurrency, Event structures, event structures, Computer Science(all)
FOS: Computer and information sciences, Computer Science - Logic in Computer Science, configuration structures, Petri nets, propositional logic, Theoretical Computer Science, Logic in Computer Science (cs.LO), Configuration structures, Concurrency, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), F.3.2, Propositional logic, concurrency, Event structures, event structures, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 70 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
