Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
27
views
27
references
Top references
cited by
12
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,002
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Testing Software and Systems
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction
other
Author(s):
Fides Aarts
,
Bengt Jonsson
,
Johan Uijen
Publication date
(Print):
2010
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Further versions
open (via free pdf)
Powered by
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
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
JMIR: Research Protocols
Most cited references
27
Record
: found
Abstract
: not found
Article
: not found
Language identification in the limit
E Gold
(1967)
0
comments
Cited
228
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Counterexample-guided abstraction refinement for symbolic model checking
Edmund Clarke
,
Orna Grumberg
,
Somesh Jha
…
(2003)
0
comments
Cited
92
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
An Introduction to Computational Learning Theory
Michael Kearns
,
Umesh Vazirani
(1994)
0
comments
Cited
66
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2010
Pages
: 188-204
DOI:
10.1007/978-3-642-16573-3_14
SO-VID:
2f5c1311-4c14-4c6f-98ab-08eb74cf4416
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 95
Black-Box System Testing of Real-Time Embedded Systems Using Random and Search-Based Testing
pp. 188
Generating Models of Infinite-State Communication Protocols Using Regular Inference with Abstraction
Similar content
2,002
On infinite transition graphs having a decidable monadic theory
Authors:
Didier Caucal
Formal Reasoning on Infinite Data Values: An Ongoing Quest
Authors:
Taolue Chen
,
Fu Qiang Song
,
Zhilin Wu
Infinitely small quantities in Cauchy's textbooks
Authors:
Detlef Laugwitz
See all similar
Cited by
12
Inferring Canonical Register Automata
Authors:
Falk Howar
,
Bernhard Steffen
,
Bengt. Jonsson
…
Introduction to Active Automata Learning from a Practical Perspective
Authors:
Bernhard Steffen
,
Falk Howar
,
Maik Merten
Symbolic Learning of Component Interfaces
Authors:
Dimitra Giannakopoulou
,
Zvonimir Rakamarić
,
Vishwanath Raman
See all cited by