Petri nets, Horn programs, Linear Logic, and vector games
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- From petri nets to linear logicPublished by Springer Nature ,2005
- The complexity of Horn fragments of Linear LogicAnnals of Pure and Applied Logic, 1994
- Linear logic as a logic of computationsAnnals of Pure and Applied Logic, 1994
- Decision problems for propositional linear logicAnnals of Pure and Applied Logic, 1992
- A game semantics for linear logicAnnals of Pure and Applied Logic, 1992
- Bounded linear logic: a modular approach to polynomial-time computabilityTheoretical Computer Science, 1992
- Linear logicTheoretical Computer Science, 1987
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984
- The complexity of the word problems for commutative semigroups and polynomial idealsAdvances in Mathematics, 1982
- Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 1961