E.A. Emerson, A.P. Sistla  Home/Search
Context
Related
| uic.edu/~sistla/mucal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uic.edu/~sistla/interest_fm (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we consider the problem of modelchecking for different fragments of propositional ¯-calculus. This logic was studied by many authors [6, 9] for specifying the properties of concurrent programs. It has been shown to be as expressive of automata on infinite trees. Most of the known temporal and dynamic logics can be translated into this logic. The modelchecking problem for this logic was first considered in [7]. In this paper, the authors presented an algorithm that is O((mn) (Update)
Active bibliography (related documents): More All
0.5: Verification of Temporal and Real-Time Properties of Statecharts - Levi (1997) (Correct)
0.2: Local Model Checking for Value-passing Processes (Extended.. - Rathke, Hennessy (Correct)
0.2: Strict Lower Bounds for Model Checking BPA - Mayr (1998) (Correct)
Similar documents based on text: More All
0.7: Real-Time Model-Checking: Parameters Everywhere - Bruyère (Correct)
0.4: Multi-Valued Symbolic Model-Checking: Fairness.. - Gurfinkel (2003) (Correct)
0.4: Generalized Model-Checking Over Locally Tree-Decomposable Classes - Frick (Correct)
BibTeX entry: (Update)
@inproceedings{ emerson93,
author = {E. Allen Emerson and
Charanjit S. Jutla and
A. Prasad Sistla},
title = {On Model-Checking for Fragments of -Calculus.},
booktitle = {CAV},
year = {1993},
pages = {385-396},
url = {citeseer.ist.psu.edu/emerson95modelchecking.html} }
Citations (may not include all citations):1097 Automatic Verification of finitestate Concurrent Systems Usi.. (context) - Clarke, Emerson et al. - 1986
165 Theoretical Computer Science (context) - Kozen, propositional - 1983
60 An automata theoretic decision procedure for Propositional ¯.. (context) - Streett, Emerson - 1984
19 Yet Another Process Logic (context) - Vardi, Wolper - 1983
4 Local model-checking in modal ¯-calculus (context) - Stirling, Walker - 1989
2 A linear-time model-checking for alternation free modal ¯-ca.. (context) - Cleaveland, Steffen - 1991
1 Faster model-checking for modal ¯-calculus (context) - Cleaveland, Steffen - 1991
1 Fixed point characterization properties of parallel programs (context) - Emerson, Clarke - 1980
1 Efficient model-checking in fragments of ¯-calculus (context) - Emerson, Leis - 1986
1 Science of Computer Programming (context) - Emerson, Leis et al. - 1987
1 Proceddings of 5th Annual Symposium on Logic in Computer Sci.. (context) - Burch, Clarke et al. - 1990
1 Tableu-based modelchecking in the propositional ¯-calculus (context) - Cleaveland - 1990
Documents on the same site (http://www.eecs.uic.edu/~sistla/interest_fm.html): More
Utilizing Symmetry when Model Checking under Fairness.. - Emerson, Sistla (1999) (Correct)
Parameterized verification of Linear networks using Automata.. - Prasad Sistla (1997) (Correct)
On-the-Fly Model checking under Fairness that Exploits Symmetry - Gyuris, Sistla (1997) (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