An experience in proving regular networks of processes by modular model checking

This publication has 16 references indexed in Scilit:

• Symbolic model checking: 1020 States and beyond
  Published by Elsevier ,2004
• Compositional model checking
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• “On the fly” verification of behavioural equivalences and preorders
  Published by Springer Nature ,1992
• Compositional minimization of finite state systems
  Published by American Mathematical Society (AMS) ,1991
• The synchronous data flow programming language LUSTRE
  Proceedings of the IEEE, 1991
• LUSTRE: a declarative language for real-time programming
  Published by Association for Computing Machinery (ACM) ,1987
• Graph-Based Algorithms for Boolean Function Manipulation
  IEEE Transactions on Computers, 1986
• Limits for automatic verification of finite-state concurrent systems
  Information Processing Letters, 1986
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• Reasoning about networks with many identical finite-state processes
  Published by Association for Computing Machinery (ACM) ,1986