Petri nets: an introduction
Proceedings of a tutorial and workshop on Category theory and computer programming
Petr nets, algebras, morphisms, and compositionality
Information and Computation
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
Information and Computation
An event structure semantics for general Petri nets
Theoretical Computer Science - Special volume on Petri nets
Process versus unfolding semantics for place/transition Petri nets
Theoretical Computer Science - Special volume on Petri nets
An axiomatization of the algebra of Petri net concatenable processes
Theoretical Computer Science
Specification and proof in membership equational logic
Theoretical Computer Science - Trees in algebra and programming
Membership algebra as a logical framework for equational specification
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Mapping tile logic into rewriting logic
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Representation Theorems for Petri Nets
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Equivalences among Various Logical Frameworks of Partial Algebras
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
A logic for distributed transition sytems
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Higher Dimensional Transition Systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An axiomatization of the category of Petri net computations
Mathematical Structures in Computer Science
High-Level Petri Nets as Type Theories in the Join Calculus
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Linear Ordered Graph Grammars and Their Algebraic Foundations
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Revisiting the algebra of Petri net processes under the collective token philosophy
Fundamenta Informaticae - Concurrency specification and programming
Concurrent models for Linda with transactions
Mathematical Structures in Computer Science
A framework for the verification of infinite-state graph transformation systems
Information and Computation
Ugo Montanari and Concurrency Theory
Concurrency, Graphs and Models
Models of Computation: A Tribute to Ugo Montanari's Vision
Concurrency, Graphs and Models
Revisiting the Algebra of Petri Net Processes under the Collective Token Philosophy
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
| Hi-index | 0.00 |
We show that although the algebraic semantics of place/transition Petri nets under the collective token philosophy can be fully explained in terms of strictly symmetric monoidal categories, the analogous construction under the individual token philosophy is not completely satisfactory, because it lacks universality and also functoriality. We introduce the notion of pre-nets to overcome this, obtaining a fully satisfactory categorical treatment, where the operational semantics of nets yields an adjunction. This allows us to present a uniform logical description of net behaviors under both the collective and the individual token philosophies in terms of theories and theory morphisms in partial membership equational logic. Moreover, since the universal property of adjunctions guarantees that colimit constructions on nets are preserved in our algebraic models, the resulting semantic framework has good compositional properties. Copyright 2001 Academic Press.