Undecidable Problems for Probabilistic Network Programming

DOI10.4230/LIPICS.MFCS.2017.68zbMATH Open1441.68019OpenAlexW2759421792MaRDI QIDQ5111285FDOQ5111285

David M. Kahn

Publication date: 26 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#Kahn17

Recommendations

• Probabilistic NetKAT
• Cantor meets Scott: semantic foundations for probabilistic networks
• scientific article
• A coalgebraic decision procedure for NetKAT
• Netkat, semantic foundations for networks

zbMATH Keywords

software-defined networkingundecidabilityprobabilistic finite automataNetKATProbNetKAT

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• NetKAT — A Formal System for the Verification of Networks
• NetKAT
• Cantor meets Scott: semantic foundations for probabilistic networks
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• Undecidable problems for probabilistic automata of fixed dimension
• Title not available (Why is that?)
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• On the Complexity of the Equivalence Problem for Probabilistic Automata
• On the Computation of Some Standard Distances Between Probabilistic Automata
• A coalgebraic decision procedure for NetKAT
• Probabilistic NetKAT

Cited In (1)

• Undecidability in decentralized supervision

Uses Software

• NetKAT
• ProbNetKAT

This page was built for publication: Undecidable Problems for Probabilistic Network Programming

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