Composing Constraint Automata, State-by-State. - Sung-Shik T. Q. Jongmans; Tobias Kappé; Farhad Arbab (FACS, 2015)

Formal Specification and Analysis of Robust Adaptive Distributed Cyber-Physical Systems. - Carolyn L. Talcott; Vivek Nigam; Farhad Arbab; Tobias Kappé (SFM, 2016)

A Compositional Framework for Preference-Aware Agents. - Tobias Kappé; Farhad Arbab; Carolyn L. Talcott (V2CPS@IFM, 2016)

Brzozowski Goes Concurrent - A Kleene Theorem for Pomset Languages. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (CONCUR, 2017)

A Component-Oriented Framework for Autonomous Agents. - Tobias Kappé; Farhad Arbab; Carolyn L. Talcott (FACS, 2017)

Constraint automata with memory cells and their composition. - Sung-Shik T. Q. Jongmans; Tobias Kappé; Farhad Arbab (Sci. Comput. Program., 2017)

Learning to Coordinate. - Gerco van Heerdt; Bart Jacobs 001; Tobias Kappé; Alexandra Silva 001 (It's All About Coordination, 2018)

Concurrent Kleene Algebra: Free Model and Completeness. - Tobias Kappé; Paul Brunet; Alexandra Silva 001; Fabio Zanasi (ESOP, 2018)

Decision problems for Clark-congruential languages. - Makoto Kanazawa; Tobias Kappé (ICGI, 2018)

Tree Automata as Algebras: Minimisation and Determinisation. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CALCO, 2019)

Kleene Algebra with Observations. - Tobias Kappé; Paul Brunet; Jurriaan Rot; Alexandra Silva 001; Jana Wagemaker; Fabio Zanasi (CONCUR, 2019)

Completeness and Incompleteness of Synchronous Kleene Algebra. - Jana Wagemaker; Marcello M. Bonsangue; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (MPC, 2019)

On series-parallel pomset languages: Rationality, context-freeness and automata. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (J. Log. Algebraic Methods Program., 2019)

Soft component automata: Composition, compilation, logic, and verification. - Tobias Kappé; Benjamin Lion; Farhad Arbab; Carolyn L. Talcott (Sci. Comput. Program., 2019)

Partially Observable Concurrent Kleene Algebra. - Jana Wagemaker; Paul Brunet; Simon Docherty; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (CONCUR, 2020)

Concurrent Kleene Algebra with Observations: From Hypotheses to Completeness. - Tobias Kappé; Paul Brunet; Alexandra Silva 001; Jana Wagemaker; Fabio Zanasi (FoSSaCS, 2020)

Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. - Steffen Smolka; Nate Foster; Justin Hsu; Tobias Kappé; Dexter Kozen; Alexandra Silva 001 (Proc. ACM Program. Lang., 2020)

Concurrent Kleene Algebra: completeness and decidability. - Tobias Kappé (2020)

Learning Pomset Automata. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Alexandra Silva 001 (FoSSaCS, 2021)

Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness. - Todd Schmid; Tobias Kappé; Dexter Kozen; Alexandra Silva 001 (ICALP, 2021)

Equivalence checking for weak bi-Kleene algebra. - Tobias Kappé; Paul Brunet; Bas Luttik; Alexandra Silva 001; Fabio Zanasi (Log. Methods Comput. Sci., 2021)

A Categorical Framework for Learning Generalised Tree Automata. - Gerco van Heerdt; Tobias Kappé; Jurriaan Rot; Matteo Sammartino; Alexandra Silva 001 (CMCS, 2022)

Concurrent NetKAT - Modeling and analyzing stateful, concurrent networks. - Jana Wagemaker; Nate Foster; Tobias Kappé; Dexter Kozen; Jurriaan Rot; Alexandra Silva 001 (ESOP, 2022)

Leapfrog: certified equivalence for protocol parsers. - Ryan Doenges; Tobias Kappé; John Sarracino; Nate Foster; Greg Morrisett (PLDI, 2022)

Completeness and the Finite Model Property for Kleene Algebra, Reconsidered. - Tobias Kappé (RAMiCS, 2023)

A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests. - Todd Schmid; Tobias Kappé; Alexandra Silva 001 (ESOP, 2023)

Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity. - Wojciech Rozowski; Tobias Kappé; Dexter Kozen; Todd Schmid; Alexandra Silva 001 (ICALP, 2023)

Formal Abstractions for Packet Scheduling. - Anshuman Mohan; Yunhe Liu 002; Nate Foster; Tobias Kappé; Dexter Kozen (Zenodo, 2023)

Formal Abstractions for Packet Scheduling. - Anshuman Mohan; Yunhe Liu 002; Nate Foster; Tobias Kappé; Dexter Kozen (Proc. ACM Program. Lang., 2023)

A General Completeness Theorem for Skip-Free Star Algebras. - Tobias Kappé; Todd Schmid (FoSSaCS, 2025)

On Propositional Program Equivalence (Extended Abstract). - Tobias Kappé (WoLLIC, 2025)

Algebras for Deterministic Computation Are Inherently Incomplete. - Balder ten Cate; Tobias Kappé (Proc. ACM Program. Lang., 2025)

StacKAT: Infinite State Network Verification. - Jules Jacobs; Nate Foster; Tobias Kappé; Dexter Kozen; Lily Saada; Alexandra Silva 001; Jana Wagemaker (Proc. ACM Program. Lang., 2025)

CF-GKAT: Efficient Validation of Control-Flow Transformations. - Cheng Zhang 026; Tobias Kappé; David E. Narváez; Nico Naus (Proc. ACM Program. Lang., 2025)