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
50
views
43
references
Top references
cited by
11
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,572
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Formal Methods for Eternal Networked Software Systems
Introduction to Active Automata Learning from a Practical Perspective
other
Author(s):
Bernhard Steffen
,
Falk Howar
,
Maik Merten
Publication date
(Print):
2011
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
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
An Introduction to SAXS
Most cited references
43
Record
: found
Abstract
: not found
Article
: not found
Testing Software Design Modeled by Finite-State Machines
T.S. Chow
(1978)
0
comments
Cited
89
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
John Hopcroft
(1971)
0
comments
Cited
81
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book
: not found
An Introduction to Computational Learning Theory
Michael Kearns
,
Umesh Vazirani
(1994)
0
comments
Cited
67
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 256-296
DOI:
10.1007/978-3-642-21455-4_8
SO-VID:
b549f11a-9b83-4179-89a4-65d9cb1af324
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 53
Automated Verification Techniques for Probabilistic Systems
pp. 256
Introduction to Active Automata Learning from a Practical Perspective
Similar content
2,572
A Hierarchy of Polynomial-Time Computable Simulations for Automata
Authors:
Kousha Etessami
Looking for Complexity at Phase Boundaries in Continuous Cellular Automata
Authors:
Vassilis Papadopoulos
,
Guilhem Doat
,
Arthur Renard
…
Ergodic properties of certain surjective cellular automata
Authors:
Mark Shereshevsky
See all similar
Cited by
11
Inferring Canonical Register Automata
Authors:
Falk Howar
,
Bernhard Steffen
,
Bengt. Jonsson
…
Combining Model Learning and Model Checking to Analyze TCP Implementations
Authors:
Paul Fiterău-Broştean
,
Ramon R.T. Janssen
,
Frits Vaandrager
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
Authors:
Malte Isberner
,
Falk Howar
,
Bernhard Steffen
See all cited by