Axiomatizing the algebra of net computations and processes
From MaRDI portal
Publication:1901718
DOI10.1007/s002360050064zbMath0849.68087OpenAlexW4254746810MaRDI QIDQ1901718
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
Petri net theoryinterleavingfunctorialitypartial orderingsymmetric monoidal categorysequential compositionplace/transition netsparallel compositionnonsequential processesterm algebraconcurrent behaviorsmorphism composition
Related Items
Language Representability of Finite P/T Nets ⋮ A Normal Form for Stateful Connectors ⋮ Twenty years of rewriting logic ⋮ Algebraic characterization of petri net pomset semantics ⋮ Rewriting logic as a semantic framework for concurrency: a progress report ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ Abstract processes of place/transition systems ⋮ Calculi of net structures and sets are similar ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ Spreading nets: a uniform approach to unfoldings ⋮ 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 ⋮ Unifying Petri Net Semantics with Token Flows ⋮ Petri Nets Are Dioids ⋮ 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 ⋮ Abstract processes in the absence of conflicts in general place/transition systems ⋮ A causal semantics for CCS via rewriting logic ⋮ Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
