# Trace Consistency and Inevitablity

@inproceedings{Ramanujam1996TraceCA, title={Trace Consistency and Inevitablity}, author={Ramaswamy Ramanujam}, booktitle={FSTTCS}, year={1996} }

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…

## One Citation

Rules for Trace Consistent Reasoning

- Computer ScienceASIAN
- 1997

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.

## References

SHOWING 1-10 OF 16 REFERENCES

A Trace Consistent Subset of PTL

- MathematicsCONCUR
- 1995

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

- Computer ScienceProceedings 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

- Computer ScienceCONCUR
- 1996

This paper develops algorithms for deciding if a property cannot distinguish between equivalent sequences, i.

A partial approach to model checking

- Computer Science[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
- 1991

A model-checking method for linear-time temporal logic that avoids the state explosion due to the modeling of concurrency by interleaving by relying on the concept of the Mazurkiewicz trace as a semantic basis and using automata-theoretic techniques.

A Logical Study of Distributed Transition Systems

- Computer ScienceInf. Comput.
- 1995

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

- Computer Science, MathematicsCAV
- 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.

A stubborn attack on state explosion

- MathematicsFormal Methods Syst. Des.
- 1992

The LTL-preserving stubborn set method is presented for reducing the amount of work needed in the automatic verification of concurrent systems with respect to linear-time temporal logic specifications.

Rational and Recognizable Complex Trace Languages

- Computer Science, MathematicsInf. Comput.
- 1995

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.