On Partial Languages

Publisher Website
Google Scholar
Abstract
The paper studies the behavior of control structures of algorithms designed for (partly) parallel execution. A generalization of Peterson’s computation sequence set, the partial language, is discussed, which reflects the concurrency of events. In particular, the families of partial languages definable by Petri nets and by safe Petri nets are investigated with respect to closedness under certain operations. Trace languages (Mazurkiewicz) and path expressions (Campbell and Habermann) are included in the considerations.

This publication has 0 references indexed in Scilit: