Conference Paper

Rules for Trace Consistent Reasoning.

DOI: 10.1007/3-540-63875-X_43 Conference: Advances in Computing Science - ASIAN '97, Third Asian Computing Science Conference, Kathmandu, Nepal, December 9-11, 1997, Proceedings
Source: DBLP


Formulas of temporal logic which cannot distinguish between different interleavingsof the same run are said to be trace consistent. So called partial-ordermethods can be applied for verification of such formulas, since checking such aproperty over an equivalence class of runs reduces to checking it for one representative.In this paper, we present inference rules that typify this kind of reasoning.The rules lead us to a complete axiomatization of a linear time temporal logic,all formulas...

Download full-text


Available from: Ramaswamy Ramanujam, Oct 17, 2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: This document in subdirectory RS/98/8/ Distributed Versions of Linear Time Temporal Logic: A Trace Perspective SPIC Mathematical Institute, Chennai, India Jesper Gulmann Henriksen , Department of Computer Science, University of Aarhus, Denmark April 28, 1998 1
    No preview · Article · May 1999
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This dissertation investigates and extends the mathematical foundations of logics and automata for the interleaving and synchronous noninterleaving view of system computations with an emphasis on decision procedures and relative expressive powers, and introduces extensions of these foundations to the emerging domain of noninterleaving asynchronous computations. System computations are described as occurrences of system actions, and tractable collections of such computations can be naturally represented by finite automata upon which one can do formal analysis. Specifications of system properties are usually described in formal logics, and the question whether the system at hand satisfies its specification is then solved by means of automata-theoretic constructions. Our focus here is on the linear time behaviour of systems, where executions are modeled as sequence-like objects, neither reflecting nondeterminism nor branching choices. We consider a variety of linear time paradigms, such a...
    Preview · Article · Dec 2000