Showing papers in "Journal of Automata, Languages and Combinatorics in 1991"

On Time Petri Nets.

Abstract: In this chapter we study Time Petri nets: After the introduction of this kind of time-dependent Petri net, we will discuss variations of the rules defining the possible state changes. We then show how to reduce the state space of an arbitrary Time Petri net to a discrete one and use this to study the dynamic behavior of these time-dependent Petri nets under both qualitative and quantitative aspects.

A Three-dimensional Bin Packing Algorithm

Abstract: In this paper an approximation algorithm for the three-dimensional bin packing problem is proposed and its performance bound is investigated. To obtain such a bound a modified bin packing algorithm is considered for a two-dimensional problem with bounded bin and its area utilization is estimated. Finally, a hard example gives a lower bound of the performance bound. '

On Codes having Dual Distance d'>=k.

Abstract: Keywords: Linear codes MDS-codes AMS Subject classiication (1985) 94B05 Summary: We give several bounds for the length, dimension or minimum distance of linear block codes whose dimension equals the minimum distance of their dual codes. Zusammenfassung: Wir geben verschiedene Schranken f ur die L ange, die Dimension und den Minimalabstand linearer Blockcodes, deren Dimension gleich dem Mini-malabstand ihrer dualen Codes ist, an.