FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
DOI10.1142/S0129054191000182zbMATH Open0766.68100MaRDI QIDQ4016733FDOQ4016733
Authors: Narciso Martí-Oliet, José Meseguer
Publication date: 16 January 1993
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
concurrencylinear logicPetri netscategorical modelsquantaleslinear categoriescancellative linear logic
Subsystems of classical logic (including intuitionistic logic) (03B20) Categorical logic, topoi (03G30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (13)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri Nets Are Dioids
- Title not available (Why is that?)
- Completeness results for linear logic on Petri nets
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- Process versus unfolding semantics for Place/Transition Petri nets
- Title not available (Why is that?)
- Some issues about Petri net application to manufacturing and process supervisory control
- Semantic data modelling using linear logic
- From Petri nets to linear logic
- Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
This page was built for publication: FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4016733)