output
20232026
most citedA higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems

6 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.FLShow all

5 papers · 1 filter

cs.FL2023★ 1 cited

Feasability of Learning Weighted Automata on a Semiring

Laure Daviaud, Marianne Johnson

Since the seminal work by Angluin and the introduction of the L*-algorithm, active learning of automata by membership and equivalence queries has been extensively studied to learn…

cs.FL2023

The Expansion Problem for Infinite Trees

Achim Blumensath

We study Ramsey like theorems for infinite trees and similar combinatorial tools. As an application we consider the expansion problem for tree algebras.

cs.FL2023★ 3 cited

Safety and Liveness of Quantitative Properties and Automata

Udi Boker, Thomas A. Henzinger, Nicolas Mazzocchi +1

Safety and liveness stand as fundamental concepts in formal languages, playing a key role in verification. The safety-liveness classification of boolean properties characterizes wh…

cs.FL2023★ 1 cited

Analyzing Robustness of Angluin's L Algorithm in Presence of Noise

Lina Ye, Igor Khmelnitsky, Serge Haddad +5

Angluin's L algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively…

cs.FL2023★ 1 cited

The -Complexity Of Visibly Pushdown Languages

Stefan Göller, Nathan Grosshans

We study the question of which visibly pushdown languages (VPLs) are in the complexity class and how to effectively decide this question. Our contribution is to int…