Boundary detection: Difference between revisions
Jump to navigation
Jump to search
Restored page from Google Cache, uploaded by John Pye |
No edit summary |
||
| Line 4: | Line 4: | ||
Possible boundaries include | Possible boundaries include | ||
* real-valued relations, such as <tt>t < t_1</tt> or <tt>T > T_sat</tt> | * real-valued relations, such as <tt>t < t_1</tt> or <tt>T > T_sat</tt> | ||
| Line 15: | Line 14: | ||
See also [[Conditional modelling]] and [[Integration of Conditional Models]]. | See also [[Conditional modelling]] and [[Integration of Conditional Models]]. | ||
[[Category:Experimental]] | |||
[[Category:Documentation]] | [[Category:Documentation]] | ||
Revision as of 05:27, 9 November 2010
This page documents an experimental feature. You can help out by testing it and recording your experiences.
Boundary detection works under IDA to detect when, as moving forward in time, a point comes when a conditional expression changes value.
Possible boundaries include
- real-valued relations, such as t < t_1 or T > T_sat
- boolean-valued relations, such as motor_running = (have_power AND motor_switch_on)
As integration time progresses, logic-valued relations can only change value when somehow triggered by changes in real-valued relations. Boolean-valued relations at that point then be re-evaluated using LRSlv to precedence-order the logical relations from the current model state.
Boolean-valued relations case use the truth-value of real-valued relations using the SATISFIED(relname,tolerance) function.
See also Conditional modelling and Integration of Conditional Models.