(Enter summary)
Abstract: K. Ajami
*
S. Haddad
**
J-M. Ili
*
Abstract. Model checking is a useful technique to verify properties of dynamic
systems but it has to cope with the state explosion problem. By simultaneous exploitation
of symmetries of both the system and the property, the model checking
can be performed on a reduced quotient structure [2,6,7]. In these techniques a
property is specified within a temporal logic formula (CTL*) and the symmetries
of the formula are obtained by a syntactical checking. ... (Update)
Context of citations to this paper: More
.... systems are symmetric in their design and implementation (cf. JR91] ID96] ES96] CE 96] HI 95] MAV96] ES97] GS97] ET98] [AHI98]) Such symmetry can be seen to be a form of redundancy from the standpoint of model checking temporal logic formulae. The state graph, M...
.... involve processes [12] variables of a special symmetry preserving type (scalarset) 8] and symmetries of temporal logic speci cations [3, 22, 25]. The reason we focus on heap symmetries when model checking object based software is that, in dynamic programs, the number of...
Cited by: More
Five Ways to Use Induction and Symmetry in the Verification.. - Calder, Miller (2002)
(Correct)
From Asymmetry to Full Symmetry: New Techniques for Symmetry .. - Emerson, Trefler (1999)
(Correct)
Virtual Symmetry Reduction - Emerson, Havlicek, Trefler (2000)
(Correct)
Active bibliography (related documents): More All
0.2: How to Calculate Symmetries of Petri nets - Schmidt (1997)
(Correct)
0.1: Integrating Low Level Symmetries into Reachability Analysis - Schmidt (1999)
(Correct)
0.1: Conflict Sets in Colored Petri Nets - Dutheillet, Haddad (1993)
(Correct)
Similar documents based on text: More All
0.6: Synthesis of Agents for Web Services Interaction - Melliti, Haddad
(Correct)
0.5: Fairness and Priority in Progress Property Analysis - Giannakopoulou, Magee, Kramer (1999)
(Correct)
0.5: Checking Progress with Action Priority: Is it Fair? - Giannakopoulou, Magee, Kramer (1999)
(Correct)
Related documents from co-citation: More All
10: Exploiting Symmetry in Temporal Logic Model Checking (context) - Clarke, Filkorn et al. - 1993
8: Utilizing symmetry when model-checking under fairness assumptions: an automata-t..
- Emerson, Sistla - 1997
8: Symmetry and Model Checking
- Emerson, Jutla - 1993
BibTeX entry: (Update)
K. Ajami, S. Haddad and J-M. Ili'e. Exploiting symmetry in linear time temporal logic model checking: One step beyond. In Steffen [23], pages 52--67. http://citeseer.ist.psu.edu/ajami98exploiting.html More
@article{ ajami98exploiting,
author = "K. Ajami and S. Haddad and J-M. Ili{\'e}",
title = "Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond",
journal = "Lecture Notes in Computer Science",
volume = "1384",
pages = "52--??",
year = "1998",
url = "citeseer.ist.psu.edu/ajami98exploiting.html" }
Citations (may not include all citations):
1180
The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
725
Temporal and Modal Logic (context) - Emerson - 1990
502
Concurrency and Automata on Infinite Sequences (context) - Park - 1984
142
Simple On-the-fly Automatic Verification of linear Temporal ..
- Gerth, Peled et al. - 1995
128
An Automata-theoretic approach to linear temporal logic
- Vardi - 1996
115
Exploiting Symmetry In Temporal Logic Model Checking (context) - Clarke, Filkorne et al. - 1993
112
Memory Efficient Algorithms for the Verification of Temporal..
- Courcoubetis, Vardi et al. - 1990
101
Better Verification Through Symmetry
- IP, Dill
77
Symmetry and Model Checking
- Emerson, Sistla - 1993
77
Symmetry and Model Checking
- Emerson, Sistla - 1996
54
High Level Petri Nets, Theory and Application (context) - Jensen, Rozenberg - 1991
49
Utilizing Symmetry when Model Checking under Fairness Assump..
- Emerson, Sistla - 1995
13
Alternating Automata and Program Verification
- Vardi - 1995
7
Symbolic Reachability Graph and Partial Symmetries
- Haddad, Ili et al. - 1995
7
On Well-formed Colored Nets and their Symbolic Reachability .. (context) - Chiola, Dutheillet et al. - 1990
1
Verification Tools for Finit-State Concurrent Systems (context) - Clarke, Grumberg et al. - 1994
1
Permutable Agents and Process Algebra (context) - Michel, Azma et al. - 1996
1
Modalities for Model Checking: Branching Time Stricks Back (context) - Emerson, Lei - 1985
1
Model Checking through the Symbolic Reachability Graph (context) - Ili, Ajami - 1997
1
Symmetry Calculation (context) - Schmidt - 1995
1
Fixed points of Bchi automata (context) - Dam - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lamsade.dauphine.fr/~haddad/publis.html): More
A Structural Approach to Design Reliable Distributed.. - Taghelit, Haddad, Sens (1997)
(Correct)
Reaching Agreement in Hierarchical Groups - Kooh, Haddad (1999)
(Correct)
A Formal Study of Interactions in Multi-agent Systems - Fallah-Seghrouchni.. (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC