Petri nets, Horn programs, linear logic and vector games

DOI10.1016/0168-0072(94)00060-GzbMATH Open0829.03007MaRDI QIDQ1899147FDOQ1899147

Authors: Max Kanovich 

Publication date: 4 October 1995

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Decision problems for propositional linear logic
• Parallel program schemata
• Title not available (Why is that?)
• Linear logic
• Bounded linear logic: A modular approach to polynomial-time computability
• On the computational power of pushdown automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational interpretations of linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new constructive logic: classic logic
• On the unity of logic
• An Algorithm for the General Petri Net Reachability Problem
• A game semantics for linear logic
• Linear logic as a logic of computations
• Title not available (Why is that?)
• The complexity of Horn fragments of linear logic
• Title not available (Why is that?)
• Petri nets are monoids
• Title not available (Why is that?)
• From Petri nets to linear logic
• Title not available (Why is that?)
• Language in action
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (16)

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

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)