Identifiers in Registers - Describing Network Algorithms with Logic

Communicating Finite-State Machines Capture First-Order Logic with "Happened Before"

Communicating Finite-State Machines and Two-Variable Logic

One-Counter Automata with Counter Observability

  • Queen Mary University of London, January 2017

  • 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'16), Chennai, India, December 2016

  • Institut de Recherche en Informatique Fondamentale, Paris, November 2016

Automata and Logics for Distributed Systems

Tutorial at Highlights'16, Brussels, September 2016

Logic for Communicating Automata with Parameterized Toplogy

Automata, Logic and Games, Singapore, August 2016

Please reload