Completeness and incompleteness of trace-based network proof systems | Zendy

Jennifer Widom | Zendy; David Gries | Zendy; F.B. Schneider | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Completeness and incompleteness of trace-based network proof systems

Author(s) -

Jennifer Widom,

David Gries,

F.B. Schneider

Publication year - 1987

Publication title -

ecommons (cornell university)

Language(s) - English

Resource type - Conference proceedings

ISBN - 0-89791-215-2

DOI - 10.1145/41625.41628

Subject(s) - trace (psycholinguistics) , completeness (order theory) , computer science , proof of concept , programming language , theoretical computer science , mathematics , operating system , mathematical analysis , philosophy , linguistics

Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research