Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
F
frama-c
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Container Registry
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
pub
frama-c
Commits
eeac767d
Commit
eeac767d
authored
1 month ago
by
Maxime Jacquemin
Browse files
Options
Downloads
Patches
Plain Diff
[Kernel] Proper odoc maths in linear_filter
parent
55e105ab
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/kernel_services/analysis/filter/linear_filter.mli
+18
-16
18 additions, 16 deletions
src/kernel_services/analysis/filter/linear_filter.mli
with
18 additions
and
16 deletions
src/kernel_services/analysis/filter/linear_filter.mli
+
18
−
16
View file @
eeac767d
...
...
@@ -20,26 +20,28 @@
(* *)
(**************************************************************************)
(** A filter corresponds to the following recursive equation :
X[t + 1] = AX[t] + ∑B(ω)ε(ω)[k + 1] + C
(** Compute filters invariants, i.e bounds for each of the filter's state
dimensions when the iterations goes to infinity.
A filter corresponds to the following recursive equation :
{math X[t + 1] = AX[t] + ∑B(ω)ε(ω)[k + 1] + C }
where :
-
n
is the filter's order ;
-
ω
is a measure's source (for instance, a specific sensor in a
-
{m n}
is the filter's order ;
-
{m ω}
is a measure's source (for instance, a specific sensor in a
cyberphysical system) ;
- m(ω) is the delay for the source (ω) ;
- X[t] ∈ 𝕂^n is the filter's state at iteration [t] ;
- ε(ω)[t] ∈ 𝕂^m(ω) is the measure at iteration [t] for the source (ω) ;
- A ∈ 𝕂^(nxn) is the filter's state matrix ;
- B(ω) ∈ 𝕂^(nxm(ω)) is the source matrix for the source (ω) ;
- C ∈ 𝕂^n is the filter's center.
The goal of this module is to compute filters invariants, i.e bounds for
each of the filter's state dimensions when the iterations goes to infinity.
To do so, each measure of a given source is supposed bounded by the same
interval, represented as a center and a deviation. Each source can thus be
bounded by a different interval.
- {m m(ω)} is the delay for the source {m ω} ;
- {m X[t] ∈ 𝕂^n} is the filter's state at iteration [t] ;
- {m ε(ω)[t] ∈ 𝕂^{m(ω)}} is the measure at iteration [t] for the source {m ω} ;
- {m A ∈ 𝕂^{nxn}} is the filter's state matrix ;
- {m B(ω) ∈ 𝕂^{nxm(ω)}} is the source matrix for the source {m ω} ;
- {m C ∈ 𝕂^n} is the filter's center.
To compute filter invariants, each measure of a given source is supposed
bounded by the same interval, represented as a center and a deviation. Each
source can thus be bounded by a different interval.
{!Linear_filter_test} is an example using this module. *)
module
Make
(
Field
:
Field
.
S
)
:
sig
(** The linear space in which the filters are defined. *)
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment