Robust satisfaction

DOI10.1007/3-540-48320-9_27MaRDI QIDQ4270071zbMATH OpenFDO

Authors Orna Kupferman, Moshe Y. Vardi

Publication date 20 December 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48320-9_27

zbMATH Keywords

robust model checking

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verification of Open Systems
• Module checking
• Robust linear temporal logic
• Sublogics of a branching time logic of robustness
• A Temporal Logic of Robustness

Cited in

(8)

• Module checking
• Model measuring for discrete and hybrid systems
• An automata-theoretic approach to infinite-state systems
• Nondeterministic Moore automata and Brzozowski's minimization algorithm
• Nondeterministic Moore automata and Brzozowski's algorithm
• Robust linear temporal logic
• Abstract satisfaction
• On Skolem-hardness and saturation points in Markov decision processes

This page was built for publication: Robust satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4270071)