Model checking, synthesis, and learning

DOI10.1007/978-3-030-91384-7_1zbMath1522.68339OpenAlexW4206152085MaRDI QIDQ6041187

Ernst-Ruediger Olderog, Bernhard Steffen, Wang Yi

Publication date: 26 May 2023

Published in: Model Checking, Synthesis, and Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-91384-7_1

zbMATH Keywords

verificationMarkov chainsPetri netsBüchi automataprobabilistic systemstimed systemsregister automatalinear-time temporal logicmodel synthesisautomata learningPetri games(regular) model checking

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assumption/guarantee specifications in linear-time temporal logic
• Active learning for extended finite state machines
• A logic for reasoning about time and reliability
• Combining black-box and white-box techniques for learning register automata
• Inferring Canonical Register Automata
• A Succinct Canonical Register Automaton Model
• A Succinct Canonical Register Automaton Model for Data Domains with Binary Relations
• CONCUR 2004 - Concurrency Theory
• Fundamental Approaches to Software Engineering
• Computer Aided Verification
• From linear temporal logics to Büchi automata: the early and simple principle
• Quantitative analysis of interval Markov chains
• Regular model checking revisited
• High-level representation of benchmark families for Petri games
• Never-stop context-free learning
• A taxonomy and reductions for common register automata formalisms

This page was built for publication: Model checking, synthesis, and learning