See this document in CiteSeerX!

Using Asynchronous Buchi Automata for Efficient Automatic  (Make Corrections)  
Verification of Concurrent Systems Doron Peled ATT Bell Laboratories 600...



  Home/Search   Context   Related

 
View or download:
ipipan.waw.pl/~penczek/W...pstv96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ipipan.waw.pl/~pencze...allpapers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: An Asynchronous Buchi Automaton is a collection of concurrently executing automata, able to perform operations that are shared between one or more of their concurrent components. These automata can be used to specify properties of distributed protocols. In this paper, an efficient method for verifying that a protocol satisfies its Asynchronous Buchi Automaton specification is presented. In order to alleviate a potential state space explosion while verifying a protocol, a state reduction... (Update)

Active bibliography (related documents):   More   All
0.8:   Using Asynchronous Buchi Automata for Efficient Automatic.. - Peled, Penczek   (Correct)
0.5:   A Partial Order Approach to Branching Time Logic Model.. - Gerth, Kuiper, Peled.. (1997)   (Correct)
0.3:   On the complementation of asynchronous cellular Büchi automata - Muscholl   (Correct)

Similar documents based on text:   More   All
0.4:   Axiomatizations of Temporal Logics on Trace Systems - Wojciech Penczek Depart (1993)   (Correct)
0.3:   Model-Checking of Causality Properties - Alur, Peled, Penczek (1995)   (Correct)
0.3:   A Hierarchy of Partial Order Temporal Properties - Kwiatkowska, Peled, al. (1994)   (Correct)

BibTeX entry:   (Update)

@misc{ concurrent-using,
  author = "Verification Of Concurrent",
  title = "Using Asynchronous Buchi Automata for Efficient Automatic",
  url = "citeseer.ist.psu.edu/716805.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1097   Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
374   Automata on Infinite Objects (context) - Thomas - 1990
230   Checking that finite-state concurrent programs satisfy their.. (context) - Lichtenstein, Pnueli - 1984
207   A Stubborn attack on state explosion (context) - Valmari - 1991
176   a decision method in restricted second order arithmetic (context) - Buchi - 1960
108   An Improvement in Formal Verification - Holzmann, Peled - 1994
108   Combining Partial Order Reductions with On-the-fly Model-Che.. (context) - Peled - 1994
106   A Partial Approach to Model Checking - Godefroid, Wolper - 1991
71   Reasoning about infinite computation paths (context) - Wolper, Vardi et al. - 1983
61   Prentice Hall Software Series (context) - Holzmann, Validation et al. - 1992
56   fly verification with stubborn sets (context) - Valmari - 1993
47   Theoretical Computer Science (context) - Pnueli, Logic et al. - 1977
47   A Trace Based Extension of Linear Time Temporal Logic (context) - Thiagarajan - 1994
38   Interleaving Set Temporal Logic (context) - Katz, Peled - 1987
17   Informatique Theorique et Applications (context) - Zielonka, finite et al. - 1987
16   Event Fairness and Non-Interleaving Concurrency (context) - Kwiatkowska - 1989
16   Temporal Logics on Trace Systems: On automated verification (context) - Penczek - 1993
13   Asynchronous Automata for Infinite Traces (context) - Gastin, Petit - 1992
8   A Partial Order Approach to Branching Time Model Checking (context) - Gerth, Kuiper et al. - 1995
4   the Complementation of Buchi Asynchronous Cellular Automata (context) - Muscholl - 1994
2   Advances in Petri Nets (context) - Mazurkiewicz, Theory

Documents on the same site (http://www.ipipan.waw.pl/~penczek/WPenczek/allpapers.html):   More
Model Checking for Modal Logics (Extended Abstract) - Penczek (2001)   (Correct)
Towards Formal Specification and Verification in Cyberspace - Ambroszkiewicz, Penczek.. (2000)   (Correct)
A Complete Axiomatization of a First-Order Temporal Logic.. - Penczek, Srebrny (1996)   (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