Linear logic automata

Annals of Pure and Applied Logic 78 (1-3):147-188 (1996)
  Copy   BIBTEX

Abstract

A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic.A programming language of LL automata is developed in which typical sequential, non-deterministic and parallel programming constructs are expressed in the natural way.All non-deterministic computations, e.g. computations performed by programs built up of guarded commands in the Dijkstra's approach to non-deterministic programming, are directly simulated within the framework of Linear Logic automata, and thereby within the Horn framework of Linear Logic

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00035-6

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,317

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Petri nets, Horn programs, Linear Logic and vector games.Max I. Kanovich - 1995 - Annals of Pure and Applied Logic 75 (1-2):107-135.
On Relation Between Linear Temporal Logic and Quantum Finite Automata.Amandeep Singh Bhatia & Ajay Kumar - 2020 - Journal of Logic, Language and Information 29 (2):109-120.
Alternating automata and temporal logic normal forms.Clare Dixon, Alexander Bolotov & Michael Fisher - 2005 - Annals of Pure and Applied Logic 135 (1-3):263-285.
Automata on ordinals and automaticity of linear orders.Philipp Schlicht & Frank Stephan - 2013 - Annals of Pure and Applied Logic 164 (5):523-527.
Linear logic as a logic of computations.Max I. Kanovich - 1994 - Annals of Pure and Applied Logic 67 (1-3):183-212.
Relating word and tree automata.Orna Kupferman, Shmuel Safra & Moshe Y. Vardi - 2006 - Annals of Pure and Applied Logic 138 (1):126-146.
Computing definite logic programs by partial instantiation.Vadim Kagan, Anil Nerode & V. S. Subrahmanian - 1994 - Annals of Pure and Applied Logic 67 (1-3):161-182.
Applications of Linear Logic to Computation: An Overview.Vladimir Alexiev - 1994 - Logic Journal of the IGPL 2 (1):77-107.
The complexity of Horn fragments of Linear Logic.Max I. Kanovich - 1994 - Annals of Pure and Applied Logic 69 (2-3):195-241.
Deterministic automata simulation, universality and minimality.Cristian Calude, Elena Calude & Bakhadyr Khoussainov - 1997 - Annals of Pure and Applied Logic 90 (1-3):263-276.

Analytics

Added to PP
2014-01-16

Downloads
42 (#524,997)

6 months
14 (#216,207)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Proofs and types.Jean-Yves Girard - 1989 - New York: Cambridge University Press.
Lectures on Linear Logic.Anne Sjerp Troelstra - 1992 - Center for the Study of Language and Information Publications.
Linear logic : A survey.J.-Y. Girard - 1995 - In Philippe De Groote (ed.), The Curry-Howard isomorphism. Louvain-la-Neuve: Academia.
The complexity of Horn fragments of Linear Logic.Max I. Kanovich - 1994 - Annals of Pure and Applied Logic 69 (2-3):195-241.

View all 8 references / Add more references