Results 1 - 10 of 28,324

Table 43: Overview of axioms of concurrent process algebras.

in Completeness in discrete-time process algebra
by Michel A. Reniers, Jan Joris Vereijken 1996
"... In PAGE 131: ... We have the following legend: A indicates that the axiom is present in the theory, A indicates that the axiom is not present but can be derived (for closed terms) from the other axioms in the theory, A indicates that the axiom does not hold in the theory, A indicates that the axiom is meaningless in the theory, as there is a signature conflict. In Table43 on page 135 we give an overview of the axioms pertaining to merge operators of the (concurrent) process algebras treated in Section 3. The legend is the same as for the previous table.... ..."
Cited by 7

Table 5.4: Results for Concurrent Processes

in unknown title
by unknown authors

Table 5.4: Resultsfor Concurrent Processes

in UNCLASS IFIED SECURII"YCLASSIFICATIONOF THIS PAGE
by Fault-tolerant Computer, Kumar K. Goswami, Fault-tolfrant Computer (i|inois Unc|as, Ii I I, Unclassif Led

TABLE 4. Index scan test by two concurrent processes

in Evaluation of Objectivity Databases on the Sony HSM Software and Tape Robotics
by Atsushi Manabe, Michael Athanas, Nobu Katayama

Table 4: Results of PGAn on 1 CPU: concurrent processes.

in Algorithms, Experimentation, Performance
by unknown authors
"... In PAGE 4: ... However, the results of PGA15 are similar to that of PGA10. Now in Table4 we present the results of the same PGAs... ..."

Table 6: Results of PGARAn on 1 CPU: concurrent processes.

in Algorithms, Experimentation, Performance
by unknown authors
"... In PAGE 5: ... Increasing the number of islands is, in this case, beneflcial. In Table6 we show the results for PGARAn on 1 CPU.... ..."

Table 1. Comparison of sequential and concurrent probabilistic processes

in The (True) Concurrent Markov Property and Some Applications to Markov Nets
by Samy Abbes
"... In PAGE 9: ... (13), it makes sense for a Markov net (N, P) and for a reachable marking m, to use the notations: Pm, Em, (14) to respectively denote the probability Pv and the expectation Ev for any finite configuration v with positive likelihood, and such that m = m(v), provided that such a v exists. Table1 summarizes and compares the definitions introduced so far, and em- phasizes the symmetry between sequential and concurrent systems. Table 1.... ..."
Cited by 1

Table 7: Concurrent Guarding using Shadow Processing: (user + system) time

in Low-cost, Concurrent Checking of Pointer and Array Accesses in C Programs
by Harish Patil, Charles Fischer
"... In PAGE 22: ... Slicing helped us to reduce execu- tion time overhead of guarding for all the test programs we were able to slice. Performance of Concurrent Guarding Table7 summarizes the execution time for some SPEC92 benchmarks for concurrent guarding using shadow processing. The overhead to the main process is mainly due to any memory conflicts with the shadow pro- cess.... ..."

Table 1 Concurrency characteristics of the benchmarks. Benchmark Processes Messages

in ∗ Corresponding author.
by Konstantinos Sagonas, Jesper Wilhelmsson
"... In PAGE 24: ... Although this program takes a very small time to complete, we use it as a benchmark because it spawns a rather large number of simultaneously live processes (cf. Table1 ) having a root set which is correspondingly large.... ..."

Table 1: Average percentage of reduction per number of processes and per concurrency level.

in Partial-order verification in SPIN can be more efficient
by Hans Van Der Schoot 1997
"... In PAGE 11: ... Table1 compares the performance of our approach (method C) against both the reduced search in [7, 20] (method B) and the conventional state exploration (method A). The figures indicate aver- age percentages of reduction, and are arranged by the number of processes in a protocol and by the concurrency level of a protocol.... ..."
Cited by 1
Results 1 - 10 of 28,324