Search results for "Programming Language"
showing 10 items of 624 documents
Measuring microfinance performance
2015
MFIs are measured according to two dimensions. One is their outreach to poor people, that is, their ability to provide poor families access to financial services. This is the MFIs’ social mission. The other dimension is their financial sustainability, that is, their ability to pay their employees, lenders, and other suppliers, in short, their ability to produce a profit from their operations. We set out the main microfinance measures and confirm earlier findings that profitability is rather weak in microfinance, and that operational costs constitute a large part of the total costs. We argue that researchers should put more efforts into identifying the MFI’s cost drivers because social outre…
Building a new CTL model checker using Web services
2013
This Computation Tree Logic (CTL) is widely used to capture compositions of reactive systems. Model checking is particularly well-suited for the automated verification of finite-state systems, both for software and for hardware. A CTL model checker tool allows designers to automatically verify that systems satisfy specifications expressed in the language of CTL logic. In this paper we present a new CTL model checker implemented in client-server paradigm. CTL Designer, the client tool, allows an interactive construction of the CTL models as state-transition graphs. Java and C# APIs are provided for programmatic construction of large models. The server part of our tool embeds the core of the …
Verification of JADE Agents Using ATL Model Checking
2015
It is widely accepted that the key to successfully developing a system is to produce a thorough system specification and design. This task requires an appropriate formal method and a suitable tool to determine whether or not an implementation conforms to the specifications. In this paper we present an advanced technique to analyse, design and debug JADE software agents, using Alternating-time Temporal Logic (ATL) which is interpreted over concurrent game structures, considered as natural models for compositions of open systems. In development of the proposed solution, we will use our original ATL model checker. In contrast to previous approaches, our tool permits an interactive or programma…
ATL model checking in the cloud
2015
This paper gives an overview of our recent work on implementing a new interactive ATL model checker for verification of open systems. In verification based on model checking, we need to provide a model of the system and also write down the properties (ATL formulas) that we require the system to satisfy. Traditionally, the semantics of ATL is given in terms of concurrent game structures. In contrast to previous approaches, our tool permits an interactive design of the ATL models as state-transition graphs, and is based on client/server architecture. The server part, published as Web service in OpenShift cloud platform, embeds the core of the ATL model checker, and the client provides an intu…
Implementing an ATL model checker tool using relational algebra concepts
2014
Alternating-Time Temporal Logic (ATL) is a branching-time temporal logic that naturally describes computations of open systems. An open system interacts with its environment and its behavior depends on the state of the system as well as the behavior of the environment. ATL model-checking is a well-established technique for verifying that a formal model representing such a system satisfies a given property. In this paper we describe a new interactive model checker environment based on algebraic approach. Our tool is implemented in client-server paradigm. The client part allows an interactive construction of ATL models represented by concurrent game structures as directed multi-graphs. The se…
Concept of Client-Server Environment for Agent-Based Modeling and Simulation of Living Systems
2015
In the paper a concept for integrated and simple-to-use agent-based modeling and simulation environment is presented. The modeling environment allows simulating massive agent-based systems. Modeling environment itself is not domain specific, but it is expandable and allows creating domain-specific models. Hierarchical environment structure is supported. Individual agents could evolve by its individual path and pace. We use the General Living Systems theory as a reference model to check whether proposed modeling and simulation environment may also be used to describe models of living systems that are most complex systems around. The main concepts of proposed modeling environment such as agen…
Enhancing dynamic graphical analysis with the Lisp-Stat language and the ViSta statistical program
2005
Presented is a sample of computerized methods aimed at multidimensional scaling and psychometric item analysis that offer a dynamic graphical interface to execute analyses and help visualize the results. These methods show how the Lisp-Stat programming language and the ViSta statistical program can be jointly applied to develop powerful computer applications that enhance dynamic graphical analysis methods. The feasibility of this combined strategy relies on two main features: (1) The programming architecture of ViSta enables users to add new statistical methods as plug-ins, which are integrated into the program environment and can make use of all the functions already available in ViSta (e.…
Star-free trace languages
1992
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
Analysis of DNA sequence variation within marine species using Beta-coalescents
2013
We apply recently developed inference methods based on general coalescent processes to DNA sequence data obtained from various marine species. Several of these species are believed to exhibit so-called shallow gene genealogies, potentially due to extreme reproductive behaviour, e.g. via Hedgecock's "reproduction sweepstakes". Besides the data analysis, in particular the inference of mutation rates and the estimation of the (real) time to the most recent common ancestor, we briefly address the question whether the genealogies might be adequately described by so-called Beta coalescents (as opposed to Kingman's coalescent), allowing multiple mergers of genealogies. The choice of the underlying…
Elementary transformation analysis for Array-OL
2009
Array-OL is a high-level specification language dedicated to the definition of multidimentional intensive signal processing applications. It allows to specify both the task parallelism and the data parallelism of these applications on focusing on their complex multidimensional data access patterns. Several tools exist for implementing an Array-OL specification as a data parallel program. While Array-OL can be used directly, it is often convenient to be able to deduce part of the specification from a sequential version of the application. This paper proposes such an analysis and examines its feasibility and its limits.