Petr nets, algebras, morphisms, and compositionality
Information and Computation
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Finite completeness of categories of petri nets
Fundamenta Informaticae - Special issue on Concurrency specification and programming (CS&P)
A New Definition of Morphism on Petri Nets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Distributed Monitoring of Concurrent and Asynchronous Systems*
Discrete Event Dynamic Systems
Logic synthesis for asynchronous circuits based on STG unfoldings and incremental SAT
Fundamenta Informaticae - Special issue on application of concurrency to system design (ACSD'04)
Detecting State Encoding Conflicts in STG Unfoldings Using SAT
Fundamenta Informaticae - Application of Concurrency to System Design (ACSD'03)
Modular system development with pullbacks
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Modular Construction of Finite and Complete Prefixes of Petri net Unfoldings
Fundamenta Informaticae - Application of Concurrency to System Design
On Preserving Structural and Behavioural Properties by Composing Net Systems on Interfaces
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
The product of safe Petri nets is a well known operation : it generalizes to concurrent systems the usual synchronous product of automata. In this paper, we consider a more general way of combining nets, called a pullback. The pullback operation generalizes the product to nets which interact both by synchronized transitions and/or by a shared sub-net (i.e. shared places and transitions). To obtain all pullbacks, we actually show that all equalizers can be defined in the category of safe nets. Combined to the known existence of products in this category, this gives more than what we need : we actually obtain that all small limits exist, i.e. that safe nets form a complete category.