Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with linear-temporal-logic
Search options answers only
not deleted
user 86281
LTL (linear temporal logic or linear-time temporal logic) is a temporal logic that can encode assertions about the future of traces.
0
votes
Accepted
Proving the equivalence of an LTL and a CTL formula
First, it is important to understand what the statement
$$\forall \big(a \textsf{U} (b \land \forall \square a)\big) \equiv \big(a \textsf{U} (b \land \square a)\big)$$
means. Hear LTL is interprete …
- 134
6
votes
LTL to automaton translation that can only read disjunctions of labels per transition
The models of an LTL formula $\varphi$, with atomic propositions $P$, are infinite words $w = \sigma_0\sigma_1\ldots$, where each $\sigma_i$ is a subset of $P$. To recognize such words, the edges of a …
- 134
3
votes
LTL to Büchi automaton, deterministic?
There are languages that are representable by an LTL formula but by no deterministic Büchi automaton (DBA).
Thus a translation from LTL to DBA cannot exist.
An example is the formula $\mathbf{F}\mathb …
- 134