A weakness measure for GR(1) formulae
From MaRDI portal
Publication:5918262
DOI10.1007/978-3-319-95582-7_7zbMath1460.68054arXiv1805.03151OpenAlexW2963318269MaRDI QIDQ5918262
Davide G. Cavezza, András György, Dalal Alrajeh
Publication date: 4 May 2021
Published in: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.03151
Formal languages and automata (68Q45) Entropy and other invariants (28D20) Specification and verification (program logics, model checking, etc.) (68Q60) Fractals (28A80) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysing sanity of requirements for avionics systems
- Synthesis of Reactive(1) designs
- A logic for reasoning about time and reliability
- From LTL to deterministic automata. A safraless compositional approach
- Maximal specification synthesis
- From Model Checking to Model Measuring
- ASSUME-GUARANTEE REASONING WITH LOCAL SPECIFICATIONS
- Three SCC-Based Emptiness Checks for Generalized Büchi Automata
- Interpolation-Based GR(1) Assumptions Refinement
- Introduction to Discrete Event Systems
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Environment Assumptions for Synthesis
- Better Quality in Synthesis through Quantitative Objectives
- Fractals, dimension, and formal languages
- Asymptotic behaviour in temporal logic
- Pattern-Based Refinement of Assume-Guarantee Specifications in Reactive Synthesis
- Diagnostic Information for Realizability
- A weakness measure for GR(1) formulae
This page was built for publication: A weakness measure for GR(1) formulae