scholarly journals Checking for Open Bisimilarity in the pi-Calculus

2001 ◽  
Vol 8 (8) ◽  
Author(s):  
Ulrik Frendrup ◽  
Jesper Nyholm Jensen

<p>This paper deals with algorithmic checking of open bisimilarity in the pi-calculus. Most bisimulation checking algorithms are based on the partition refinement approach. Unfortunately the definition of open bisimulation does not permit us to use a partition refinement approach for open bisimulation checking directly, but in the paper 'A Partition Refinement Algorithm for the pi-Calculus' Marco Pistore and Davide Sangiorgi present an iterative method that makes it possible to check for open bisimilarity using partition refinement. We have implemented the algorithm presented by Marco Pistore and Davide Sangiorgi. Furthermore,<br />we have optimized this algorithm and implemented this optimized algorithm. The time-complexity of this algorithm is the same as the time-complexity for the first algorithm, but performance tests have shown that in many cases the running time of the optimized algorithm is shorter than the running time of the first algorithm. Our implementation of the optimized open bisimulation checker algorithm and a user interface have been integrated in a system called the OBC Workbench.The source code and a manual for it is available from http://www.cs.auc.dk/research/FS/ny/PR-pi/.</p>

2020 ◽  
Vol 30 (14) ◽  
pp. 2050212
Author(s):  
Ian Stewart

Balanced colorings of networks correspond to flow-invariant synchrony spaces. It is known that the coarsest balanced coloring is equivalent to nodes having isomorphic infinite input trees, but this condition is not algorithmic. We provide an algorithmic characterization: two nodes have the same color for the coarsest balanced coloring if and only if their [Formula: see text]th input trees are isomorphic, where [Formula: see text] is the number of nodes. Here [Formula: see text] is the best possible. The proof is analogous to that of Leighton’s theorem in graph theory, using the universal cover of the network and the notion of a symbolic adjacency matrix to set up a partition refinement algorithm whose output is the coarsest balanced coloring. The running time of the algorithm is cubic in [Formula: see text].


2013 ◽  
Vol 760-762 ◽  
pp. 1919-1924 ◽  
Author(s):  
Ai Min Hou ◽  
Chuan Fu Hu ◽  
Zhi Feng Hao

A general depth-first backtracking algorithm for graph isomorphism with the vertex partition and refinement technique is presented in this paper. The time complexity of this nondeterministic polynomial algorithm is O(nα+3) where nα is the number of backtracking points and (h-1)/2α (h+1)/2 for h=logn in the worst cases. The tests on many types of graphs validated the efficiency of this algorithm for graph isomorphism.


2020 ◽  
Vol 14 ◽  
pp. 78-81
Author(s):  
Vadym Borys ◽  
Roman Slezenko ◽  
Beata Pańczyk

The goal of the article is to choose the most efficient user interface creation tools possible for Spring. The study compares 4 selected view technologies: JSP,  Thymeleaf, Wicket and Angular. Time and memory performance tests were carried out using Rest API in Spring. Test results allowed to identify the best solutions.


Author(s):  
Miroslav Bures ◽  
Martin Filipsky ◽  
Ivan Jelinek

In the automated testing based on actions in user interface of the tested application, one of the key challenges is maintenance of these tests. The maintenance overhead can be decreased by suitably structuring the test scripts, typically by employing reusable objects. To aid in the development, maintenance and refactoring of these test scripts, potentially reusable objects can be identified by a semi-automated process. In this paper, we propose a solution that identifies the potentially reusable objects in a set of automated test scripts and then provides developers with suggestions about these objects. During this process, we analyze the semantics of specific test steps using a system of abstract signatures. The solution can be used to identify the potentially reusable objects in both recorded automated test sets and tests programmed in an unstructured style. Moreover, compared to approaches that are based solely on searching for repetitive source code fragments, the proposed system identifies potentially reusable objects that are more relevant for test automation.


2010 ◽  
pp. 560-582
Author(s):  
Andrew Targowski

The purpose of this study is to define generic service processes, their system, and a scope of service science developed originally by the author. In the presented approach, the main criterion is the class of serviced users, since this leads to the six kinds of process recognition and eventually helps in planning e-service systems’ architecture. E-service system (e-SS) is defined as a mission-goal-strategy-driven configuration of technology, organizational processes and networks designed to deliver HTservicesTH that satisfy the needs, wants, or aspirations of customers. Marketing, operations, and global environment considerations have significant implications for the design of an e-service system. Four criteria which impact e-service systems’ architecture have been defined as: service business model, customer contact and level of involvement (Service User Interface), service provider’s enterprise complexity (Enterprise Systems and Networks), and scope of goods involved in service. It was proved that the e-service system is the intermediary layer between Service User Interface and Enterprise Systems and Networks. Two examples of e-SS have been modeled.


