DyNetKAT: an algebra of dynamic networks
From MaRDI portal
Publication:6181928
DOI10.1007/978-3-030-99253-8_10arXiv2102.10035OpenAlexW3132516205MaRDI QIDQ6181928
Georgiana Caltais, Hossein Hojjat, Mohammadreza Mousavi, Hünkar Can Tunç
Publication date: 23 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.10035
process algebraequational reasoningsoftware defined networksdynamic updatesNetKATdynamic network reconfiguration
Cites Work
- Unnamed Item
- Unnamed Item
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Turning SOS rules into equations
- Optimal consistent network updates in polynomial time
- Modular structural operational semantics
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Notions of bisimulation and congruence formats for SOS with data
- Probabilistic NetKAT
- A Coalgebraic Decision Procedure for NetKAT
- Process Algebra
- NetKAT
This page was built for publication: DyNetKAT: an algebra of dynamic networks