Abstract reduction in directed model checking CCS processes

Model checking tools face a combinatorial blow up of the state-space (commonly known as the state explosion problem) that must be addressed to formally verify concurrent systems. We propose an approach combining abstraction techniques and heuristic search to overcome the problem above. In particular, heuristic search can avoid the bottleneck of the exhaustive exploration of the global state graph of a system, while retaining the advantages of abstraction techniques.     

Modular formal verification of specifications of concurrent systems

In this paper, we propose a bottom‐up approach for the verification of systems with modular structure: we prove that when the modules are composed in specific ways, the complete software system verifies a composition of the properties each component does. We focus on the process of upgrading systems with new functionalities, where the validity of old requirements needs to be ensured, but also an understanding of the new properties the upgraded system would enjoy is useful. In this work, we assume each component to be specified by a CCS process, and the properties to be expressed by selective mu‐calculus formulae. Copyright © 2007 John Wiley & Sons, Ltd.     

Malignant pleural mesothelioma

A series of 12 cases of mesothelioma is presented, and the data in the literature is reviewed in an attempt to formulate a program of treatment for this malignant, fast-growing and rapidly fatal tumor.     

Logic Based Abstractions of Real-Time Systems

When verifying concurrent systems described by transition systems, state explosion is one of the most serious problems. If quantitative temporal information (expressed by clock ticks) is considered, state explosion is even more serious. We present a notion of abstraction of transition systems, where the abstraction is driven by the formulae of a quantitative temporal logic, called qu-mu-calculus, defined in the paper. The abstraction is based on a notion of bisimulation equivalence, called , n-equivalence, where is a set of actions and n is a natural number. It is proved that two transition systems are , n-equivalent iff they give the same truth value to all qu-mu-calculus formulae such that the actions occurring in the modal operators are contained in , and with time constraints whose values are less than or equal to n. We present a non-standard (abstract) semantics for a timed process algebra able to produce reduced transition systems for checking formulae. The abstract semantics, parametric with respect to a set of actions and a natural number n, produces a reduced transition system , n-equivalent to the standard one. A transformational method is also defined, by means of which it is possible to syntactically transform a program into a smaller one, still preserving , n-equivalence.     

Reduced Models for Efficient CCS Verification

Verification of a concurrent system can be accomplished by model checking the properties on a structure representing the system; this structure is, in general, a transition system which contains a prohibitive number of states. In this paper, we apply a method to reduce the state explosion problem by pointing out the events of the system to be ignored on the basis of the property to be verified. We evaluate the method by means of a real application used as a case study: the system is specified by a CCS program, then the program is reduced by means of syntactic rules; afterwards, the corresponding transition system is built by means of a non-standard operational semantics, which performs further reductions during the construction. Prototype tools perform both kinds of reductions; finally the required properties are checked by means of the model checkers of the CWB-NC.     

Evaluating the impact of smart technologies on harbor’s logistics via BPMN modeling and simulation

A smart Information and Communication Technology (ICT) enables a synchronized interplay of different key factors, aligning infrastructures, consumers, and governmental policy-making needs. In the harbor’s logistics context, smart ICT has been driving a multi-year wave of growth. Although there is a standalone value in the technological innovation of a task, the impact of a new smart technology is unknown without quantitative analysis methods on the end-to-end process. In this paper, we first present a review of the smart ICT for marine container terminals, and then we propose to evaluate the impact of such smart ICT via business process model and notation (BPMN) modeling and simulation. The proposed approach is discussed in a real-world modeling and simulation analysis, made on a pilot terminal of the Port of Leghorn (Italy).     

Concurrent behavior: A construct to specify the external behavior of objects in object databases

