Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Inferring regular languages and ω-languages
D Fisman - Journal of Logical and Algebraic Methods in …, 2018 - Elsevier
In 1987 Angluin proposed an algorithm, termed L⁎ for inferring an unknown regular
language using membership and equivalence queries. This algorithm has found many …
language using membership and equivalence queries. This algorithm has found many …
A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
In this paper, we propose a novel algorithm to learn a Büchi automaton from a teacher who
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …
knows an ω-regular language. The learned Büchi automaton can be a nondeterministic …
Learning by sampling: learning behavioral family models from software product lines
Family-based behavioral analysis operates on a single specification artifact, referred to as
family model, annotated with feature constraints to express behavioral variability in terms of …
family model, annotated with feature constraints to express behavioral variability in terms of …
[PDF][PDF] Families of DFAs as Acceptors of -Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ωregular languages.
The motivation for introducing them was a desired correlation between the automaton states …
The motivation for introducing them was a desired correlation between the automaton states …
Learning to prove safety over parameterised concurrent systems
We revisit the classic problem of proving safety over parameterised concurrent systems, ie,
an infinite family of finite-state concurrent systems that are represented by some finite …
an infinite family of finite-state concurrent systems that are represented by some finite …
CALF: categorical automata learning framework
G van Heerdt, M Sammartino, A Silva - ar** Behavioral Programs Alive: Specifying and Executing Liveness Requirements
One of the benefits of using executable specifications such as Behavioral Programming (BP)
is the ability to align the system implementation with its requirements. This is facilitated in BP …
is the ability to align the system implementation with its requirements. This is facilitated in BP …
PAC learning-based verification and model synthesis
We introduce a novel technique for verification and model synthesis of sequential programs.
Our technique is based on learning an approximate regular model of the set of feasible …
Our technique is based on learning an approximate regular model of the set of feasible …
ROLL 1.0:-regular language learning library
Abstract We present ROLL 1.0, an ω-regular language learning library with command line
tools to learn and complement Büchi automata. This open source Java library implements all …
tools to learn and complement Büchi automata. This open source Java library implements all …
Model checker execution reports
R Castaño, V Braberman… - 2017 32nd IEEE/ACM …, 2017 - ieeexplore.ieee.org
Software model checking constitutes an undecidable problem and, as such, even an ideal
tool will in some cases fail to give a conclusive answer. In practice, software model checkers …
tool will in some cases fail to give a conclusive answer. In practice, software model checkers …