Serge Haddad was professor at Université Paris-Dauphine when I obtained a position of professor there in september 2004. We did some research work together from this time on, and this cooperation went on after our respective position changes : in Ecole Normale Supérieure de Cachan (feb. 2008) for S. Haddad and in Université Pierre et Marie Curie (sept. 2008) for me. More precisely, a first step...

This paper discusses an experience in computer-supported test case generation for ATM protocols, viz. the AAL3/4 protocol (ATM Adaptation Layer Type 3/4) and CLNAP (Connectionless Network Access Protocol). The test cases were generated by means of the test generation tool GeneTest based on protocol specifications as product nets, i.e. as a special kind of high-level Petri net.

Time Petri nets (TPNs) are a popular Petri net model for specification and verification of real-time systems. A fundamental and most widely applied method for analyzing Petri nets is reachability analysis. The existing technique for reachability analysis of TPNs, however, is not suitable for timing property verification because one cannot derive end-to-end delay in task execution, an important ...

In this paper we propose an on-line diagnosis algorithm for Time Petri Nets (TPN). The plant observation is given by a subset of transitions and the faults are modeled by a subset of unobservable transitions. The plant behavior is derived on-line and the diagnosis is obtained checking whether or not some or all of the traces in the behavior that obey the plant observation contain fault events. ...

The highly concurrent time discrete event systems modeled by Time Petri Net (TPN) suffer from the problem of the state space explosion owing to a large number of accessible markings. To handle this problem, this paper proposes a new solution based on modelling in discrete time the reachable markings of TPN using a new structure so-called Time Reduced Ordered Binary Decision Diagrams (TROBDDs). ...

In this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such an approach are that very eecient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. We rst characterize the class of stochastic Petri nets of interest by formally deening a number...

We consider an extension of Timed Petri Nets “à la Ramchandani” where the transitions are partitioned into delayable and non-delayable which has proven to be suitable for design synchronous circuits. For this model called Delayable Net (DTPN), firing delay a transition is strict whereas can miss its delay. Since delays natural numbers, studied as discrete time model.We deal with expressiveness ...

I n this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such a n approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. W e first characterize the class of stochastic Petri nets of interest by formally defining ...

Long-term total parenteral nutrition (TPN) is known to be associated with cholestasis and hepatic steatosis, which can be lethal in infants who cannot be fed orally. The present review focuses on the metabolic complications in the liver that may occur due to the excessive administration of fat-free TPN. We have recently developed an infant rat model of hepatic dysfunction and steatosis induced ...

This paper addresses the modeling and analysis of a switching network access node. This is an area of importance due to forthcoming high-speed ATM backbone networks and the need to transmit data for current and future network applications. The nature of these applications must be considered when designing an access node to a switching network. A tra c arrival process for the network and charact...