Petri nets, Horn programs, linear logic and vector games

DOI10.1016/0168-0072(94)00060-GMaRDI QIDQ1899147zbMATH OpenFDO

Authors Max Kanovich

Publication date 4 October 1995

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

zbMATH Keywords

complexitysemanticsconcurrencycomputation theoryfragments of linear logicnondeterministic Minsky machines

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Automata and formal grammars in connection with logical questions (03D05) Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Publication:4490754
• From Petri nets to linear logic
• Linear logic as a logic of computations
• From Petri nets to linear logic

Cites work

• scientific article; zbMATH DE number 4179372 (Why is no real title available?)
• scientific article; zbMATH DE number 4191145 (Why is no real title available?)
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 4099289 (Why is no real title available?)
• scientific article; zbMATH DE number 3781165 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 4123722 (Why is no real title available?)
• scientific article; zbMATH DE number 1318513 (Why is no real title available?)
• scientific article; zbMATH DE number 1479638 (Why is no real title available?)
• scientific article; zbMATH DE number 1489627 (Why is no real title available?)
• scientific article; zbMATH DE number 1392281 (Why is no real title available?)
• A game semantics for linear logic
• A new constructive logic: classic logic
• An Algorithm for the General Petri Net Reachability Problem
• Bounded linear logic: A modular approach to polynomial-time computability
• Computational interpretations of linear logic
• Decision problems for propositional linear logic
• From Petri nets to linear logic
• Language in action
• Linear logic
• Linear logic as a logic of computations
• On the computational power of pushdown automata
• On the unity of logic
• Parallel program schemata
• Petri nets are monoids
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of Horn fragments of linear logic
• The complexity of the word problems for commutative semigroups and polynomial ideals

Cited in

(15)

• Linear constraint systems as high-level nets
• Formalizing operational semantic specifications in logic
• Complexity bounds for sum-product logic via additive proof nets and Petri nets
• scientific article; zbMATH DE number 1479638 (Why is no real title available?)
• Debits and Credits in Petri Nets and Linear Logic
• State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
• A proof theory for model checking
• Collaborative planning with confidentiality
• Phase semantics and Petri net interpretation for resource-sensitive strong negation
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
• Linear logic automata
• Commutative Lambek grammars
• scientific article; zbMATH DE number 7559504 (Why is no real title available?)
• A proof theory for model checking: an extended abstract

This page was built for publication: Petri nets, Horn programs, linear logic and vector games

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