Petri nets are monoids
From MaRDI portal
Publication:922720
DOI10.1016/0890-5401(90)90013-8zbMATH Open0711.68077OpenAlexW2027622095MaRDI QIDQ922720FDOQ922720
Authors: José Meseguer, Ugo Montanari 
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
Recommendations
Cites Work
- Adjoint functors and triples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- Title not available (Why is that?)
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Closed categories generated by commutative monads
- Title not available (Why is that?)
- Sequential and concurrent behaviour in Petri net theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrent histories: a basis for observing distributed systems
- A distributed operational semantics of CCS based on condition/event systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets, algebras, morphisms, and compositionality
- Mathematical aspects of net theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrency and atomicity
- The basic algebraic structures in categories of derivations
- Unification in abelian semigroups
- An algebraic description of system behaviours
- Title not available (Why is that?)
- Functional behavior of nondeterministic and concurrent programs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Hornets: Nets within Nets Combined with Net Algebra
- Categorical principles, techniques and results for high-level-replacement systems in computer science
- Functorial models for Petri nets
- Petri nets, algebras, morphisms, and compositionality
- Nets, relations and linking diagrams
- A congruence for Petri nets
- Process synchronisation as fusion
- Executions in (semi-)integer Petri nets are compact closed categories
- Rewriting logic as a semantic framework for concurrency: a progress report
- Nets with mana: a framework for chemical reaction modelling
- Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes
- Timed Petri nets and temporal linear logic
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Petri net modules in the transformation-based component framework
- Relaxed models for rewriting logic
- Linear logic as a logic of computations
- Extensional Petri net
- Petri Nets Are Dioids
- Specification of real-time and hybrid systems in rewriting logic
- An algebraic semantics for structured transition systems and its application to logic programs
- Unfolding semantics of graph transformation
- An event structure semantics for general Petri nets
- A framework for the verification of infinite-state graph transformation systems
- Petri nets, Horn programs, linear logic and vector games
- Tiling transactions in rewriting logic
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Concurrent graph and term graph rewriting
- Zero-safe nets: Comparing the collective and individual token approaches.
- An abstract machine for concurrent modular systems: CHARM
- Two polygraphic presentations of Petri nets
- Confluence of graph rewriting with interfaces
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Categorical shape theory as a formal language for pattern recognition?
- Calculating Colimits Compositionally
- Process versus unfolding semantics for Place/Transition Petri nets
- On categories of fuzzy Petri nets
- General reversibility
- Net operations
- A coalgebraic presentation of structured transition systems
- Title not available (Why is that?)
- Axiomatizing permutation equivalence
- Title not available (Why is that?)
- Coordination: Reo, Nets, and Logic
- Petri Nets, Discrete Physics, and Distributed Quantum Computation
- Drags: a compositional algebraic framework for graph rewriting
- The category of typed graph grammars and its adjunctions with categories of derivations
- Compositional SOS and beyond: A coalgebraic view of open systems
- An algebraic characterisation of elementary net system (observable) state space
- Axiomatizing Petri net concatenable processes
- From Petri nets to linear logic
- Monotonic extensions of Petri nets: forward and backward search revisited
- Incremental construction of coverability graphs
- An algebraic view of interleaving and distributed operational semantics for CCS
- On the category of Petri net computations
- Subobject transformation systems
- Conditional rewriting logic as a unified model of concurrency
- From Petri nets to linear logic
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
- On the geometry and algebra of networks with state
- Associative composition of components with double-sided interfaces
- Categories with sums and right distributive tensor product
- Elementary control structures
- Conditional rewriting logic: Deduction, models and concurrency
- A compositional framework for reaction networks
- An axiomatization of the algebra of Petri net concatenable processes
- A multiset semantics for the pi-calculus with replication
- On the implementation of concurrent calculi in net calculi: two case studies
- Categorical rewriting of term-like structures
- Transformations in Reconfigurable Place/Transition Systems
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- Whole-grain Petri nets and processes
- Yeast: a case study for a practical use of formal methods
- Concurrency for Graph Grammars in a Petri net shell
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- A categorical semantics for guarded Petri nets
- A normal form for stateful connectors
- Title not available (Why is that?)
- Unifying Petri Net Semantics with Token Flows
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nets enriched over closed monoidal structures
- Basic results for two types of high-level replacement systems
- Petri nets as bitopological spaces
- Formal relationship between graph grammars and Petri nets
- Probabilistic real-time rewrite theories and their expressive power
- Concurrent Process Histories and Resource Transducers
- A categorical semantics for bounded Petri nets
- Ugo Montanari and Friends
- Calculi of net structures and sets are similar
- Title not available (Why is that?)
- Petri nets based on Lawvere theories
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Title not available (Why is that?)
- A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
- Algebraic properties of Petri net morphisms based on place connectivity
- A diagrammatic view of differential equations in physics
- Title not available (Why is that?)
- A categorical semantics for hierarchical Petri nets
- Categories of nets
- Open Petri nets
This page was built for publication: Petri nets are monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922720)
