( en | de | ru )

 

Disambiguation of "Haddad, Serge"

Author of the publication

copydeleteadd this publication to your clipboard
The expressive power of time Petri nets.

, , , , and . Theor. Comput. Sci., (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Elena Sergeyev

Nikolai Sergeev

Tatiana Sergey

Dieter Sergel

Jean-Frédéric Sergejew

 

Other publications of authors with the same name

On the Computational Power of Timed Differentiable Petri Nets., , and . FORMATS, volume 4202 of Lecture Notes in Computer Science, page 230-244. Springer, (2006)Interopérabilité des systèmes multi-agents à l'aide des services web., , , and . JFSMA, page 91-104. Lavoisier, (2004)A reduction theory for coloured nets.. European Workshop on Applications and Theory in Petri Nets, volume 424 of Lecture Notes in Computer Science, page 209-235. Springer, (1988)Generative Families of Positive Invariants in Coloured Nets Sub-Classes., , and . Applications and Theory of Petri Nets, volume 674 of Lecture Notes in Computer Science, page 51-70. Springer, (1991)Diagnosis and Degradation Control for Probabilistic Systems., , and . Discret. Event Dyn. Syst., 30 (4): 695-723 (2020)Assessment of ESTELLE and EDT Through Real Case Studies., , and . PSTV, volume C-16 of IFIP Transactions, page 223-238. North-Holland, (1993)Computing Optimal Repair Strategies by Means of NdRFT Modeling and Analysis., , , and . Comput. J., 57 (12): 1870-1892 (2014)Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models., and . LATA, volume 12038 of Lecture Notes in Computer Science, page 170-183. Springer, (2020)Coverability, Termination, and Finiteness in Recursive Petri Nets., , and . CoRR, (2021)Theoretical Aspects of Recursive Petri Nets., and . ICATPN, volume 1639 of Lecture Notes in Computer Science, page 228-247. Springer, (1999)