See this document in CiteSeerX!

State Space Reduction Using Partial τ-Confluence (2000)  (Make Corrections)  (1 citation)
Jan Friso Groote, et al.
Mathematical Foundations of Computer Science



  Home/Search   Context   Related

 
View or download:
cwi.nl/~vdpol/papers/locconf.ps.Z
Cached:  PDF   PS.gz  PS  Image  Update  Help

From:  cwi.nl/~vdpol/papers (more)
(Enter author homepages)

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

Abstract: We present an efficient algorithm to determine the maximal class of confluent -transitions in a labelled transition system. Confluent -transitions are inert with respect to branching bisimulation. This allows to use -priorisation, which means that in a state with a confluent outgoing -transition all other transitions can be removed, maintaining branching bisimulation. In combination with the removal of -loops, and the compression of -sequences this yields an efficient algorithm to reduce... (Update)

Similar documents based on text:   More   All
0.5:   Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2003)   (Correct)
0.3:   An Efficient Algorithm for Branching Bisimulation and.. - Groote, Vaandrager (1990)   (Correct)
0.3:   JITty: a rewriter with strategy annotations - Pol   (Correct)

BibTeX entry:   (Update)

J. F. Groote and J. van de Pol. State space reduction using partial tau-confluence. In Mathematical Foundations of Computer Science, number 1893 in LNCS, 2000. http://citeseer.ist.psu.edu/groote00state.html   More

@inproceedings{ groote00state,
    author = "Jan Friso Groote and Jaco van de Pol",
    title = "State Space Reduction Using Partial tau-Confluence",
    booktitle = "Mathematical Foundations of Computer Science",
    pages = "383-393",
    year = "2000",
    url = "citeseer.ist.psu.edu/groote00state.html" }
Citations (may not include all citations):
484   A calculus of Communicating Systems (context) - Milner - 1980
452   Data structures and algorithms (context) - Aho, Hopcroft et al. - 1983
447   Prentice Hall International (context) - Milner, Concurrency - 1989
207   A stubborn attack on state explosion (context) - Valmari - 1990
136   Information and Computation (context) - Kanellakis, Smolka et al. - 1990
106   A partial approach to model checking - Godefroid, Wolper - 1994
78   Branching time and abstraction in bisimulation semantics (context) - van Glabbeek, Weijland
29   A correctness proof of a one bit sliding window protocol in .. - Bezem, Groote - 1994
25   An efficient algorithm for branching bisimulation and stutte.. - Groote, Vaandrager - 1990
22   Description and formal specification of the link layer of P - Luttik - 1997
12   Confluence of Processes and Systems of Objects (context) - Liu, Walker - 1995
11   Confluence for Process Verification - Groote, Sellink - 1996
7   Typing Confluence - Nestmann, Steffen - 1997
5   Linearity and the -calculus (context) - Kobayashi, Pierce et al. - 1996
1   The bcg min user manual Version (context) - Cherif, Garavel et al. - 1999

[Article contains additional citations not shown here]

Documents on the same site (http://www.cwi.nl/~vdpol/papers):   More
Modularity in Many-sorted Term Rewriting Systems - Pol (1993)   (Correct)
A Bounded Retransmission Protocol for Large Data Packets. A .. - Groote, van der Pol (1993)   (Correct)
Operational Semantics of Rewriting with Priorities - Pol (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