Linear logic automata

DOI10.1016/0168-0072(95)00035-6zbMath0859.68021OpenAlexW1981021681MaRDI QIDQ1919766

Max I. Kanovich

Publication date: 24 July 1996

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

Full work available at URL: https://doi.org/10.1016/0168-0072(95)00035-6

zbMATH Keywords

finite automatonlinear logic automatonnon-deterministic Petri net

Mathematics Subject Classification ID

Related Items (1)

Coordination: Reo, Nets, and Logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Computational interpretations of linear logic
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• On the reachability problem for 5-dimensional vector addition systems
• Decision problems for propositional linear logic
• Bounded linear logic: A modular approach to polynomial-time computability
• Linear logic as a logic of computations
• The complexity of Horn fragments of linear logic
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Parallel program schemata
• Recursive functions of symbolic expressions and their computation by machine, Part I
• An Algorithm for the General Petri Net Reachability Problem
• How to Program an Infinite Abacus
• Programming as a Discipline of Mathematical Nature
• From petri nets to linear logic
• An axiomatic basis for computer programming

This page was built for publication: Linear logic automata