Model checking, synthesis, and learning
From MaRDI portal
Publication:6041187
Recommendations
Cites work
- A logic for reasoning about time and reliability
- A Succinct Canonical Register Automaton Model
- A succinct canonical register automaton model for data domains with binary relations
- A taxonomy and reductions for common register automata formalisms
- Active learning for extended finite state machines
- Algorithmic improvements in regular model checking.
- Assumption/guarantee specifications in linear-time temporal logic
- Combining black-box and white-box techniques for learning register automata
- CONCUR 2004 - Concurrency Theory
- From linear temporal logics to Büchi automata: the early and simple principle
- Fundamental Approaches to Software Engineering
- High-level representation of benchmark families for Petri games
- scientific article; zbMATH DE number 1670791 (Why is no real title available?)
- scientific article; zbMATH DE number 1538041 (Why is no real title available?)
- scientific article; zbMATH DE number 1903380 (Why is no real title available?)
- scientific article; zbMATH DE number 2102701 (Why is no real title available?)
- Incremental requirement specification for evolving systems
- Inferring canonical register automata
- Never-stop context-free learning
- Quantitative analysis of interval Markov chains
- Regular model checking revisited
Cited in
(2)
This page was built for publication: Model checking, synthesis, and learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041187)