Petri nets, Horn programs, linear logic and vector games
From MaRDI portal
(Redirected from Publication:1899147)
complexitycomputation theoryconcurrencyfragments of linear logicnondeterministic Minsky machinessemantics
Subsystems of classical logic (including intuitionistic logic) (03B20) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80)
Recommendations
Cites work
- 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
- 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?)
- 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
(17)- Phase semantics and Petri net interpretation for resource-sensitive strong negation
- Linear logic automata
- A proof theory for model checking
- Debits and Credits in Petri Nets and Linear Logic
- FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
- scientific article; zbMATH DE number 1479638 (Why is no real title available?)
- scientific article; zbMATH DE number 1499080 (Why is no real title available?)
- Complexity bounds for sum-product logic via additive proof nets and Petri nets
- Formalizing operational semantic specifications in logic
- A proof theory for model checking: an extended abstract
- State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Collaborative planning with confidentiality
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Linear constraint systems as high-level nets
- Commutative Lambek grammars
- Improved lower bounds for reachability in vector addition 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)
