Certified program development vs. model checking
Sorry if my question is elementary but I want to know more about model checking and certified program development. What is the difference between model checking and certified program development? As I...
View ArticleClik here to view.
How to show that ECTL* is more expressive than CTL* $cup$ Büchi (with an...
I am looking for a preferably simple property that is expressible in ECTL* but not in CTL* and not in Büchi, with a citable reference to the proof. Details of what I’ve tried: I’ve tried a modification...
View ArticleConstructing automata with the same traces, but where a CTL-formula is not...
Hard to put this question in a short title. As part of a self-exercise, I’m trying to solve 6.15b of Principles of Model Checking by Baier and Katoen. You’re supposed to prove that there does not exist...
View ArticleClik here to view.
How to show that ECTL* is more expressive than CTL* $cup$ Büchi (with an...
I am looking for a preferably simple property that is expressible in ECTL* but not in CTL* and not in Büchi, with a citable reference to the proof. Details of what I’ve tried: I’ve tried a modification...
View ArticleTemporal Logic – Until [closed]
I have a doubt, in Linear Temporal Logic LTL, does the Until operator require that the first occurrence is the first term of the formula? ex: a U b does require that the first term is a ? Is the...
View ArticleLTL property – safety or liveness?
How can I check if an LTL (Linear Temporal Logic) property is safety or liveness? Is it right to say that a property is safety OR liveness (or neither)? How can I evaluate this: G(x -> (a U y) )
View ArticleHoare program correctness
Which is the easiest way to find a valid Invariant for a While Program in the Hoare program correctness verification? Is there a “guided” way to do that?
View ArticleWhat is the exact difference between kripke structures and transition systems?
Depending on the exact definition of a kripke structure and a transition system, they seem to be pretty much the same thing – is this true? To be more specific – though i found differing definitions...
View ArticleDecidability of membership in the fixed point of a rational relation
Given a finite alphabet $Sigma$, a non-deterministic finite-state transducer representing rational a relation $T subseteq wp(Sigma^* times Sigma^*)$, a finite state machine representing a regular...
View ArticleWhat is the space complexity of CTL model checking?
What is the space complexity of the CTL model checking algorithm via labeling without fairness (see e.g. Model Checking by Clarke at al Section 4.1 or Principles of Model Checking by Baier et al...
View ArticleAre there temporal logics linear time properties that only have...
Are there linear time temporal logics that can express some property $P_{nonlasso}$ that does have a counterexample, but none that is a lasso (or finite)? Details: One advantage of model checking over...
View ArticleProbabilistic protocols [closed]
I want to model a probabilistic protocol using a model checker, but a lot of protocols are already implemented (e.g. Randomised Dining Philosophers, Dining cryptographers, Synchronous leader election...
View ArticlePractical example: how to formally verify “file name” implementation from a...
Say you have an OS-independent specification for file names. The file names are case sensitive, and let’s say can’t be more than 200 characters, and can’t have : or / in the name. Now say you want to...
View Article
