WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/11721837

Completeness and incompleteness of trace-based network proof systems

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.

Open All Close All

type

about

author

contributor

creator

description

http://schema.org/description

  • "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."@en

name

http://schema.org/name

  • "Completeness and incompleteness of trace-based network proof systems"@en
  • "Completeness and incompleteness of trace-based network proof systems"

workExample