Flow logic
From MaRDI portal
Publication:5111621
DOI10.4230/LIPICS.CONCUR.2017.9zbMATH Open1442.03015MaRDI QIDQ5111621FDOQ5111621
Authors: Orna Kupferman, Gal Vardi 
Publication date: 27 May 2020
Recommendations
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)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Alternating-time temporal logic
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- The complexity of propositional linear temporal logics
- A really temporal logic
- Title not available (Why is that?)
- A new approach to the maximum-flow problem
- On the Complexity of Timetable and Multicommodity Flow Problems
- Title not available (Why is that?)
- A strongly polynomial minimum cost circulation algorithm
- Knowledge and common knowledge in a distributed environment
- An automata-theoretic approach to branching-time model checking
- Bounded queries to SAT and the Boolean hierarchy
- Strategy Logic
- Rational synthesis
- Title not available (Why is that?)
- Modalities for model checking: Branching time logic strikes back
- \textit{Once} and \textit{for all}
- Title not available (Why is that?)
- Possible Winners in Partially Completed Tournaments
- Handbook of model checking
- Title not available (Why is that?)
- Some complexity results for stateful network verification
- Properties and utilization of capacitated automata (invited talk)
Cited In (3)
Uses Software
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)
