Flow logic

DOI10.4230/LIPICS.CONCUR.2017.9MaRDI QIDQ5111621zbMATH OpenFDO

Authors Orna Kupferman, Gal Vardi

Publication date 27 May 2020

zbMATH Keywords

temporal logicflow network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Flows in graphs (05C21) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70)

Recommendations

• Flow logic
• Flow games
• Model checking \textit{is} static analysis of modal logic
• scientific article; zbMATH DE number 4041594
• Hybrid Systems: Computation and Control

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3930351 (Why is no real title available?)
• scientific article; zbMATH DE number 3757688 (Why is no real title available?)
• scientific article; zbMATH DE number 7088727 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• A new approach to the maximum-flow problem
• A really temporal logic
• A strongly polynomial minimum cost circulation algorithm
• Alternating-time temporal logic
• An automata-theoretic approach to branching-time model checking
• Bounded queries to SAT and the Boolean hierarchy
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Handbook of model checking
• Knowledge and common knowledge in a distributed environment
• Maximal Flow Through a Network
• Modalities for model checking: Branching time logic strikes back
• Network flows. Theory, algorithms, and applications.
• On the Complexity of Timetable and Multicommodity Flow Problems
• Possible Winners in Partially Completed Tournaments
• Properties and utilization of capacitated automata (invited talk)
• Rational synthesis
• Some complexity results for stateful network verification
• Strategy Logic
• The complexity of propositional linear temporal logics
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• \textit{Once} and \textit{for all}

Cited in

(3)

• Incremental flow
• Effect-driven flow analysis
• Flow logic

Describes a project that uses

Uses Software

• VeriFlow
• CESAR

This page was built for publication: Flow logic

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