Analysis of a class of communicating finite state machines Wuxu PengS. Purushothaman OriginalPaper Pages: 499 - 522
An experience in proving regular networks of processes by modular model checking Nicolas HalbwachsFabienne LagnierChristophe Ratel OriginalPaper Pages: 523 - 543
Elementary transition systems and refinement M. NielsenG. RozenbergP. S. Thiagarajan OriginalPaper Pages: 555 - 578
Naive asymptotics for hitting time bounds in Markov chains Vernon Rego OriginalPaper Pages: 579 - 594
Two impossibility theorems on behaviour specification of abstract data types Oliver Schoett OriginalPaper Pages: 595 - 621
Classes of systolic Y-tree automata and a comparison with systolic trellis automata E. FachiniA. Maggiolo-SchettiniD. Sangiorgi OriginalPaper Pages: 623 - 643
