## Abstract

We develop an automata-theoretic framework for reasoning about infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisfies a temporal property can then be done by an alternating two-way tree automaton that navigates through the tree. As has been the case with finite-state systems, the automata-theoretic framework is quite versatile. We demonstrate it by solving several versions of the model-checking problem for µ-calculus specifications and prefix-recognizable systems, and by solving the realizability and synthesis problems for µ-calculus specifications with respect to prefix-recognizable environments.

Original language | English |
---|---|

Title of host publication | Computer Aided Verification - 12th International Conference, CAV 2000, Proceedings |

Editors | E. Allen Emerson, A. Prasad Sistla |

Publisher | Springer Verlag |

Pages | 36-52 |

Number of pages | 17 |

ISBN (Print) | 3540677704 |

DOIs | |

State | Published - 2000 |

Event | 12th International Conference on Computer Aided Verification, CAV 2000 - Chicago, United States Duration: 15 Jul 2000 → 19 Jul 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1855 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 12th International Conference on Computer Aided Verification, CAV 2000 |
---|---|

Country/Territory | United States |

City | Chicago |

Period | 15/07/00 → 19/07/00 |

### Bibliographical note

Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.