5 citations · 24 across the 16 of their papers we have counts for
7 papers · 1 filter
The Complexity of Learning Temporal Properties
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We consider the problem of learning temporal logic formulas from examples of system behavior. Learning temporal properties has crystallized as an effective mean to explain complex…
Learning Branching-Time Properties in CTL and ATL via Constraint Solving
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We address the problem of learning temporal properties from the branching-time behavior of systems. Existing research in this field has mostly focused on learning linear temporal p…
Learning Temporal Properties is NP-hard
Benjamin Bordais, Daniel Neider, Rajarshi Roy
We investigate the complexity of LTL learning, which consists in deciding given a finite set of positive ultimately periodic words, a finite set of negative ultimately periodic wor…
Inferring Properties in Computation Tree Logic
Rajarshi Roy, Daniel Neider
We consider the problem of automatically inferring specifications in the branching-time logic, Computation Tree Logic (CTL), from a given system. Designing functional and usable sp…
Learning Temporal Logic Properties: an Overview of Two Recent Methods
Jean-Raphaël Gaglione, Rajarshi Roy, Nasim Baharisangari +3
Learning linear temporal logic (LTL) formulas from examples labeled as positive or negative has found applications in inferring descriptions of system behavior. We summarize two me…
Learning Interpretable Temporal Properties from Positive Examples Only
Rajarshi Roy, Jean-Raphaël Gaglione, Nasim Baharisangari +3
We consider the problem of explaining the temporal behavior of black-box systems using human-interpretable models. To this end, based on recent research trends, we rely on the fund…
Robust Computation Tree Logic
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy +1
It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system guarantees, but it is…