Completeness results for linear logic on Petri nets

DOI10.1016/S0168-0072(96)00024-3MaRDI QIDQ1361243zbMATH OpenOpenAlexFDO

Authors Uffe Engberg, Glynn Winskel

Publication date 26 October 1997

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0168-0072(96)00024-3

zbMATH Keywords

completenessatomic netsintuitionistic linear logicPetri net semanticsfragments of linear logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Metamathematics of constructive systems (03F50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• The completeness of linear logic for Petri net models
• scientific article; zbMATH DE number 125887
• Linear logic as a logic of computations

Cites work

• scientific article; zbMATH DE number 4173040 (Why is no real title available?)
• scientific article; zbMATH DE number 3825182 (Why is no real title available?)
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 125887 (Why is no real title available?)
• FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
• Linear logic
• Quantales and (noncommutative) linear logic
• The linear abstract machine

Cited in

(23)

• Linear logic based calculi for object Petri nets
• Completeness results for single-path Petri nets
• Linear logic for nets with bounded resources
• Timed Petri nets and temporal linear logic
• scientific article; zbMATH DE number 1231699 (Why is no real title available?)
• Interpreting a finitary pi-calculus in differential interaction nets
• A logic of separating modalities
• scientific article; zbMATH DE number 125887 (Why is no real title available?)
• Linear constraint systems as high-level nets
• Possible worlds and resources: The semantics of \(\mathbf{BI}\)
• Debits and Credits in Petri Nets and Linear Logic
• Complexity bounds for sum-product logic via additive proof nets and Petri nets
• The completeness of linear logic for Petri net models
• A modal BI logic for dynamic resource properties
• An algebraic glimpse at bunched implications and separation logic
• scientific article; zbMATH DE number 1560298 (Why is no real title available?)
• Proof procedure and answer extraction in Petri net model of logic programs
• Strategic reasoning with a bounded number of resources: the quest for tractability
• On linear logic planning and concurrency
• Coordination: Reo, Nets, and Logic
• Fuzzy sets, linear logic and petrinets
• Proof-search in type-theoretic languages: An introduction
• Phase semantics and Petri net interpretation for resource-sensitive strong negation

This page was built for publication: Completeness results for linear logic on Petri nets

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