111 citations · 528 across the 50 of their papers we have counts for
3 papers · 1 filter
A coalgebraic treatment of conditional transition systems with upgrades
Harsh Beohar, Barbara König, Sebastian Küpper +2
We consider conditional transition systems, that model software product lines with upgrades, in a coalgebraic setting. By using Birkhoff's duality for distributive lattices, we der…
Learning Nominal Automata
Joshua Moerman, Matteo Sammartino, Alexandra Silva +2
We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to s…
Cantor meets Scott: Semantic Foundations for Probabilistic Networks
Steffen Smolka, Praveen Kumar, Nate Foster +2
ProbNetKAT is a probabilistic extension of NetKAT with a denotational semantics based on Markov kernels. The language is expressive enough to generate continuous distributions, whi…