We present a linguistic construct to define concurrency control for the objects of an object database. This construct, calledconcurrent behavior, allows to define a concurrency control specification for each object type in the database; in a sense, it can be seen as a type extension. The concurrent behavior is composed by two parts: the first one, calledcommutativity specification, is a set of conditional rules, by which the programmer specifies when two methods do not conflict each other. The second part, the constraint specification, is a set of guarded regular expressions, calledconstraints, by which the programmer defines the allowed sequences of method calls. At each time during an actual execution, a subset of constraints may be active so limiting the external behavior of the object. A constraint becomesactive when its guard is verified, where a guard is composed of the occurrence of some method callm along with the verification of a boolean expression on the object state and the actual parameters ofm. A constraint dies when a string of the language corresponding to the regular expression has been recognized. While the commutativity specification is devoted to specify the way in which the external behavior of an object is influenced by the existence of concurrent transactions in the system, the constraint specification defines the behavior of the object, independently from the transactions. Since the two parts of the concurrent behavior are syntactically distinct and, moreover, each of them consists of a set of independent rules, modularity in specifying the objects is enhanced, with respect to a unique specification. We outline an implementation of the construct, which is based on a look-ahead policy: at each method execution, we foresee the admissible successive behaviors of the object, instead of checking the admission of each request at the time it is actually made.     

Intraperitoneal hyperthermic chemotherapy in gastric cancer: rationale for a new approach

A survey of ectoparasites from 219 meadowlarks conducted during 2 consecutive fall-winter periods in a coastal prairie found immature Amblyomma maculatum Koch to be the most abundant parasite. Peak larval infestations occurred in December with 80-100% of collected birds infested and with a monthly mean of up to 34 larvae per bird. Peak nymphal infestations occurred in February or March with 95-100% of birds infested and with a monthly mean of up to 11 nymphs per bird. Seasonal dynamics of these stages offered possible insight into the persistence of A. maculatum in an area long infested with the red imported fire ant, Solenopsis invicta Buren. Four other species of ticks also were collected but in substantially lower numbers; Amblyomma cajennense (F.), Amblyomma inornatum (Banks), Haemaphysalis chordeilus (Packard), and Haemaphysalis leporispalustris (Packard). This appears to be the 1st host record of A. cajennense from meadowlarks. A collection of 17 northern bobwhite quail indicated that most of these birds were infested with A. maculatum but at a lower level than meadowlarks. The collections of 2 species of Mallophaga from meadowlarks and 4 species from the northern bobwhite quail are discussed.     

A framework for data-flow distributed processing

A framework for data-flow distributed processing is established through the definition of a data-flow model and a set of language constructs for concurrent programming. The proposed approach is based on the following characteristics: i) the exploitation of parallelism at the operation level leads to the efficient and natural exploitation of parallelism at the program level, and ii) parallelism, communication, nondeterminism and history sensitivity are primitive concepts. The aim of the defined data-flow constructs is to enhance modularity and parallelism of programs. Two structuring levels are introduced, called «modules» and «frames», to permit both symmetric and asymmetric communication. Single assignment and guarded commands are employed inside modules. Examples of tipical programming problems, including shared resources management, are given together with a short account of a distributed data-flow architecture able to support data-flow distributed processing efficiently.     

A Petri nets semantics for data flow networks

This work presents a truly concurrent operational semantics for nondeterministic data flow networks. We introduce a model, the df-process, which is a notion similar to that of non-sequential process for a Petri net: a df-process is defined as a mapping from an occurrence net K to a data flow net N, such that the places and the transitions of K are mapped onto the channels and the nodes of N. A df-process contains, by means of some labelling of the places, information on the value and the order in which data flow through the channels during a computation. Df-processes for a data flow network are characterized in an abstract way by a set of properties and in general a df-process corresponds to a set of computations of the network. We give a way to build the df-process corresponding to a computation incrementally at each event occurrence: a main result of the paper is that the incremental construction yields exactly the same set of df-processes as abstractly defined. We also show that df-processes are compositional. The model is intended to be used by distributed systems designers: it contains enough information to be a guideline for the designer and to be a base to develop dynamic checking tools. We outline how df-processes can be used in the design phase of a system.Research supported in part by Progetto Coordinato CNR ANATRA