A Congruence for Petri Nets | Zendy

Vladimiro Sassone | Zendy; Paweł Sobociński | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Congruence for Petri Nets

Author(s) -

Vladimiro Sassone,

Paweł Sobociński

Publication year - 2005

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2005.02.008

Subject(s) - petri net , congruence (geometry) , computer science , process architecture , semantics (computer science) , theoretical computer science , concurrency , programming language , stochastic petri net , transition system , encoding (memory) , mathematics , artificial intelligence , geometry

We introduce a way of viewing Petri nets as open systems. This is done by considering a bicategory of cospans over a category of p/t nets and embeddings. We derive a labelled transition system (LTS) semantics for such nets using GIPOs and characterise the resulting congruence. Technically, our results are similar to the recent work by Milner on applying the theory of bigraphs to Petri Nets. The two main differences are that we treat p/t nets instead of c/e nets and we deal directly with a category of nets instead of encoding them into bigraphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research