Netter: probabilistic, stateful network models

DOI10.1007/978-3-030-67067-2_22MaRDI QIDQ2234099zbMATH OpenOpenAlexFDO

Authors Han Zhang, Chi Zhang, Arthur Azevedo de Amorim, Yuvraj Agarwal, Matt Fredrikson, Limin Jia

Publication date 18 October 2021

Full work available at URL https://doi.org/10.1007/978-3-030-67067-2_22

zbMATH Keywords

discrete-time Markov chainsprobabilistic model checkingstateful networks

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Network design and communication in computer systems (68M10) Theory of programming languages (68N15) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Probabilistic NetKAT
• Cantor meets Scott: semantic foundations for probabilistic networks
• Undecidable Problems for Probabilistic Network Programming
• Some complexity results for stateful network verification
• High-level modelling and efficient analysis of randomized protocols.

Cites work

• Cantor meets Scott: semantic foundations for probabilistic networks
• scientific article; zbMATH DE number 6905198 (Why is no real title available?)
• scientific article; zbMATH DE number 4179333 (Why is no real title available?)
• Netkat, semantic foundations for networks
• Netter: probabilistic, stateful network models
• Probabilistic NetKAT
• Probability and Computing

Cited in

(5)

• Netter: probabilistic, stateful network models
• Some complexity results for stateful network verification
• Probabilistic NetKAT
• Safe compositional network sketches: formal framework
• Cantor meets Scott: semantic foundations for probabilistic networks

This page was built for publication: Netter: probabilistic, stateful network models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234099)