Three partition refinement algorithms
SIAM Journal on Computing
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Term rewriting and all that
Communication and Concurrency
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Proceedings of the 9th International Conference on Computer Aided Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Proceedings of the 10th International Conference on Computer Aided Verification
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Proceedings of the 12th International Conference on Computer Aided Verification
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Transitive Closures of Regular Relations for Verifying Infinite-State Systems
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Symbolic Model Checking with Rich ssertional Languages
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Compositional Minimization of Finite State Systems
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Extrapolating Tree Transformations
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Approximated Context-Sensitive Analysis for Parameterized Verification
FMOODS '09/FORTE '09 Proceedings of the Joint 11th IFIP WG 6.1 International Conference FMOODS '09 and 29th IFIP WG 6.1 International Conference FORTE '09 on Formal Techniques for Distributed Systems
Constrained monotonic abstraction: a CEGAR for parameterized verification
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Computing transitive closures of hedge transformations
International Journal of Critical Computer-Based Systems
Simulation-Based iteration of tree transducers
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Verification of tree updates for optimization
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Computing transitive closures of hedge transformations
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Enhancing approximations for regular reachability analysis
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the transitional semantics of the system consequently can be modeled by finite-state transducers. A standard problem encountered when doing symbolic state exploration for infinite state systems is how to explore all states in a finite amount of time. When representing the one-step transition relation of a system by a finite-state transducer Τ, this problem boils down to finding an appropriate finite-state representation Τ* for its transitive closure. In this paper we give a partial algorithm to compute a finite-state transducer Τ* for a general class of transducers. The construction builds a quotient of an underlying infinite-state transducer Τ, using a novel behavioural equivalence that is based past and future bisimulations computed on finite approximations of Τ. The extrapolation to Τ of these finite bisimulations capitalizes on the structure of the states of Τ, which are strings of states of Τ. We show how this extrapolation may be rephrased as a problem of detecting confluence properties of rewrite systems that represent the bisimulations. Thus, we can draw upon techniques that have been developed in the area of rewriting. A prototype implementation has been successfully applied to various examples.