Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
DOI10.1007/978-3-030-99336-8_21zbMath1528.68259arXiv2201.10485OpenAlexW4226090351MaRDI QIDQ6166804
Jana Wagemaker, Jurriaan Rot, Tobias Kappé, Alexandra Silva, Dexter Kozen, Nate Foster
Publication date: 3 August 2023
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.10485
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrent Kleene algebra with tests and branching automata
- The equational theory of pomsets
- A completeness theorem for Kleene algebras and the algebra of regular events
- Series-parallel languages and the bounded-width property
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Concurrent Kleene algebra: free model and completeness
- Concurrent NetCore
- A Coalgebraic Decision Procedure for NetKAT
- Concurrent Kleene Algebra
- The Böhm–Jacopini Theorem Is False, Propositionally
- NetKAT
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
- Two Complete Axiom Systems for the Algebra of Regular Events
This page was built for publication: Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks
