Vers un modèle de vérification de la couche logique d'entreprise dans une architecture à 3 couches: modèle CPN-ECA

International audienceThis paper proposes a model for building a flexible system, which accepts and verifies the change on business logic, including both business processes and business rules, while the system has to cover the properties as reliability and reuse. In this model, the business process will be designed with Colour Petri Net and translated into a set of Event-Condition-Action rules, this set will be combined with business rules for checking the respect of a business process to the business rules in design and modifying the process. Hierarchical Colour Petri Net is also used to guarantee the reliability and to reuse properties of the system.Ce document propose un modèle pour la création d'un système flexible, qui accepte et vérifie les modifications apportées à la logique métier, y compris les processus et les règles métier, tandis que le système doit couvrir les propriétés en termes de fiabilité et de réutilisation. Dans ce modèle, le processus de gestion sera conçu avec un réseau Pétri coloré et traduit en un ensemble de règles Event-Condition-Action (ECA). Cet ensemble sera combiné à des règles de gestion permettant de vérifier le respect du processus de gestion par modifier le processus. Un réseau Pétri coloré hiérarchisé est également utilisé pour garantir la fiabilité et pour réutiliser les propriétés du systèm

On functional module detection in metabolic networks

Functional modules of metabolic networks are essential for understanding the metabolism of an organism as a whole. With the vast amount of experimental data and the construction of complex and large-scale, often genome-wide, models, the computer-aided identification of functional modules becomes more and more important. Since steady states play a key role in biology, many methods have been developed in that context, for example, elementary flux modes, extreme pathways, transition invariants and place invariants. Metabolic networks can be studied also from the point of view of graph theory, and algorithms for graph decomposition have been applied for the identification of functional modules. A prominent and currently intensively discussed field of methods in graph theory addresses the Q-modularity. In this paper, we recall known concepts of module detection based on the steady-state assumption, focusing on transition-invariants (elementary modes) and their computation as minimal solutions of systems of Diophantine equations. We present the Fourier-Motzkin algorithm in detail. Afterwards, we introduce the Q-modularity as an example for a useful non-steady-state method and its application to metabolic networks. To illustrate and discuss the concepts of invariants and Q-modularity, we apply a part of the central carbon metabolism in potato tubers (Solanum tuberosum) as running example. The intention of the paper is to give a compact presentation of known steady-state concepts from a graph-theoretical viewpoint in the context of network decomposition and reduction and to introduce the application of Q-modularity to metabolic Petri net models

Formalization and Verification of Hierarchical Use of Interaction Overview Diagrams Using Timing Diagrams

Thanks to its graphical notation and simplicity, Unified Modeling Language (UML) is a de facto standard and a widespread language used in both industry and academia, despite the fact that its semantics is still informal. The Interaction Overview Diagram (IOD) is introduced in UML2; it allows the specification of the behavior in the hierarchical way. This paper is a contribution towards a formal dynamic semantics of UML2. We start by formalizing the Hierarchical use of IOD. Afterward, we complete the mapping of IOD, Sequence Diagrams and Timing Diagrams into Hierarchical Colored Petri Nets (HCPNs) using the Timed colored Petri Nets (timed CP-net). Our approach helps designers to get benefits from abstraction as well as refinement at more than two levels of hierarchy which reduces verification complexity.Comment: 8 pages, 6 figure

Backward Reachability Analysis of Colored Petri Nets

International audienceThis 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 associated to tokens. That is why, the First-Order MILL (MILL1) is used for translation. The reachability between two markings, the initial marking and the final marking, is expressed by a sequent which can be proven (if the initial marking is backward-reachable from the final one) using first-order terms unification and/or marking enhancement

Proceedings of SUMo and CompoNet 2011

International audienc

A hazard analysis via an improved timed colored petri net with time–space coupling safety constraint

AbstractPetri nets are graphical and mathematical tools that are applicable to many systems for modeling, simulation, and analysis. With the emergence of the concept of partitioning in time and space domains proposed in avionics application standard software interface (ARINC 653), it has become difficult to analyze time–space coupling hazards resulting from resource partitioning using classical or advanced Petri nets. In this paper, we propose a time–space coupling safety constraint and an improved timed colored Petri net with imposed time–space coupling safety constraints (TCCP-NET) to fill this requirement gap. Time–space coupling hazard analysis is conducted in three steps: specification modeling, simulation execution, and results analysis. A TCCP-NET is employed to model and analyze integrated modular avionics (IMA), a real-time, safety-critical system. The analysis results are used to verify whether there exist time–space coupling hazards at runtime. The method we propose demonstrates superior modeling of safety-critical real-time systems as it can specify resource allocations in both time and space domains. TCCP-NETs can effectively detect underlying time–space coupling hazards