Creative Commons
| Preface J.-P. Katoen and B. König | ||
| Vector Addition System Reversible Reachability Problem | ||
| Jérôme Leroux | ||
| Coarse abstractions make Zeno behaviours difficult to detect | ||
| Frédéric Herbreteau and B. Srivathsan | ||
| Bisimulations Meet PCTL Equivalences for Probabilistic Automata | ||
| Lei Song, Lijun Zhang, Jens Chr. Godskesen and Flemming Nielson | ||
| Connector algebras for C/E and P/T nets' interactions | ||
| Roberto Bruni, Hernan Melgratti, Ugo Montanari and Pawel Sobocinski | ||
| A Static Analysis Framework for Livelock Freedom in CSP | ||
| Joel Ouaknine, Hristina Palikareva, A. W. Roscoe and James Worrell | ||