Concurrent Kleene algebra with observations: from hypotheses to completeness
From MaRDI portal
Publication:2200836
DOI10.1007/978-3-030-45231-5_20OpenAlexW3023372902MaRDI QIDQ2200836
Jana Wagemaker, Tobias Kappé, Alexandra Silva, Fabio Zanasi, Paul Brunet
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/2002.09682
Related Items
Axiomatizing recursion-free, regular monitors, Generating Posets Beyond N, Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks, DyNetKAT: an algebra of dynamic networks, On tools for completeness of Kleene algebra with hypotheses
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Finite-state \(\omega\)-languages
- Teaching a smarter learner.
- Learning regular sets from queries and counterexamples
- Characteristic sets for polynomial grammatical inference
- On the learnability of infinitary regular sets
- Regular \(\omega\)-languages with an informative right congruence
- Inferring Canonical Register Automata
- Learning Regular Omega Languages
- Learning Symbolic Automata
- A Novel Learning Algorithm for Büchi Automata Based on Family of DFAs and Classification Trees
- Learning the Language of Error
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Learning I/O Automata
- Complexity of automaton identification from given data
- Families of DFAs as Acceptors of omega-Regular Languages
- Mining specifications
- An automata-theoretic approach to branching-time model checking
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Tools and Algorithms for the Construction and Analysis of Systems
