Process versus unfolding semantics for Place/Transition Petri nets

DOI10.1016/0304-3975(95)00121-2zbMATH Open0872.68130OpenAlexW2052906135MaRDI QIDQ672872FDOQ672872

Authors José Meseguer, Ugo Montanari, Vladimiro Sassone

Publication date 28 February 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(95)00121-2

zbMATH Keywords

monoidal categoriesplace/transition netsdecorated occurrence netsdecorated processesnonsequential processesunfolding constructions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the semantics of place/transition Petri nets
• scientific article; zbMATH DE number 1361137
• scientific article; zbMATH DE number 1696454
• The unfolding of general Petri nets

Cites work

• scientific article; zbMATH DE number 4018370 (Why is no real title available?)
• scientific article; zbMATH DE number 4191145 (Why is no real title available?)
• scientific article; zbMATH DE number 3825182 (Why is no real title available?)
• scientific article; zbMATH DE number 3982529 (Why is no real title available?)
• scientific article; zbMATH DE number 4030999 (Why is no real title available?)
• scientific article; zbMATH DE number 4037225 (Why is no real title available?)
• scientific article; zbMATH DE number 1497817 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• A distributed operational semantics of CCS based on condition/event systems
• An event structure semantics for general Petri nets
• Axiomatizing Petri net concatenable processes
• Axiomatizing the algebra of net computations and processes
• Branching processes of Petri nets
• FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
• Mathematical aspects of net theory
• On the category of Petri net computations
• PETRI NETS AND STEP TRANSITION SYSTEMS
• Petri nets are monoids
• Petri nets, algebras, morphisms, and compositionality
• Petri nets, event structures and domains. I
• Sequential and concurrent behaviour in Petri net theory
• Special issue: F-WAN, foundations of wide area network computing. Selected papers based on the presentation at the meeting, Málaga, Spain, July 12--13, 2002.
• The non-sequential behaviour of Petri nets

Cited in

(18)

• On a homomorphism of a component Petri net
• Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
• Algebraic characterization of petri net pomset semantics
• Models of Computation: A Tribute to Ugo Montanari’s Vision
• Contextual Petri nets, asymmetric event structures, and processes
• Unfolding semantics of graph transformation
• scientific article; zbMATH DE number 7649934 (Why is no real title available?)
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• Functorial models for Petri nets
• Concurrency for Graph Grammars in a Petri net shell
• Petri games: synthesis of distributed systems with causal memory
• Zero-safe nets: Comparing the collective and individual token approaches.
• On the semantics of place/transition Petri nets
• The unfolding of general Petri nets
• Whole-grain Petri nets and processes
• The synthesis problem for repeatedly communicating Petri games
• Semantic domains of timed event structures

This page was built for publication: Process versus unfolding semantics for Place/Transition Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672872)