This paper is in the framework of the specification and the verification of concurrent dynamic systems. We are interested by recursive Petri net specification model for which we define a maximality semantics. The underlying semantic model is a maximality-based labeled transition system. For this purpose, we propose a maximality operational semantic for recursive Petri nets. As an illustration, ...

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set P = {p1, . . . , pn} ⊂ Z2 a maximal integral point set over Z2 if all pairwise distances are integral and every additional point pn+1 destroys this property. Here we consider such sets for a given cardinality and with minimum possible diameter. We determine some exact values via exhaust...

Experiments strongly suggest that the flavour mixing responsible for the atmospheric neutrino anomaly is very close to being maximal. Thus, it is of great theoretical as well as experimental importance to measure any possible deviation from maximality. In this context, we reexamine the effects of matter interactions in long baseline neutrino oscillation experiments. Contrary to popular belief, ...

In this paper, a new semantic model is proposed for characterizing the performance properties of stochastic concurrent systems, called Maximality-based Labeled Stochastic Transition System (MLSTS). A Stochastic Process Algebra, called S-LOTOS, is associated with these MLSTS models as a specification language to describe the stochastic temporal aspects of concurrent systems under the assumption ...

In this paper, we propose a parallel algorithm for mining maximal itemsets. We propose POP-MAX (Parallel Order Preserving MAXimal itemset algorithm), a fast and memory efficient parallel algorithm which enumerates all the maximal patterns concurrently and independently across several nodes. Also, POP-MAX uses an efficient maximality checking technique which determines the maximality of an items...

The branch of coding theory that is based on formal languages has produced several methods for defining code properties, including word relations, dependence systems, implicational conditions, trajectories, and language inequations. Of those, the latter three can be viewed as formal methods in the sense that a certain formal expression can be used to denote a code property. Here we present a fo...