نتایج جستجو برای: tla
تعداد نتایج: 616 فیلتر نتایج به سال:
This paper presents the investigation and comparison of TLC model checking method (TLA Checker) properties. There are two different approaches to method usage which are considered. The first one consists of a transition system states attendance by breadth-first search (BFS), and the second one by depth-first search (DFS). The Kripke structure has been chosen as a transition system model. A case...
Algorithms are different from programs and should not be described with programming languages. Until now, the only simple alternative to programming languages has been pseudo-code. Based on the TLA+ specification language, +cal is an algorithm language that is designed to replace pseudocode. A +cal algorithm is automatically translated to a TLA+ specification that can be checked with the TLC mo...
Algorithms are different from programs and should not be described with programming languages. The only simple alternative to programming languages has been pseudo-code. PlusCal is an algorithm language that can be used right now to replace pseudo-code, for both sequential and concurrent algorithms. It is based on the TLA+ specification language, and a PlusCal algorithm is automatically transla...
Results Data from 30 patients (mean age 28; range 8-70) completing 4 months and 27 patients completing 12 months of TLA use, are presented. Ratios (%) or means (range) At baseline After 12 months of TLA P-value Exacerbations last 12 months3.6 (0-12)1.3 (0-5)0.05Asthma Control Test14.1 (5-27)18.5 (8-27)<0.001Ratio with uncontrolled disease, GINA55.20<0.001Ratio with controlled disease, GINA10.333.3
The association between regional measures of cortical atrophy and neuropsychological (NP) dysfunction was studied in 35 multiple sclerosis (MS) patients. Patients underwent neurological examination, MRI, and NP testing. Blind quantitative MRI analysis yielded total T(2) lesion area (TLA) and third ventricle width (3VW). Cortical atrophy, rated by blind visual inspection, was more extensive in s...
Reduction theorems allow one to deduce properties of a concurrent system specification from properties of a simpler, coarser-grained version called the reduced specification. We present reduction theorems based upon a more precise relation between the original and reduced specifications than earlier ones, permitting the use of reduction to reason about a larger class of properties. In particula...
TLA is a general purpose, formal specification language based on the Temporal Logic of Actions, with no built-in primitives for specifying real-time properties. Here, we use TLA to define operators for specifying the temporal behavior of physical components obeying integral equations of evolution. These operators, together with previously defined operators for describing timing constraints, are...
The so-called “new machinery for computing” was early computers, and ACM considered it a machinery for “reasoning .. of information”. However, the computers are not the only models for information change. The exciting history of derivations (or so called syllogisms) go back till Aristotle, and gained so much importance in Medieval ages via the rise of logical discourse among religious scholars....
Predicate-action diagrams, which are similar to standard state-transition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specification—and those descriptions then proved correct— even when the complete specification cannot be written as a diagram. We also use the diagrams to illustrate proofs...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید