On model checking for non-deterministic infinite-state systems

This publication has 20 references indexed in Scilit:

• General decidability theorems for infinite-state systems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A new approach for the verification of cache coherence protocols
  IEEE Transactions on Parallel and Distributed Systems, 1995
• Reasoning about rings
  Published by Association for Computing Machinery (ACM) ,1995
• Reduction and covering of infinite reachability trees
  Information and Computation, 1990
• Automata on Infinite Objects
  Published by Elsevier ,1990
• An automata theoretic decision procedure for the propositional mu-calculus
  Information and Computation, 1989
• The complementation problem for Büchi automata with applications to temporal logic
  Theoretical Computer Science, 1987
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• Checking that finite state concurrent programs satisfy their linear specification
  Published by Association for Computing Machinery (ACM) ,1985
• The covering and boundedness problems for vector addition systems
  Theoretical Computer Science, 1978