## Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach (1999)

### Cached

### Download Links

- [ftp.cs.utexas.edu]
- [ftp.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 68 - 17 self |

### BibTeX

@MISC{Emerson99utilizingsymmetry,

author = {E. A. Emerson and A. P. Sistla},

title = {Utilizing Symmetry when Model Checking under Fairness Assumptions: An Automata-theoretic Approach},

year = {1999}

}

### Years of Citing Articles

### OpenURL

### Abstract

### Citations

1546 | Pnuelli "The temporal logic of reactive and concurrent systems - Manna, A |

1134 | Temporal and Modal Logic
- Emerson
- 1990
(Show Context)
Citation Context ...xed CTL* is just like Indexed CTL* but uses the path quantifiers E \Phi and A \Phi where path quantification ranges only over fair paths [8]. The semantics of these logics is defined in the usual way =-=[10]-=- and we write, e.g., M; s j= h to mean that in structure M at state s formula h holds true. Let f be any formula f of the above logics. We let (f) denote the formula obtained by changing the indices o... |

785 | Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical - Jensen - 1997 |

423 | Computer-aided Verification of Coordinating Processes - Kurshan - 1994 |

239 | A.: Checking that finite state concurrent programs satisfy their linear specification
- Lichtenstein, Pnueli
- 1985
(Show Context)
Citation Context ...ing of coordinates using the permutations on arcs of M as guides. We can then give an algorithm to answer whether M; s 0 j= Ef by testing B for nonemptiness in time polynomial in jM j and jB f j (cf. =-=[16, 21]-=-). For a formula f with a single index i, B f is essentially the same automaton as A f but its states are a pair of the form (q; j) where q is a state of A f and j is an index giving the current meani... |

195 | Modal and temporal logics - Stirling - 1992 |

189 | Better verification through symmetry
- IP, DILL
- 1996
(Show Context)
Citation Context ...has been much interest in using various techniques to combat the state explosion problem in the automatic verification of finite state concurrent systems. One of the techniques that has been proposed =-=[12, 5, 9]-=- is to exploit the symmetry inherent in systems with many similar subcomponents when performing temporal logic model checking [3, 4]. In [12] the focus is on reasoning about a simple but basic type of... |

148 | Exploiting symmetry in temporal logic model checking - CLARKE, FILKORN, et al. - 1993 |

134 | Reasoning about systems with many processes - German, Sistla - 1992 |

77 | High-Level Petri Nets. Theory and Application - Jensen, Rozenberg - 1991 |

65 | Modalities for model checking: Branching time strikes back - Emerson, Lei - 1985 |

61 | Online minimization of transition systems - LEE, YANNAKAKIS - 1992 |

36 | Generation of reduced models for checking fragments of CTL - Dams, Grumberg, et al. - 1993 |

34 |
Exploiting Symmetry
- Clarke, Filkorn, et al.
- 1993
(Show Context)
Citation Context ... 11, 1994 Abstract: One technique for combating the state explosion problem is to exploit symmetry [12, 5, 9] when performing temporal logic model checking [3, 4]. The works of Clarke, Filkorn, & Jha =-=[5]-=- and Emerson & Sistla [9] show how, using some basic notions of group theory, symmetry may be exploited for the full range of correctness properties expressible in the very expressive temporal logic C... |

30 |
Design and verification of synchronization skeletons using branching time temporal logic
- Clarke, Emerson
- 1981
(Show Context)
Citation Context ...Assumptions E. A. Emerson A. P. Sistla y May 11, 1994 Abstract: One technique for combating the state explosion problem is to exploit symmetry [12, 5, 9] when performing temporal logic model checking =-=[3, 4]-=-. The works of Clarke, Filkorn, & Jha [5] and Emerson & Sistla [9] show how, using some basic notions of group theory, symmetry may be exploited for the full range of correctness properties expressibl... |

19 | A calculus for protocol specification and validation - Aggarwal, Kurshan, et al. - 1983 |

19 | Characterizing Kripke structures in temporal logic - Browne, Clarke, et al. - 1987 |

11 | Analyzing concurrent systems using the concurrency workbench - Cleaveland - 1993 |

10 | Testing Containment of omega-regular Languages", Bell Labs - Kurshan - 1986 |

7 |
Modalities for Model Checking: Branching Time
- Emerson, Lei
- 1987
(Show Context)
Citation Context ...[5, 9]. Although group fairness is appropriate for some situations, it is not in general adequate. The second solution allows us to handle the full range of conventional fairness properties \Phi (cf. =-=[8]-=-). These include strong fairness where \Phi =si=1:::n (GFen i ) GFex i ) is the formula 1 asserting that a path is infinite and strongly fair; here the propositions en i indicate that process i is ena... |

5 |
Automatic verification of finite state concurrent programs using temporal logic: A practical approach
- Clarke, Emerson, et al.
- 1983
(Show Context)
Citation Context ...Assumptions E. A. Emerson A. P. Sistla y May 11, 1994 Abstract: One technique for combating the state explosion problem is to exploit symmetry [12, 5, 9] when performing temporal logic model checking =-=[3, 4]-=-. The works of Clarke, Filkorn, & Jha [5] and Emerson & Sistla [9] show how, using some basic notions of group theory, symmetry may be exploited for the full range of correctness properties expressibl... |

2 |
Symmetry and model
- EMERSON, SISTLA
- 1996
(Show Context)
Citation Context ...notated path p, we define a sequence f(p) of states in S such that f(p) = t 0 ; t 1 ; :::; t i ; ::: where t 0 = s 0 and t i =s1 \Deltas2 \Delta \Delta \Deltasi (s i ). The following lemma, proved in =-=[9]-=-, relates annotated paths in M to paths in M . LEMMA 4.2: For every annotated path p in M , f(p) is a path in M . In the other direction, for every path q starting at a representative state in M , the... |

2 | Reasoning about many identical processes - Clarke, Grumberg, et al. - 1989 |

2 | Handbook of Theoretical Computer - Emerson - 1991 |

1 | Reasoning with many - Sistla, German - 1987 |

1 |
An Automata-Theoretic Framework for Modal
- Vardi, Wolper
(Show Context)
Citation Context ...o note that this could not be done using the essentially group-theoretic approaches of [5, 9], yet works out nicely in the automata-theoretic framework. This seems to testify to the power of automata =-=[20, 21]-=-. 11 One point we have not addressed is the construction M incrementally from the program text. This is discussed in [9, 5, 12]. It turns out to reduce to testing if two states are equivalent modulo t... |

1 |
An automata-theoretic framework for automatic program verification
- Vardi, Wolper
- 1986
(Show Context)
Citation Context ...y propositional reasoning, tosi=1:::n GF (ex i :en i ). Unconditional fairness is expressed by \Phi =si=1:::n GFex i . Interestingly, this solution depends on trading group theory for automata theory =-=[21]. To under-=-stand why fairness in problematic, we must review the "group-theoretic" approaches of [5, 9]. 2 We will use the terminology of [9] but the same remarks apply to the the approach of [5]. We f... |

1 | Protocol Specification, Testing and Verification - Aggarwal, Kurshan, et al. - 1983 |

1 | Minimal state generation. Science of Computer Programming - Bouajjani, Fernandez, et al. - 1992 |

1 | Symmetry and model checking. complete version to appear - Emerson, Sistla - 1993 |

1 | Utilizing Symmetry when Model Checking under Fairness \Delta 21 - Litchtenstein, Pnueli - 1985 |

1 | Propositional dynamic logic of looping and - Streett - 1981 |

1 | An automata-theoretic framework for modal logics of programs - Vardi, Wolper - 1984 |