A true concurrent model of smart contracts executions

The development of blockchain technologies has enabled the trustless execution of so-called smart contracts, i.e. programs that regulate the exchange of assets (e.g., cryptocurrency) between users. In a decentralized blockchain, the state of smart contracts is collaboratively maintained by a peer-to-peer network of mutually untrusted nodes, which collect from users a set of transactions (representing the required actions on contracts), and execute them in some order. Once this sequence of transactions is appended to the blockchain, the other nodes validate it, re-executing the transactions in the same order. The serial execution of transactions does not take advantage of the multi-core architecture of modern processors, so contributing to limit the throughput. In this paper we propose a true concurrent model of smart contract execution. Based on this, we show how static analysis of smart contracts can be exploited to parallelize the execution of transactions.Comment: Full version of the paper presented at COORDINATION 202

On Languages Accepted by P/T Systems Composed of joins

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow. Here we continue this line of research introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only of joins. Moreover, we investigate how J languages relate to other families of formal languages. In particular, we show that every J language can be accepted by a log n space-bounded non-deterministic Turing machine with a one-way read-only input. We also show that every J language has a semilinear Parikh map and that J languages and context-free languages (CFLs) are incomparable

Learning about knowledge: A complex network approach

This article describes an approach to modeling knowledge acquisition in terms of walks along complex networks. Each subset of knowledge is represented as a node, and relations between such knowledge are expressed as edges. Two types of edges are considered, corresponding to free and conditional transitions. The latter case implies that a node can only be reached after visiting previously a set of nodes (the required conditions). The process of knowledge acquisition can then be simulated by considering the number of nodes visited as a single agent moves along the network, starting from its lowest layer. It is shown that hierarchical networks, i.e. networks composed of successive interconnected layers, arise naturally as a consequence of compositions of the prerequisite relationships between the nodes. In order to avoid deadlocks, i.e. unreachable nodes, the subnetwork in each layer is assumed to be a connected component. Several configurations of such hierarchical knowledge networks are simulated and the performance of the moving agent quantified in terms of the percentage of visited nodes after each movement. The Barab\'asi-Albert and random models are considered for the layer and interconnecting subnetworks. Although all subnetworks in each realization have the same number of nodes, several interconnectivities, defined by the average node degree of the interconnection networks, have been considered. Two visiting strategies are investigated: random choice among the existing edges and preferential choice to so far untracked edges. A series of interesting results are obtained, including the identification of a series of plateaux of knowledge stagnation in the case of the preferential movements strategy in presence of conditional edges.Comment: 18 pages, 19 figure

Access to shops: The views of low-income shoppers

Concern is mounting as the retail stranglehold upon access to food grows. Research on the implications of restructuring retailing and health inequality has failed to involve low-income consumers in this debate. This paper reports on an exercise conducted for the UK Government's, Social Exclusion Unit's Policy Action Team on Access to Shops. The survey provides a useful baseline of the views of low-income groups in England. The choices that people on low income can make were found to be dominated by certain factors such as income and, most importantly, transport. Consumers reported varying levels of satisfaction with retail provision. The findings suggest gaps between what people have, what they want and what the planning process does and does not offer them. Better policy and processes are needed to include and represent the interests of low-income groups

Фізико-хімічна геотехнологія

Розглянуто принципові засади геотехнологічного видобування різнома- нітних корисних копалин. Викладено питання розкриття та підготовки родовищ за допомогою свердловинної розробки, проаналізовано способи буріння і кріп- лення геотехнологічних свердловин, а такж застосоване обладнання. Розкрито сутність технологічних процесів, які виконуються при диспергуванні гірських порід, розчиненні солей, вилуговуванні металів, підземній виплавці сірки і га- зифікації вугілля, видобуванні в’язкої нафти та сланцьового газу. Навчальний посібник призначений для студентів, які навчаються за спе- ціальністю «Розробка родовищ та видобування корисних копалин», а також для студентів інших спеціальностей гірничих вузів і факультетів та інженерно- технічних працівників підприємств і проектних організацій гірничовидобувних галузей промисловості України

Geographic Variation in Sexual Attraction of Spodoptera frugiperda Corn- and Rice-Strain Males to Pheromone Lures

