Quantitative Analysis of Counterexample Generation for Automata Learning

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: RWTH Aachen University, Bachelorarbeit, 2020

Event: Veröffentlichung

(where): Aachen

(who): Universitätsbibliothek der RWTH Aachen

(when): 2020

Creator: Le, Dan-Tuong

Contributor: Moerman, Joshua
Katoen, Joost-Pieter
Noll, Thomas

DOI: 10.18154/RWTH-2020-06326

URN: urn:nbn:de:101:1-2020082707514044315122

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 14.08.2025, 10:52 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Le, Dan-Tuong
Moerman, Joshua
Katoen, Joost-Pieter
Noll, Thomas
Universitätsbibliothek der RWTH Aachen

Time of origin

2020

Other Objects (12)

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Quantitative Analysis of Counterexample Generation for Automata Learning

Object Details

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Towards Concurrent Quantitative Separation Logic

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Towards Concurrent Quantitative Separation Logic

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Towards Concurrent Quantitative Separation Logic

Towards Concurrent Quantitative Separation Logic

Learning probabilistic automata with SMT solving

Automata-based model checking of recursive systems

Model checking pPDA vs unambiguous automata

Invariant-based strategy synthesis for nondeterministic probabilistic programs

Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs

Synthesizing FDIR recovery strategies for space systems

Compositional control-flow reduction for probabilistic model checking

Proving termination of pointer programs on top of symbolic execution

Most probable explanations in Bayesian Networks via weighted programming

Combining integer programs and graph grammars: Theory and implementation in Attestor

Related objects

Reset password