A Robust Class of Data Languages and an Application to Learning
Reads0
Chats0
TLDR
Session automata as mentioned in this paper is an automata model to process data words over an infinite alphabet, which is well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks.Abstract:
We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive) complementation, (ii) admit a symbolic regular representation, (iii) have a decidable inclusion problem (unlike register automata), and (iv) enjoy logical characterizations. Using these results, we establish a learning algorithm to infer session automata through membership and equivalence queries.read more
Citations
More filters
Book ChapterDOI
A Storm is Coming: A Modern Probabilistic Model Checker
TL;DR: The new probabilistic model checker Storm features the analysis of discrete- and continuous-time variants of both Markov chains and MDPs and offers a Python API for rapid prototyping by encapsulating Storm’s fast and scalable algorithms.
Book ChapterDOI
Nominal Automata with Name Binding
TL;DR: In this paper, an automaton model over nominal sets, called regular non-deterministic nominal automata RNNA, is introduced, which has a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word.
Posted Content
Nominal Automata with Name Binding
TL;DR: An automaton model over nominal sets is introduced, regular nondeterministic nominal automata RNNA, which have a natural coalgebraic definition using abstraction sets to capture transitions that read a fresh letter from the input word.
Journal ArticleDOI
No value restriction is needed for algebraic effects and handlers
Ohad Kammar,Matija Pretnar +1 more
TL;DR: In this article, a sound, sound, Hindley-Milner polymorphic type system for algebraic effects and handlers in a call-by-value calculus is presented, which allows type variable generalisation of arbitrary computations, and not just values.
Journal ArticleDOI
Finite model reasoning over existential rules
TL;DR: In this paper, it was shown that finite controllability of ontology-based query answering holds also for shy ontologies, and it therefore applies to all basic decidable Datalog+/- classes.
References
More filters
Model checking
TL;DR: Model checking tools, created by both academic and industrial teams, have resulted in an entirely novel approach to verification and test case generation that often enables engineers in the electronics industry to design complex systems with considerable assurance regarding the correctness of their initial designs.
Journal ArticleDOI
A calculus of mobile processes, II
TL;DR: The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions.
Journal ArticleDOI
Learning regular sets from queries and counterexamples
TL;DR: In this article, the problem of identifying an unknown regular set from examples of its members and nonmembers is addressed, where the regular set is presented by a minimaMy adequate teacher, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not.
Journal ArticleDOI
A Calculus of Mobile Processes - Part II
TL;DR: The purpose of the present paper is to provide a detailed presentation of some of the theory of the calculus developed to date, and in particular to establish most of the results stated in the companion paper.
BookDOI
Model-Based Testing of Reactive Systems, Advanced Lectures
TL;DR: This chapter discusses Model-Based Testing - A Glossary, which focuses on the development of model-Based Test Case Generation and its applications in I/O-automata Based Testing.