In this paper, the singular-value decomposition theory of complex matrices is explored to study constantly curved 2-spheres minimal in both CPn and hyperquadric CPn. The moduli space all those noncongruent ones introduced, which can be described by certain symmetric modulo an appropriate group action. Using description, many examples, such as holomorphic higher degree, nonhomogenous constant cu...

Currently,modeling for software is mostly semiformal, such as UML(Unified Modeling Language).The main problem is difficult to analyze semantics and verify correctness for a vital system.CPN(Colored Petri Net)as modeling and verification method provides formal semantics and a number of analysis techniques and tools.This paper presents an approach of formal modeling and validation for software pr...

The concept of a Cognitive Packet Network (CPN) is modified in the light of advances in intelligent routing algorithms. To do so, Cognitive and Acknowledgement packets are used to update neural networks at each router with respect to quality of service information. Data is carried by a third class of packets, thus the density of data packets is higher than in the original CPN framework. The sys...

It is known that symmetric orbits in g∗ for any simple Lie algebra g are equiped with a Poisson pencil generated by the Kirillov-Kostant-Souriau bracket and the reduced Sklyanin bracket associated to the ”canonical” R-matrix. We realize quantization of this Poisson pencil on CPn type orbits (i.e. orbits in sl(n + 1)∗ whose real compact form is CPn) by means of q-deformed Verma modules. AMS Math...

A request-level timed stochastic CPN model of a leaf Internet object cache is proposed in this paper. The leaf cache is modelled as a discrete time discrete event dynamic system together with its adjustable input-, measurable output, disturbance and state variables. The CPN model has been veriied and validated against real measured data. The developed model will be used form model-based optimal...

This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...

Colored Petri Nets (CPNs) extend the classical Petri net formalism with data, time, and hierarchy. These extensions make it possible to model complex processes as CPNs without being forced to abstract from relevant aspects. Moreover, CPNs are supported by CPN Tools—a powerful toolset that supports the design and analysis of such processes. The expressiveness of the CPN language enables differen...

Protocol software is important for much of the computer based infrastructure deployed today, and will remain so for the foreseeable future. With current modelling techniques for communication protocols, important properties are modelled and verified. However, most implementations are being done by hand even if good formal models exist. This paper discusses some of the challenges in modelling an...