Virgil Emil Cazanescu, Gheorghe Stefanescu:
A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization.
1-63
James Hein:
Completions of Perpetual Logic Programs.
65-78
Jean-Luc Lambert:
A Structure to Decide Reachability in Petri Nets.
79-104
Wim H. Hesselink:
Processes and Formalism for Unbounded Choice.
105-119
