Linear logic automata

DOI10.1016/0168-0072(95)00035-6MaRDI QIDQ1919766zbMATH OpenOpenAlexFDO

Authors Max 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

Other applications of logic (03B80) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Petri nets, Horn programs, linear logic and vector games
• Publication:4490754
• scientific article; zbMATH DE number 125887
• From Petri nets to linear logic
• scientific article; zbMATH DE number 1361538

Cites work

• An Algorithm for the General Petri Net Reachability Problem
• An axiomatic basis for computer programming
• 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
• How to Program an Infinite Abacus
• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 3781165 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 3614137 (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 4767 (Why is no real title available?)
• scientific article; zbMATH DE number 1392281 (Why is no real title available?)
• Linear logic
• Linear logic as a logic of computations
• On the reachability problem for 5-dimensional vector addition systems
• Parallel program schemata
• Programming as a Discipline of Mathematical Nature
• Recursive functions of symbolic expressions and their computation by machine, Part I
• 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

(3)

• The linear abstract machine
• Coordination: Reo, Nets, and Logic
• scientific article; zbMATH DE number 3577162 (Why is no real title available?)

This page was built for publication: Linear logic automata

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