DeepAI AI Chat

Active Learning for Sound Negotiations

10/06/2021

∙

by Anca Muscholl, et al.

∙

∙

We present two active learning algorithms for sound deterministic negotiations. Sound deterministic negotiations are models of distributed systems, a kind of Petri nets or Zielonka automata with additional structure. We show that this additional structure allows to minimize such negotiations. The two active learning algorithms differ in the type of membership queries they use. Both have similar complexity to Angluin's L* algorithm, in particular, the number of queries is polynomial in the size of the negotiation, and not in the number of configurations.

Anca Muscholl
5 publications
Igor Walukiewicz
6 publications

page 1

page 2

page 3

page 4

∙ 04/23/2021

Active Learning of Sequential Transducers with Side Information about the Domain

Active learning is a setting in which a student queries a teacher, throu...

0 Raphaël Berthon, et al. ∙

∙ 01/22/2013

Active Learning on Trees and Graphs

We investigate the problem of active learning on a given tree whose node...

0 Nicolò Cesa-Bianchi, et al. ∙

∙ 07/19/2023

Learning Formal Specifications from Membership and Preference Queries

Active learning is a well-studied approach to learning formal specificat...

0 Ameesh Shah, et al. ∙

∙ 12/06/2019

A quantum active learning algorithm for sampling against adversarial attacks

Adversarial attacks represent a serious menace for learning algorithms a...

0 P. A. M. Casares, et al. ∙

∙ 11/25/2018

HS^2: Active Learning over Hypergraphs

We propose a hypergraph-based active learning scheme which we term HS^2,...

0 I Chien, et al. ∙

∙ 06/28/2019

L*-Based Learning of Markov Decision Processes (Extended Version)

Automata learning techniques automatically generate system models from t...

0 Martin Tappler, et al. ∙

∙ 09/10/2018

Learning Time Dependent Choice

We explore questions dealing with the learnability of models of choice o...

0 Zachary Chase, et al. ∙