scientific article; zbMATH DE number 7136668
From MaRDI portal
Publication:4972740
zbMath1442.03014arXiv1806.05956MaRDI QIDQ4972740
Publication date: 26 November 2019
Full work available at URL: https://arxiv.org/abs/1806.05956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Flows in graphs (05C21)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textit{Once} and \textit{for all}
- A strongly polynomial minimum cost circulation algorithm
- Bounded queries to SAT and the Boolean hierarchy
- Modalities for model checking: Branching time logic strikes back
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Some complexity results for stateful network verification
- Maximal Flow Through a Network
- Properties and Utilization of Capacitated Automata (Invited Talk)
- Alternating-time temporal logic
- Knowledge and common knowledge in a distributed environment
- Strategy Logic
- Rational Synthesis
- Finding State Solutions to Temporal Logic Queries
- The complexity of propositional linear temporal logics
- A new approach to the maximum-flow problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- A really temporal logic
- Handbook of Model Checking
- Computer Science Logic
- Possible Winners in Partially Completed Tournaments
This page was built for publication:
