scientific article; zbMATH DE number 7204926
From MaRDI portal
Publication:5111621
DOI10.4230/LIPIcs.CONCUR.2017.9zbMath1442.03015MaRDI QIDQ5111621
Publication date: 27 May 2020
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
- \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
- 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
- An automata-theoretic approach to branching-time model checking
- Possible Winners in Partially Completed Tournaments
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
