Abstract is missing.
- Non-finite Axiomatisability Results via Reductions: CSP Parallel Composition and CCS RestrictionLuca Aceto, Elli Anastasiadi, Valentina Castiglioni, Anna Ingólfsdóttir. 1-26 [doi]
- Operational Causality - Necessarily Sufficient and Sufficiently NecessaryChristel Baier, Clemens Dubslaff, Florian Funke 0002, Simon Jantsch, Jakob Piribauer, Robin Ziemek. 27-45 [doi]
- Axiomatizing Consciousness with ApplicationsHenk Barendregt, Antonino Raffone. 46-62 [doi]
- Symmetric Transrationals: The Data Type and the Algorithmic Degree of its Equational TheoryJan A. Bergstra, John V. Tucker. 63-80 [doi]
- A Survey of Model Learning Techniques for Recurrent Neural NetworksBenedikt Bollig, Martin Leucker, Daniel Neider. 81-97 [doi]
- Back-and-Forth in Space: On Logics and Bisimilarity in Closure SpacesVincenzo Ciancia, Diego Latella, Mieke Massink, Erik P. de Vink. 98-115 [doi]
- Better Automata Through Process AlgebraRance Cleaveland. 116-136 [doi]
- Family-Based Fingerprint Analysis: A Position PaperCarlos Diego Nascimento Damasceno, Daniel Strüber 0001. 137-150 [doi]
- What's in School? - Topic Maps for Secondary School Computer ScienceAnsgar Fehnker. 151-163 [doi]
- Tree-Based Adaptive Model LearningTiago Ferreira, Gerco van Heerdt, Alexandra Silva 0001. 164-179 [doi]
- From Languages to Behaviors and BackMarkus Frohme, Bernhard Steffen. 180-200 [doi]
- The Quest for an Adequate Semantic Basis of Dense-Time Metric Temporal LogicMartin Fränzle. 201-212 [doi]
- Equivalence Checking 40 Years After: A Review of Bisimulation ToolsHubert Garavel, Frédéric Lang. 213-265 [doi]
- Apartness and Distinguishing Formulas in Hennessy-Milner LogicHerman Geuvers. 266-282 [doi]
- Playing Wordle with Uppaal StrategoPeter Gjøl Jensen, Kim G. Larsen, Marius Mikucionis. 283-305 [doi]
- Using the Parallel ATerm Library for Parallel Model Checking and State Space GenerationJan Friso Groote, Kevin H. J. Jilissen, Maurice Laveaux, P. H. M. van Spaendonck, Tim A. C. Willemse. 306-320 [doi]
- Active Automata Learning as Black-Box Search and Lazy Partition RefinementFalk Howar, Bernhard Steffen. 321-338 [doi]
- A Reconstruction of Ewens' Sampling Formula via Lists of CoinsBart Jacobs 0001. 339-357 [doi]
- Rooted Divergence-Preserving Branching Bisimilarity is a Congruence: A Simpler ProofDavid N. Jansen, Xinxin Liu. 358-370 [doi]
- Learning Language IntersectionsSebastian Junges, Jurriaan Rot. 371-381 [doi]
- Runtime Verification of Compound Components with ComMAIvan Kurtev, Jozef Hooman. 382-402 [doi]
- A Basic Compositional Model for Spiking Neural NetworksNancy A. Lynch, Cameron Musco. 403-449 [doi]
- State Identification and Verification with SatisfactionJoshua Moerman, Thorsten Wißmann. 450-466 [doi]
- A Note on the Message Complexity of Cidon's Distributed Depth-First Search AlgorithmSaidgani Musaev, Wan J. Fokkink. 467-471 [doi]
- Minesweeper is Difficult Indeed! - Technology Scaling for Minesweeper CircuitsAlex Thieme, Twan Basten. 472-490 [doi]
- Goodbye iocoJan Tretmans, Ramon Janssen. 491-511 [doi]
- Process Algebras and Flocks of BirdsRocco De Nicola, Luca Di Stefano 0001, Omar Inverso, Serenella Valiani. 512-523 [doi]
- The Integration of Testing and Program Verification - A Position PaperPetra van den Bos, Marieke Huisman. 524-538 [doi]
- Discovering Directly-Follows Complete Petri Nets from Event DataWil M. P. van der Aalst. 539-558 [doi]
- Fair Must Testing for I/O AutomataRob van Glabbeek. 559-574 [doi]
- Passive Automata Learning: DFAs and NFAsHans Zantema. 575-580 [doi]