Learning deterministic probabilistic automata from a model checking perspective (Q1689574): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Uppaal / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: APMC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LearnLib / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRISM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10994-016-5565-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2406438973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning I/O Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning regular sets from queries and counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking One-clock Priced Timed Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning deterministic regular grammars from stochastic samples in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2851066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of probabilistic verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME SIMPLE APPROXIMATE TESTS FOR POISSON VARIATES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning-Based Compositional Verification for Synchronous Probabilistic Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Event-Recording Automata Using Timed Decision Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification, Model Checking, and Abstract Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3404129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Probabilistic Systems from Tree Samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: From timed automata to logic — and back / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Meets Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A behavioural pseudometric for probabilistic transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning deterministic probabilistic automata from a model checking perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of amnesia: Learning probabilistic automata with variable memory length / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability and usage of acyclic probabilistic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning probabilistic automata and Markov chains via queries / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:41, 14 July 2024

scientific article
Language Label Description Also known as
English
Learning deterministic probabilistic automata from a model checking perspective
scientific article

    Statements

    Learning deterministic probabilistic automata from a model checking perspective (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2018
    0 references
    probabilistic model checking
    0 references
    probabilistic automata learning
    0 references
    linear-time temporal logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references