The corn- and rice-strains of Spodoptera frugiperda exhibit several genetic and behavioral differences and appear to be undergoing ecological speciation in sympatry. Previous studies reported conflicting results when investigating male attraction to pheromone lures in different regions, but this could have been due to inter-strain and/or geographic differences. Therefore, we investigated whether corn- and rice-strain males differed in their response to different synthetic pheromone blends in different regions in North America, the Caribbean and South America. All trapped males were strain typed by two strain-specific mitochondrial DNA markers. In the first experiment, we found a nearly similar response of corn and rice-strain males to two different 4-component blends, resembling the corn- and rice-strain female blend we previously described from females in Florida. This response showed some geographic variation in fields in Canada, North Carolina, Florida, Puerto Rico, and South America (Peru, Argentina). In dose-response experiments with the critical secondary sex pheromone component (Z)-7-dodecenyl acetate (Z7-12:OAc), we found some strain-specific differences in male attraction. While the response to Z7-12:OAc varied geographically in the corn-strain, rice-strain males showed almost no variation. We also found that the minor compound (Z)-11-hexadecenyl acetate (Z11-16:OAc) did not increase attraction of both strains in Florida and of corn-strain males in Peru. In a fourth experiment, where we added the stereo-isomer of the critical sex pheromone component, (E)-7-dodecenyl acetate, to the major pheromone component (Z)-9-tetradecenyl acetate (Z9-14:OAc), we found that this compound was attractive to males in North Carolina, but not to males in Peru. Overall, our results suggest that both strains show rather geographic than strain-specific differences in their response to pheromone lures, and that regional sexual communication differences might cause geographic differentiation between populations.Fil: Unbehend, Melanie. Instituto Max Planck Institut Fur Chemische Okologie; AlemaniaFil: Hänniger, Sabine. Instituto Max Planck Institut Fur Chemische Okologie; AlemaniaFil: Vasquez, Gissella M.. University Of North Carolina; Estados UnidosFil: Juárez, María Laura. Gobierno de Tucumán. Ministerio de Desarrollo Productivo. Estación Experimental Agroindustrial Obispo Colombres; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Tucumán; ArgentinaFil: Reisig, Dominic. University Of North Carolina; Estados UnidosFil: Mcneil, Jeremy N.. University of Western Ontario. Department of Biology; CanadáFil: Meagher, Robert L.. United States Department Of Agriculture; Estados UnidosFil: Jenkins, David A.. United States Department of Agriculture; ArgentinaFil: Heckel, David G.. Instituto Max Planck Institut Fur Chemische Okologie; AlemaniaFil: Groot, Astrid T.. University Of Amsterdam; Países Bajos. Instituto Max Planck Institut Fur Chemische Okologie; Alemani

Partial order and contextual net semantics for atomic and locally atomic CC programs

We present two concurrent semantics (i.e. semantics where concurrency is explicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extensión of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism information for the considered languages. We prove some properties about the relation between the two semantics, and also about the relation between them and the operational semantics. Moreover, we discuss how to use the contextual net semantics in the context of CLP programs. More precisely, by interpreting concurrency as possible parallelism, our semantics can be useful for a safe parallelization of some CLP computation steps. Dually, the dependency information may also be interpreted as necessary sequentialization, thus possibly exploiting it for the task of scheduling CC programs. Moreover, our semantics is also suitable for CC programs with a new kind of atomic tell (called locally atomic tell), which checks for consistency only the constraints it depends on. Such a tell achieves a reasonable trade-off between efficiency and atomicity, since the checked constraints can be stored in a local memory and are thus easily accessible even in a distributed implementation

Justness: A Completeness Criterion for Capturing Liveness Properties (Extended Abstract)

This paper poses that transition systems constitute a good model of distributed systems only in combination with a criterion telling which paths model complete runs of the represented systems. Among such criteria, progress is too weak to capture relevant liveness properties, and fairness is often too strong; for typical applications we advocate the intermediate criterion of justness. Previously, we proposed a definition of justness in terms of an asymmetric concurrency relation between transitions. Here we define such a concurrency relation for the transition systems associated to the process algebra CCS as well as its extensions with broadcast communication and signals, thereby making these process algebras suitable for capturing liveness properties requiring justness.Comment: An extended abstract of this paper appears in Proc. FoSSaCS'1

Service orchestration with priority constraints

Business process management is an operational management approach that focuses on improving business processes. Business processes, i.e., collections of important activities in an organization, are represented in the form of a workflow, an orchestrated and repeatable pattern of activities amenable to automated analysis and control. Priority is an important concept in modeling workflows. We need priority to model cancelable and compensable tasks within transactional business processes. We use the Reo coordination language to model and formally analyze workflows. In this paper, we propose a constraint-based approach to formalize priority in Reo. We introduce special channels to propagate and block priority flows, define their semantics as constraints, and model priority propagation as a constraint satisfaction problem

Representing Dependencies in Event Structures

Event structures where the causality may explicitly change during a computation have recently gained the stage. In this kind of event structures the changes in the set of the causes of an event are triggered by modifiers that may add or remove dependencies, thus making the happening of an event contextual. Still the focus is always on the dependencies of the event. In this paper we promote the idea that the context determined by the modifiers plays a major role, and the context itself determines not only the causes but also what causality should be. Modifiers are then used to understand when an event (or a set of events) can be added to a configuration, together with a set of events modeling dependencies, which will play a less important role. We show that most of the notions of Event Structure presented in literature can be translated into this new kind of event structure, preserving the main notion, namely the one of configuration