Publications
] Filters: First Letter Of Last Name is S [Clear All Filters]
[IPCaGiMaReSeSi07] .
2007. State Estimation of Petri Nets by Transformation. :194-199.
[IPMaCaGiSe07] .
2007. A State Estimation Problem for Timed Continuous Petri Nets. :1770-1775.
[PJCS-96a] .
1996. State Machine Reduction for the Approximate Performance Evaluation of Manufacturing Systems Modelled with Cooperating Sequential Processes. :1159-1165.
[IPMaRaReSi05] .
2005. Steady state control, zero valued poles and token conservation laws in continuous net systems.
[IPReJuSi02] .
2002. Steady State Performance evaluation for some continuous Petri nets. :N479.
[CS-Lyon-89] .
1989. Steady State Performance Evaluation of Totally Open Systems of Markovian Sequential Processes. :559-585.
[IPVaReSi08] .
2008. Stochastic-Continuous State Approximation of Markovian Petri Net Systems. IEEE Conference on Decision and Control.
[1081] .
1997. Structural Analysis of Signal Transition Graphs.. Workshop Petri Nets in System Engineering (PNSE’97). Modelling, Verification and Validation. :123-134.
[IPMoHaSeSi01] .
2001. Structural Characterisation and Qualitative Properties of Product Form Stochastic Petri Nets.
[SC-Erlangen-95] .
1995. Structural Performance Analysis of Stochastic Petri Nets. :61-70.
[CDS-StMalo-97] .
1997. Structured Solution of Stochastic DSSP Systems. :91-100.
[1393] .
2009. Table-based Method for Reconfigurable Function Evaluation. 23rd IEEE International Symposium on Parallel and Distributed Processing (IPDPS) 2009.
[1399] .
2007. Table-based Recursive Method for Function Evaluation. Numerical Analysis and Applied Mathematics 2007.
[RP-97-06] .
1997. Throughput Approximation of Decision Free Processes Using Decomposition. :174-182.
[CSS-Melbourne-91] .
1991. Throughput Lower Bounds for Markovian Petri Nets Transformation Techniques. :322-331.
[CS-Melbourne-91] .
1991. Throughput Upper Bounds for Markovian Petri Nets Embedded Subnets and Queueing Networks. :312-321.
[RP-96-12] .
1996. A Throughtput Approximation Algorithm for Decision Free Processes. :161-178.
[278] .
1989. Tight Polynomial Bounds for Steady-State Performance of Marked Graphs. Third IEEE International Workshop on Petri Nets and Performance Models (PNPM'89). :200-209.
[IPVaMaMiReSi08] .
2008. Timing and Deadlock-freeness in Continuous Petri Nets. IFAC World Congress. 17
[1267] .
2010. Timing-dependent boundedness and liveness in continuous Petri nets. 10th International Workshop on Discrete Event Systems (WODES).
[RP-90-02] .
1990. Top-down synthesis of live & bounded Free Choice Nets. :63-83.
[IPXuReSi06] .
2006. Tracking control of join-free timed continuous Petri net systems.
[RP-80-08] .
1980. Traducción de expresiones lógicas: aplicación en autómatas programables y en la enseñanza. :664-670.
[RZS-04] .
2004. Two Heuristics for the Improvement of a Two-Phase Optimization Method for Manufacturing Systems. :1686-1692.
[ZRS-Wod00] .
2000. A Two Phase Optimisation Strategy for DEDS Application to Manufacturing Systems. :291-298.
