Petri nets are monoids

DOI10.1016/0890-5401(90)90013-8zbMath0711.68077OpenAlexW2027622095MaRDI QIDQ922720

Publication date: 1990

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(90)90013-8

zbMATH Keywords

Petri nets net category

Mathematics Subject Classification ID

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

Related Items (86)

Linear logic as a logic of computations ⋮ Conditional rewriting logic: Deduction, models and concurrency ⋮ Concurrent Process Histories and Resource Transducers ⋮ A New Strategy for Distributed Compensations with Interruption in Long-Running Transactions ⋮ Yeast: A case study for a practical use of formal methods ⋮ Petri net modules in the transformation-based component framework ⋮ Probabilistic Real-Time Rewrite Theories and Their Expressive Power ⋮ Axiomatizing Petri net concatenable processes ⋮ Incremental construction of coverability graphs ⋮ Petri nets, Horn programs, linear logic and vector games ⋮ Unfolding semantics of graph transformation ⋮ Categorical shape theory as a formal language for pattern recognition? ⋮ José Meseguer: Scientist and Friend Extraordinaire ⋮ A Normal Form for Stateful Connectors ⋮ An algebraic view of interleaving and distributed operational semantics for CCS ⋮ From petri nets to linear logic ⋮ On the category of Petri net computations ⋮ A Categorical Semantics for Guarded Petri Nets ⋮ Executions in (Semi-)Integer Petri Nets are Compact Closed Categories ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Elementary control structures ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Transformations in Reconfigurable Place/Transition Systems ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Calculating Colimits Compositionally ⋮ Ugo Montanari and Friends ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes ⋮ Concurrent graph and term graph rewriting ⋮ Unnamed Item ⋮ A diagrammatic view of differential equations in physics ⋮ Calculi of net structures and sets are similar ⋮ A compositional framework for reaction networks ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Unnamed Item ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Open Petri nets ⋮ Subobject transformation systems ⋮ Associative composition of components with double-sided interfaces ⋮ A framework for the verification of infinite-state graph transformation systems ⋮ Extensional Petri net ⋮ An axiomatization of the algebra of Petri net concatenable processes ⋮ A multiset semantics for the pi-calculus with replication ⋮ An event structure semantics for general Petri nets ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ The category of typed graph grammars and its adjunctions with categories of derivations ⋮ Formal relationship between graph grammars and Petri nets ⋮ On the geometry and algebra of networks with state ⋮ An algebraic semantics for structured transition systems and its application to logic programs ⋮ Categorical principles, techniques and results for high-level-replacement systems in computer science ⋮ An algebraic characterisation of elementary net system (observable) state space ⋮ A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques ⋮ Unnamed Item ⋮ 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 ⋮ Categorical rewriting of term-like structures ⋮ Basic Results for Two Types of High-Level Replacement Systems ⋮ Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions ⋮ A coalgebraic presentation of structured transition systems ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Coordination: Reo, Nets, and Logic ⋮ Algebraic nets with flexible arcs ⋮ Structured Cospans ⋮ Petri nets based on Lawvere theories ⋮ From Petri nets to linear logic ⋮ Axiomatizing permutation equivalence ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Hornets: Nets within Nets Combined with Net Algebra ⋮ On categories of fuzzy Petri nets ⋮ Process synchronisation as fusion ⋮ Petri Nets Are Dioids ⋮ Relaxed models for rewriting logic ⋮ Zero-safe nets: Comparing the collective and individual token approaches. ⋮ Functorial models for Petri nets ⋮ General Reversibility ⋮ An abstract machine for concurrent modular systems: CHARM ⋮ Categories with sums and right distributive tensor product ⋮ Compositional SOS and beyond: A coalgebraic view of open systems ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic ⋮ Specification of real-time and hybrid systems in rewriting logic ⋮ Nets with mana: a framework for chemical reaction modelling

Cites Work

This page was built for publication: Petri nets are monoids