CoFluent Design Patent applications |
Patent application number | Title | Published |
20110246168 | METHOD FOR SIMULATING A COMPLEX SYSTEM WITH EXPANSION OF INSTANCE VECTORS, CORRESPONDING COMPUTER PROGRAM PRODUCT AND STORAGE MEANS - A method for simulating a complex system including a plurality of constituents is provided. The method includes constructing at least one complex system model, each system model including a hierarchised set of modelled constituents. The construction step includes, for each model, obtaining a multiple instance hierarchical model including at least one instance vector corresponding to a plurality of instances of one and the same modelled constituent, each instance vector being able to be located at any level of a hierarchical decomposition tree of the multiple instance hierarchical model. The construction step additionally includes, for each model, expanding the multiple instance hierarchical model into an expanded model by expansion of at least one instance vector included in the multiple instance hierarchical model. | 10-06-2011 |
20110246158 | METHOD FOR SIMULATING A COMPLEX SYSTEM WITH CONSTRUCTION OF AT LEAST ONE MODEL INCLUDING AT LEAST ONE MODELLED ROUTER, CORRESPONDING COMPUTER SOFTWARE PACKAGE AND STORAGE MEANS - A method is provided for constructing at least a functional model of a complex system including a plurality of components. The method includes constructing the functional model of the complex system, including a hierarchized set of modelled functional components. Each of the functional modelled components is an instance of an object class belonging to a specific set of object classes. The specific set of object classes includes a “Functional Router” class, representing an abstract model of a dummy router, which describes a set of interconnections between at least two modelled functional components, each instance of the “Functional Router” class being called a modelled functional router. The functional model of the system includes at least one functional modelled router. | 10-06-2011 |
20080243464 | METHOD OF TRANSACTIONAL SIMULATION OF A GENERIC COMMUNICATION NODE MODEL, AND THE CORRESPONDING COMPUTER PROGRAM PRODUCT AND STORAGE MEANS - A method of transactional simulation of a generic communication node model is proposed. The method includes steps, performed at each simulation step corresponding to transaction start events and transaction end events, including: calculating a remaining quantity of data to be transmitted for each transaction not completed in a list of current transactions; if the simulation step corresponds to the start of a new transaction, calculating a quantity of data to be transmitted for the new transaction and adding the new transaction to the list of current transaction; if the simulation step corresponds to the end of the transaction, removing the transaction from the list of current transactions; allocating throughputs to the current transactions, according to a predetermined node sharing policy; calculating a duration up to the closest end time of one of the current transactions; and assigning a wait for the duration before generation of the next transaction end event. | 10-02-2008 |
20080228461 | Method of Simulating a Complex System Including Scheduler Hierarchy, and Corresponding Storage Means and Computer Program Product - A method is provided for simulating a complex system including a scheduler hierarchy. The complex system includes at least one processor that executes a set of functions under the control of a hierarchical group of schedulers. The method includes a step of constructing an architectural model of the complex system comprising a hierarchical group of components, each of said components comprising an instance of an object class belonging to the group containing: a first class, known as the Processor class, which represents an abstract model of any processor included in the complex system, a second class, known as the Function class, which represents an abstract model of any function executed by the complex system; and a third class, known as the Scheduler class, which represents an abstract model of any scheduler. Each instance is initialised with at least one attribute that characterises the behaviour desired therefrom. | 09-18-2008 |