
doi: 10.3233/fi-1981-4210
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.
Formal languages and automata, Petri net, computation sequence set, partial word, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), concurrent processes, concurrency, trace language, parallel execution, behavior of control structures of algorithms, path expression
Formal languages and automata, Petri net, computation sequence set, partial word, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), concurrent processes, concurrency, trace language, parallel execution, behavior of control structures of algorithms, path expression
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 95 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
