In: Proceedings of the 11th International Conference on Application and Theory of Petri Nets, 1990, Paris, France, pages 451-470. 1990.
Abstract: The authors describe how a net-theoretical implementation of the FP2 parallel language has been used to overcome problems with combinatorial explosions in the implementation of parallelism. FP2 programs are implemented via some kind of interpreted Petri nets (called RFP2 presentations). Formal results on correctness and efficiency are given.
Keywords: FP2 parallel language implementation; efficiency.