2020 ◽  
Vol 10 (22) ◽  
pp. 8005
Author(s):  
Damian Giebas ◽  
Rafał Wojszczyk

This paper is a contribution to the field of research dealing with the parallel computing, which is used in multithreaded applications. The paper discusses the characteristics of atomicity violation in multithreaded applications and develops a new definition of atomicity violation based on previously defined relationships between operations, that can be used to atomicity violation detection. A method of detection of conflicts causing atomicity violation was also developed using the source code model of multithreaded applications that predicts errors in the software.


2011 ◽  
pp. 1931-1937
Author(s):  
Su-Ting Yong

This is a brief review of the history of usability and a discussion of usability in developing a computer-based learning program (CBLP). According to ISO 9241, usability is defined as the extent to which a product can be used by specified users to achieve specified goals with effectiveness, efficiency, and satisfaction in a specified context of use (Bevan, 2001). The main focus of usability in this article is concerned with the user interface and interaction design. To create a usable computer-based learning program, one needs to understand the definition of usability and the goals of usability. Besides achieving usability goals, a usable CBLP should also be able to attain user experience goals. Design principles can be used to develop a CBLP featured with usability. Two design models will be discussed in this review.


2019 ◽  
Vol 7 (3_suppl) ◽  
pp. 2325967119S0004
Author(s):  
John Magill ◽  
Heather Myers ◽  
Valentine Esposito ◽  
Michael Messer ◽  
Trevor Lentz ◽  
...  

Purpose/Hypothesis: Return to sport (RTS) after anterior cruciate ligament (ACL) reconstruction in children is associated with a much higher risk (˜30%) of subsequent ACL injury than in adults. Most RTS testing protocols use Limb Symmetry Indices (LSI) on physical performance tests (PPTs). This assumes that both lower extremities should be equal. We hypothesized that in the pediatric population, baseline limb asymmetry exists, limiting the clinical utility of LSIs. Since LSI > 90% is often used as a clinical cutoff for RTS, we defined a test as valid if 80% of healthy volunteers had an LSI > 90%. Number of Subjects: 63 Materials/Methods: This study included healthy volunteers ages 6-18 [mean age = 10.7 +/- 3.2 years; 34 females (54%)]. Pubertal Maturity Observation Scores (PMOS), sex, age, height, weight, and body mass index (BMI) were collected. Subjects performed ten PPTs: lower quarter Y-balance, stork balance, stork balance on BOSU, single leg squat (SLS), SLS on BOSU, clockwise and counterclockwise quadrant single leg hop (SLH), forward SLH, timed SLH, and triple crossover SLH. Subjects performed the items in the same order, but were randomly assigned the starting test and the starting limb. We developed a composite score for each limb by averaging trials, then calculated the absolute value of the side-to-side difference, and normalized this difference to the test mean to obtain a percentage side-to-side difference (%STS). Multivariable linear regression analysis was performed to assess the effect of age on limb symmetry while correcting for BMI, PMOS and sex. Results: %STS were not normally distributed for any PPT, therefore data were reported as medians and interquartile ranges. All PPTs showed baseline limb asymmetry, and none met our definition of validity. The most symmetric PPT was the clockwise quadrant hop test (%STS in females, median = 9.85, interquartile range = 4.63 – 18.7; %STS in males, median = 6.9, interquartile range = 3.64 – 14.04). The stork balance on BOSU test had the greatest limb asymmetry (%STS in females, median 41.4, interquartile range 10.1 – 71.3; %STS in males, median 47.6, interquartile range 18.2 – 66.7). PMOS was strongly correlated with age (Pearson’s? = 0.83), and was excluded as a predictor variable. Age was an independent predictor of %STS only for the stork test (B = -1.15, 95% CI = -1.92 to -0.38, p = 0.004), with older subjects having less limb asymmetry. Conclusions: Healthy children have significant baseline limb asymmetries on PPTs that are commonly used for RTS decision making after ACL reconstruction. None of the PPTs evaluated in this study met our definition of clinical validity. Limb symmetry was typically not affected by subject age. Clinical Relevance: In light of these results, limb symmetry indices (LSI) should be utilized with caution in this population. Functional recovery may be better assessed by comparison to age and sex-specific norms. [Figure: see text]


2019 ◽  
Vol 35 (18) ◽  
pp. 3527-3529 ◽  
Author(s):  
David Aparício ◽  
Pedro Ribeiro ◽  
Tijana Milenković ◽  
Fernando Silva

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.


Sign in / Sign up

Export Citation Format

Share Document