Parametric temporal logic for “model measuring”
From MaRDI portal
Publication:3549124
DOI10.1145/377978.377990zbMATH Open1171.68544OpenAlexW2048780543MaRDI QIDQ3549124FDOQ3549124
Authors: Kousha Etessami, Salvatore La Torre, Doron Peled, Rajeev Alur 
Publication date: 21 December 2008
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/377978.377990
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cited In (36)
- Optimizing Winning Strategies in Regular Infinite Games
- Optimal bounds in parametric LTL games
- A survey of timed automata for the development of real-time systems
- From model checking to model measuring
- Prompt interval temporal logic
- Optimal strategies in weighted limit games
- Decidable first-order transition logics for PA-processes
- Decision problems for lower/upper bound parametric timed automata
- Efficient parametric identification for STL
- An interface theory for service-oriented design
- From liveness to promptness
- Quantifying Bounds in Strategy Logic
- Monitoring parametric temporal logic
- The fixed-parameter tractability of model checking concurrent systems
- Temporal specifications with accumulative values
- What's decidable about parametric timed automata?
- A fuzzy real-time temporal logic
- Compositional branching-time measurements
- Parametric LTL on Markov chains
- Distributed synthesis for parameterized temporal logics
- Distributed PROMPT-LTL synthesis
- Time-budgeting: a component based development methodology for real-time embedded systems
- Robust, expressive, and quantitative linear temporal logics: pick any two for free
- Parametric metric interval temporal logic
- Robust, expressive, and quantitative linear temporal logics: pick any two for free
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Some results on parametric temporal logic
- Parametric interval temporal logic over infinite words
- Approximating optimal bounds in prompt-LTL realizability in doubly-exponential time
- Time window temporal logic
- Title not available (Why is that?)
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Taming large bounds in synthesis from bounded-liveness specifications
- Parametric linear dynamic logic
- Parametric linear dynamic logic
- Automata-theoretic decision of timed games
Uses Software
This page was built for publication: Parametric temporal logic for “model measuring”
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549124)
