There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 11

Record: found
Abstract: not found
Book Chapter: not found

Learning Assumptions for Compositional Verification

Jamieson Cobleigh, Dimitra Giannakopoulou, Corina Pasareanu (2003)

0 comments Cited 44 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Inference of Finite Automata Using Homing Sequences

R.L. Rivest, R.E. Schapire (1993)

0 comments Cited 34 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Minimizing the Number of States in Incompletely Specified Sequential Switching Functions

M. Paull, S H Unger (1959)

0 comments Cited 20 times – based on 0 reviews      Review now

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2009

Pages: 31-45

DOI: 10.1007/978-3-642-00768-2_3

SO-VID: 73d19374-332e-4cc0-b75c-80557f562a0c

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 6

See all cited by

Learning Minimal Separating DFA’s for Compositional Verification

Read this book at

Related collections

Multimodal Learning Material

Most cited references 11

Learning Assumptions for Compositional Verification

Inference of Finite Automata Using Homing Sequences

Minimizing the Number of States in Incompletely Specified Sequential Switching Functions

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 2,167

Cited by 6