Gaoyan Xie, Cheng Li, Zhe Dang  Home/Search
Context
Related
| wsu.edu/~zdang/papers/cchecker5.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: wsu.edu/~zdang/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Gaoyan Xie, Cheng Li and Zhe Dang School of Electrical Engineering and Computer Science Washington State University Pullman, WA 99164, USA Abstract. The linear reachability problem is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using results on minimal solutions (in nonnegative integers) for linear Diophantine systems, we obtain new complexity results for the problem, ... (Update)
Active bibliography (related documents): More All
1.1: Linear Reachability Problems and Minimal Solutions to Linear.. - Xie, Li, Dang (2004) (Correct)
0.3: Composability of Infinite-State Activity Automata - Dang, Ibarra, Su (Correct)
0.3: Unification Theory - Baader, Snyder (1999) (Correct)
Similar documents based on text: More All
0.5: Testability of Oracle Automata (Extended Abstract) - Xie, Li, Dang (Correct)
0.2: Dense Counter Machines and Verification Problems - Xie, Dang, Ibarra, Pietro (Correct)
0.2: Solving Linear Diophantine Constraints Incrementally - Contejean (1993) (Correct)
BibTeX entry: (Update)
@misc{ xie-new,
author = "Gaoyan Xie and Cheng Li and Zhe Dang",
title = "New Complexity Results for Some Linear Counting Problems Using Minimal
Solutions to Linear Diophantine Equations",
url = "citeseer.ist.psu.edu/698251.html" }
Citations (may not include all citations):1911 Introduction to Automata theory (context) - Hopcroft, Ullman - 1979
1097 Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
666 Theoretical Computer Science (context) - Alur, Dill et al. - 1994
603 Kluwer Academic Publishers (context) - McMillan, Checking - 1993
539 The temporal logic of programs (context) - Pnueli - 1977
434 An automata-theoretic approach to automatic program verifica.. (context) - Vardi, Wolper - 1986
368 analysis and applications (context) - Murata, Properties - 1989
244 Symbolic model checking without BDDs - Biere, Cimatti et al. - 1999
206 The model checker SPIN - Holzmann - 1997
172 A really temporal logic - Alur, Henzinger - 1994
85 Patterns in property specifications for finite-state verific.. - Dwyer, Avrunin et al. - 1999
64 On context-free languages (context) - Parikh - 1966
37 Timed automata and the theory of real numbers - Comon, Jurski - 1999
30 Binary reachability analysis of discrete pushdown timed auto.. - Dang, Ibarra et al. - 2000
24 Bounds on positive integral solutions of linear diophantine .. (context) - Borosh, Treybig - 1976
21 Solving systems of linear diophantine equations: an algebrai.. - Domenjoud - 1991
16 the verification problem of nonregular properties for nonreg.. (context) - Bouajjani, Echahed et al. - 1995
16 On Presburger Liveness of Discrete Timed Automata - Dang, Pietro et al. - 2001
9 Binary reachability analysis of pushdown timed automata with.. - Dang - 2001
5 Small solutions of linear diophantine equations (context) - Borosh, Flahive et al. - 1986
3 Liveness Verification of Reversal-bounded Multicounter Machi.. - Dang, Ibarra et al.
3 Minimal solutions of linear diophantine equations: Bounds an.. (context) - Pottier - 1991
Documents on the same site (http://www.eecs.wsu.edu/~zdang/index.html): More
Binary Reachability Analysis of Pushdown Timed Automata with Dense .. - Dang (Correct)
On Presburger Liveness of Discrete Timed Automata - Dang, Pietro, Kemmerer (2001) (Correct)
Decidable Approximations on Generalized and Parameterized .. - Dang, Ibarra, Kemmerer (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