[[Category:Components]]
302 bytes (28 words) - 14:51, 30 October 2014
[[Category:Components]]
...uses views with embedded Eclipse SWT browsers to access the user interface components that are shipped with the [[ProB Java API]] library.
2 KB (306 words) - 14:48, 4 February 2021
[[Category:Components]]
824 bytes (111 words) - 11:53, 20 February 2015
[[Category:Components]]
3 KB (345 words) - 07:13, 10 October 2017
...esis possibly lacks for performance compared to using the exact library of components that is necessary to synthesize a program. To that effect, the user is also
...t we want to use a specific library of components only and add the desired components using their names. For instance, we want to create a component library usin
11 KB (1,554 words) - 17:55, 27 January 2021
[[Category:Components]]
1 KB (185 words) - 11:04, 18 May 2021
''distb'' consists of three components.
...LD_LIBRARY_PATH variable to find the ZeroMQ libraries beforehand (for all components):
3 KB (443 words) - 13:19, 26 January 2018
...ld then select the ProB for Rodin update site, and then select the various components of ProB as shown below.
2 KB (330 words) - 12:39, 23 February 2023
...ntaining the views but be aware that this might ruin the ability to detach components.
5 KB (860 words) - 15:58, 20 June 2023
[[Category:Components]]
3 KB (404 words) - 13:09, 30 October 2014
...all of the information about the refinement chain and all of the different components (Machines, Contexts, Invariants, Variables, etc.).
3 KB (563 words) - 14:47, 5 November 2014
...el checking algorithm of ProB is based on searching for strongly connected components (SCCs) with certain properties to determine whether ''M'' satisfies ''f''.
LTL (fairness): 0 strongly connected components were rejected, 0 callbacks needed.
26 KB (4,179 words) - 14:24, 4 March 2023
To identify the components (like state, initialization, operations)
ProZ tries to identify components. So, it is recommended to use schema definitions instead of abbreviation de
12 KB (1,888 words) - 17:06, 3 February 2021
...</tt>: providing access to <tt>SCCS</tt> to compute the strongly connected components of a relation and <tt>CLOSURE1</tt> an alternative algorithm for compting t
7 KB (1,144 words) - 06:37, 11 May 2024
KODKOD_ONLY_FULL = true : bool ==> Translate only complete components to KODKOD
...TITION_PROPERTIES = true : bool ==> Partition predicates (PROPERTIES) into components
22 KB (3,056 words) - 09:54, 24 August 2021
...nents: a menu bar, a list box and a tab pane. In the following each of the components and their corresponding functionalities are thoroughly described.
24 KB (4,029 words) - 09:28, 23 September 2016
...ines, constants, variables, invariants, events, etc. A model is a graph of components and their relationship. Except for Graph handling there are no shared metho
11 KB (1,767 words) - 08:20, 5 May 2015
** TLA+ tuples are translated as sequences in B, hence all components of the tuple must have the same type
14 KB (1,950 words) - 07:16, 12 September 2024
...ail approach to formalizing standard interfaces between signalling systems components, Belli et al.] <i>"ProB has been selected as the second target of the forma
16 KB (2,346 words) - 10:41, 1 October 2024
avoiding spurious WD errors in predicate components and real operators (such as RSQRT, RPOW)
- external predicate SCCS for computing strongly connected components
76 KB (11,706 words) - 14:34, 22 February 2024