Flow logic

MaRDI QIDQ4972740zbMATH OpenFDO

Authors Orna Kupferman, Gal Vardi

Publication date 26 November 2019

Full work available at URL https://arxiv.org/abs/1806.05956

zbMATH Keywords

flow networktemporal logic

Mathematics Subject Classification ID

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

Recommendations

• Flow logic
• Model checking \textit{is} static analysis of modal logic
• Hybrid Systems: Computation and Control
• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Flow logic for process calculi

Cites work

• \textit{Once} and \textit{for all}
• A new approach to the maximum-flow problem
• A really temporal logic
• A strongly polynomial minimum cost circulation algorithm
• Alternating-time temporal logic
• Bounded queries to SAT and the Boolean hierarchy
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Computer Science Logic
• Finding State Solutions to Temporal Logic Queries
• Handbook of model checking
• scientific article; zbMATH DE number 1670794 (Why is no real title available?)
• 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 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 3349645 (Why is no real title available?)
• 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

Cited in

(9)

• \textsc{AdamMC}: a model checker for Petri nets with transits against Flow-LTL
• Effect-driven flow analysis
• Heuristics for safety and security constraints
• Safe compositional network sketches: formal framework
• Model checking \textit{is} static analysis of modal logic
• Incremental flow
• Flow logic
• Perspective games
• Executable first-order queries in the logic of information flows

Describes a project that uses

Uses Software

• CESAR
• VeriFlow

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 Q4972740)