Abstract
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish the complexity of the provability problem and the problem of concurrency recognition. The notion of k-maximal concurrency is introduced which guarantees polynomial time provability. Theorems on hierarchy and on complexity of recognition of the property are proved.
Cite
CITATION STYLE
Dudakov, S. M. (1997). The concurrency complexity for the Horn fragment of linear logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1234, pp. 78–87). Springer Verlag. https://doi.org/10.1007/3-540-63045-7_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
