Axiomatizing the algebra of net computations and processes

DOI10.1007/S002360050064MaRDI QIDQ1901718zbMATH OpenOpenAlexFDO

Authors Pierpaolo Degano, José Meseguer, Ugo Montanari

Publication date 19 November 1995

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002360050064

zbMATH Keywords

concurrent behaviorsfunctorialityinterleavingmorphism compositionnonsequential processesparallel compositionpartial orderingPetri net theoryplace/transition netssequential compositionsymmetric monoidal categoryterm algebra

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• An axiomatization of the algebra of Petri net concatenable processes
• An axiomatization of the category of Petri net computations
• Axiomatizing Petri net concatenable processes
• An axiomatic characterization of algebras of processes of Petri nets
• Petri nets, algebras, morphisms, and compositionality

Cited in

(33)

• Petri nets, algebras, morphisms, and compositionality
• A causal semantics for CCS via rewriting logic
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
• Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
• Normal forms for algebras of connections.
• Zero-safe nets: Comparing the collective and individual token approaches.
• Tile formats for located and mobile systems.
• Functorial models for Petri nets
• Twenty years of rewriting logic
• Abstract processes of place/transition systems
• Spreading nets: a uniform approach to unfoldings
• Abstract processes in the absence of conflicts in general place/transition systems
• A normal form for stateful connectors
• scientific article; zbMATH DE number 4191145 (Why is no real title available?)
• Language representability of finite P/T nets
• Models of Computation: A Tribute to Ugo Montanari’s Vision
• Calculi of net structures and sets are similar
• Unifying Petri Net Semantics with Token Flows
• scientific article; zbMATH DE number 3988722 (Why is no real title available?)
• An axiomatization of the category of Petri net computations
• Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
• Unifying Petri nets with restricted occurrence rule using partial algebra
• Concurrency for Graph Grammars in a Petri net shell
• On nets, algebras and modularity
• On the category of Petri net computations
• An axiomatic characterization of algebras of processes of Petri nets
• Petri Nets Are Dioids
• Algebraic theories for contextual pre-nets.
• Algebraic characterization of petri net pomset semantics
• Rewriting logic as a semantic framework for concurrency: a progress report
• Whole-grain Petri nets and processes
• An axiomatization of the algebra of Petri net concatenable processes
• Process versus unfolding semantics for Place/Transition Petri nets

This page was built for publication: Axiomatizing the algebra of net computations and processes

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