Publications
Filters: First Letter Of Last Name is B [Clear All Filters]
[1344] Packages for validating discrete production systems modeled with Petri nets. Applied Modelling and Simulation of Technological Systems. :529-536.
.
1987.
.
1989.
[RP-90-08] Minimal Deadlocks in Free Choice nets.
.
1990.
[1027] Petri net Based Modelling, Analysis and Simulation of Pipelined Architectures. P.D. COM'91 IMACS-IFAC International Symposium on Parallel and Distributed Computing in Engineering Systems. :37-38.
.
1991.
[C-DEMON-91] Performance Analysis of Live and Bounded Free Choice Systems. Studien. 198:38-48.
.
1991.
[BaHeMa92] Characterizations of logarithmic advice complexity classes. :315-321.
.
1992.
[1050] Petri net based Modelling, Analysis and Simulation of Pipelined Architectures. Parallel and Distributed Computing in Engineering Systems. :35-40.
.
1992.
[1356] Structure Theory of Non Free Choice Systems. Final Report of the ESPRIT Basis Research Action DEMON (Design Methods based on Nets) Covering the Period 18 June 1989 to 18 March 1992. :130-134.
.
1992.
[State-of-the-art-93] The Timed Coloured Petri Net Formalism Position Paper. 14:3-60.
.
1993.
[BBBCC-QMIPS-94] Annotated Bibliography on Stochastic Petri Nets. 105:25-44.
.
1994.
[245] Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Performance Evaluation of parallel and distributed systems. Solution Methods. :197-213.
.
1994.
[246] A General Iterative Technique for Approximate Throughput Computation of Stochastic Marked Graphs. Performance Evaluation of parallel and distributed systems. Solution Methods. :265-283.
.
1994.
[248] Functional and Performance Analysis of Cooperating Sequential Processes. Performance Evaluation of parallel and distributed systems. Solution Methods. :234-251.
.
1994.
[1069] Implementation of Weighted Place/Transition Nets based on Linear Enabling Functions. Application and Theory of Petri Nets 1994. :99-118.
.
1994.
[1070] Discrete Event Simulation based on Timed Petri Nets using Linear Enabling Functions. 1994 IEEE International Conference on System, Man and Cybernetics. 2:1671-1676.
.
1994.
[BuhMay95] An excursion to the Kolmogorov random strings. :197-203.
.
1995.
[BalMay95] A note on genericity and bi immunity. :193-196.
.
1995.
[238] Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds. Quantitative Methods in Parallel Systems. :161-174.
.
1995.
[239] Approximate Throughput Computation of Stochastic Marked Graphs. Quantitative Methods in Parallel Systems. :175-188.
.
1995.
[243] Functional and Performance Analysis of Cooperating Sequential Processes. Quantitative Methods in Parallel Systems. :52-65.
.
1995.
[BooMay96] On the robustness of ALMOST R. Rairo Informatique Theorique et Applications. 30:123-133.
.
1996.
[ICReTeSi96] SCECS A Class of Modular and Hierarchical Cooperating Systems. 1091:440-459.
.
1996.
[IPSiTe96b] A Systems Theory Perspective of Discrete Event Dynamic Systems The Petri Net Paradigm. Symposium on Discrete Events and Manufacturing Systems. CESA 96 IMACS Multiconference. :1-12.
.
1996.
[PBMRI-96] Descripción de la Herramienta CASE OO-Method. :47.
.
1996.
[BuhMay97] An excursion to the Kolmogorov random strings. Journal of Computer and System Sciences. 54:393-399.
.
1997.