Abstract
A categorical semantic domain is constructed for Petri nets which satisfies the diagonal compositionality requirement with respect to anticipations, i.e., Petri nets are equipped with a compositional anticipation mechanism (vertical compositionality) that distributes through net combinators (horizontal compositionality). The anticipation mechanism is based on graph transformations (single pushout approach). A finitely bicomplete category of partial Petri nets and partial morphisms is introduced. Classes of transformations stand for anticipations. The composition of anticipations (i.e., composition of pushouts) is defined, leading to a category of nets and anticipations which is also complete and cocomplete. Since the anticipation operation composes, the vertical compositionality requirement of Petri nets is achieved. Then, it is proven that the anticipation also satisfies the horizontal compositionality requirement. A specification grammar stands for a system specification and the corresponding induced subcategory of nets and anticipation’s stands for all possible dynamic anticipation’s of the system (objects) and their relationship (morphims).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
