Trace Consistency and Inevitablity

  title={Trace Consistency and Inevitablity},
  author={Ramaswamy Ramanujam},
  • R. Ramanujam
  • Published in FSTTCS 18 December 1996
  • Computer Science
Two runs of a distributed system can be considered equivalent if they represent different interleavings of the same run. Formulas of the propositional temporal logic of linear time (PTL) are said to be trace consistent when they cannot distinguish between equivalent runs. Determining whether a formula is trace consistent is decidable. In this paper, we consider a closely related notion: a PTL formula is said to be inevitable, if for every system run, there is at least one equivalent run (that… 
1 Citations
Rules for Trace Consistent Reasoning
Formulas of temporal logic which cannot distinguish between different interleavings of the same run are said to be trace consistent because checking such a property over an equivalence class of runs reduces to checking it for one representative.


A Trace Consistent Subset of PTL
The Propositional Temporal logic of Linear time (PTL) is often interpreted over sequences (of states or actions) that can be grouped into equivalence classes under a natural partial order based
A trace based extension of linear time temporal logic
  • P. Thiagarajan
  • Computer Science
    Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science
  • 1994
This work designs a natural extension of PTL called TrPTL to be interpreted directly over infinite traces and shows that the satisfiability problem for TrPTl is decidable, and solves the model checking problem forTrPTL with respect to finite state concurrent programs.
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages
This paper develops algorithms for deciding if a property cannot distinguish between equivalent sequences, i.
A Logical Study of Distributed Transition Systems
An addition-based temporal logic is designed in which one can explicity talk about steps, and positive and negative results show that the step notion is amenable to logical treatment via standard techniques and demanding deterministic structures when dealing with a "non-interleaved" notion of transitions.
All from One, One for All: on Model Checking Using Representatives
  • D. Peled
  • Computer Science, Mathematics
  • 1993
An algorithm for constructing a state graph that contains at least one representative sequence for each equivalence class, and a formula rewriting technique is presented to allow coarser equivalence relation among sequences, such that less representatives are needed.
Rational and Recognizable Complex Trace Languages
The generalization of Kleene′s and Ochmanski′s theorems to complex trace languages is introduced and various closure results such as the closure under boolean operations, concatenation, and left and right quotients by recognizable sets are proved.
Proving Partial Order Properties
Defining Conditional Independence Using Collapses
Concurrent Systems and Inevitability
The Temporal Logic of Reactive and Concurrent Systems
This volume offers an introduction to temporal logic and to the computational model for reactive programs which has been developed by the authors.