Learning Pomset Automata

  title={Learning Pomset Automata},
  author={Gerco van Heerdt and Tobias Kapp'e and Jurriaan Rot and Alexandra Silva},
  journal={Foundations of Software Science and Computation Structures},
  pages={510 - 530}
We extend the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathtt {L}^{\!\star }$$\end{document}L⋆ algorithm to learn bimonoids recognising pomset languages. We then identify a class of pomset automata that accepts precisely the class of pomset languages recognised by bimonoids and show how to convert between… 
A Categorical Framework for Learning Generalised Tree Automata
This paper instantiate the abstract theory to a large class of Set functors, by which it is recovered for the first time practical tree automata learning algorithms from an abstract framework and at the same time obtain new algorithms to learn algebras of quotiented polynomial functors.
Active Learning for Sound Negotiations
Two active learning algorithms for sound deterministic negotiations are presented, both of which have similar complexity to Angluin’s 𝐿 ∗ algorithm, in particular, the number of queries is polynomial in the size of the negotiation, and not in theNumber of configurations.


A Kleene Iteration for Parallelism
Rational expressions are defined, a natural generalization of the usual ones over words, and a Kleene theorem connecting them to regular languages (accepted by finite branching automata) is proved, showing that recognizable languages are strictly weaker.
On the learnability of infinitary regular sets
A polynomial algorithm for learning a sub-class of the ω-regular sets from membership queries and counter-examples based on the framework suggested by Angluin for learning regular subsets of Σ*.
On Series-Parallel Pomset Languages: Rationality, Context-Freeness and Automata
Learning I/O Automata
It is shown that, by exploiting links between three widely used modeling frameworks for reactive systems, any tool for active learning of Mealy machines can be used for learning I/O automata that are deterministic and output determined.
Series-parallel languages and the bounded-width property
Angluin Learning via Logic
A generalisation of Angluin’s original algorithm from DFAs to coalgebras for an arbitrary finitary set functor T in the following sense: given a (possibly infinite) pointed T-coalgebra that the authors assume to be regular, they learn its finite representation by asking “logical queries” and making conjectures to which the teacher has to reply with a counterexample.
Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages
A new automaton model and a Kleene-like theorem are presented that relates a relaxed version of CKA to series-parallel pomset languages, which are a natural candidate for the free model.
Learning the Language of Error
Angluin’s \(L^*\) algorithm is harnessed for learning a deterministic finite automaton that describes the possible scenarios under which a given program error occurs and an abstract visual representation of errors and of program segments is presented.
The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning
The distinguishing characteristic of TTT is its redundancy-free organization of observations, which can be exploited to achieve optimal (linear) space complexity, thanks to a thorough analysis of counterexamples, extracting and storing only the essential refining information.
The Equational Theory of Pomsets