Kleene algebras with tests provide a natural framework for equational specification and verification. Kleene algebras with tests and related systems have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. The equational theory of Kleene algebras with tests has been shown to be decidable in at most exponential time by an efficient reduction to Propositional Dynamic Logic. In this paper we prove that the theory is PSPACE-complete. 1
|
2771
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
285
|
Propositional dynamic logic of regular programs
– Fischer, Ladner
- 1979
|
|
258
|
Representation of events in nerve nets and finite automata
– Kleene
- 1956
|
|
200
|
Word problems requiring exponential time: Preliminary report
– Stockmeyer, Meyer
- 1973
|
|
187
|
Regular Algebra and Finite Machines
– Conway
- 1971
|
|
177
|
On the calculus of relations
– Tarski
- 1941
|
|
127
|
Logics of Programs
– Kozen, Tiuryn
- 1990
|
|
110
|
A completeness theorem for Kleene algebras and the algebra of regular events
– Kozen
- 1994
|
|
105
|
The Design and Analysis of Algorithms
– Kozen
- 1992
|
|
52
|
Two complete axiom systems for the algebra of regular events
– Salomaa
- 1966
|
|
43
|
Action logic and pure induction
– Pratt
- 1990
|
|
28
|
On defining relations for the algebra of regular events
– Redko
- 1964
|
|
26
|
Complete systems of B-rational identities
– Krob
- 1991
|
|
25
|
Relation Algebras with Transitive Closure
– Ng
- 1984
|
|
22
|
On induction vs. *-continuity
– Kozen
- 1981
|
|
22
|
The Kleene and Parikh Theorem in complete semirings
– Kuich
- 1987
|
|
17
|
A semiring on convex polygons and zero-sum cycle problems
– Iwano, Steiglitz
- 1990
|
|
17
|
On Kleene algebras and closed semirings
– Kozen
- 1990
|
|
17
|
Kleene algebra with tests: Completeness and decidability
– Kozen, Smith
- 1996
|
|
15
|
On folk theorems
– Harel
- 1980
|
|
13
|
Equational axioms for regular sets
– Bloom, Z
- 1993
|
|
13
|
Using Kleene algebra to reason about concurrency control
– Cohen
- 1994
|
|
12
|
Closure algorithms and the star-height problem of regular languages
– Backhouse
- 1975
|
|
12
|
and Arto Salomaa, Semirings, automata, languages
– Kuich
- 1986
|
|
10
|
Une remarque sur les systèmes complets d’identités rationnelles
– Boffa
- 1990
|
|
9
|
Kleene algebra with tests and commutativity conditions
– Kozen
- 1996
|
|
8
|
On the complexity of reasoning in Kleene algebra
– Kozen
|
|
7
|
On the decidability of some problems about rational subsets of free partially commutative monoids
– Gibbons, Rytter
- 1986
|
|
5
|
On the algebra of regular expressions
– Anderaa
- 1965
|
|
5
|
A new finite complete solvable quasiequational calculus for algebra of regular languages
– Archangelsky
- 1992
|
|
5
|
Kleene's theorem revisited: A formal path from Kleene to Chomsky
– Sakarovitch
- 1987
|
|
3
|
General theory of flowcharts
– Hirose, Oya
- 1972
|
|
3
|
Algorithmic Logic and its Applications
– Mirkowska
- 1972
|
|
2
|
Rational data structures and their applications
– Gorshkov
- 1989
|
|
1
|
algebra with tests and commutativity conditions
– Kleene
|
|
1
|
Transductions and Context-free Languages. Teubner
– thesis, College, et al.
- 1979
|
|
1
|
Flow diagrams, Turing machines, and languages with only two formation rules
– ohm, C, et al.
- 1966
|
|
1
|
Hypotheses in Kleene algebra. Bellcore
– Cohen
- 1994
|
|
1
|
Lazy caching. Bellcore
– Cohen
- 1994
|
|
1
|
Kleene Algebra with Tests \Delta 17
– Pratt
- 1988
|
|
