REVIEW 8 cited by
Reducing urban traffic congestion due to localized routing decisions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Balancing traffic flow by influencing drivers' route choices to alleviate congestion is becoming increasingly more appealing in urban traffic planning. Here, we introduce a discrete dynamical model comprising users who make their own routing choices on the basis of local information and those who consider routing advice based on localized inducement. We identify the formation of traffic patterns, develop a scalable optimization method for identifying control values used for user guidance, and test the effectiveness of these measures on synthetic and real-world road networks.
Forward citations
Cited by 8 Pith papers
-
First Steps Towards Probabilistic Iris: Harmonizing Independence, Conditioning, and Dynamic Heap Allocation
Amaryllis is the first general-purpose probabilistic separation logic to support independence, conditioning, and dynamic heap allocation, with a machine-checked soundness proof in Rocq.
-
Oblivious Probabilistic Outcome Logic: Verifying Probabilistic Programs with an Oblivious Adversary
opOL is a Hoare-style logic with priv/leak outcome assertions and a Frame rule that stays sound under oblivious adversaries by treating adversarial schedule consumption as a separation-logic resource.
-
Verifying Isolation Levels of Database Implementations for Free Using Separation Logic
From separation-logic specifications for database operations, the authors derive, without extra assumptions, that any verified implementation correctly implements its weak isolation level.
-
Agent-Alternation-Free Epistemic Metric Temporal Logic with Past: Model Checking and Complexity
Model checking the agent-alternation-free fragment of epistemic metric temporal logic with past is EXPSPACE-complete, with hardness already at one agent, one knowledge operator, and only the unbounded interval.
-
Logical relations for call-by-push-value models, via internal fibrations in a 2-category
A 2-categorical fibrational framework gives a uniform notion of logical relations for CBPV models, with a pullback theorem that constructs new relational models from old ones.
-
Unfolding Iterators: Specification and Verification of Higher-Order Iterators, in OCaml
A translation-based methodology lets Gospel specs of higher-order OCaml iterators be verified automatically by converting them to first-order cursor loops in WhyML.
-
Increasing the Expressiveness of a Gradual Verifier
Gradual C0's specification language gains unfolding expressions through a modified symbolic-execution rule that retains optimistic heap chunks when predicate bodies are precise.
-
Formalization of security
A survey chapter maps proof-assistant applications across system security, language-based security, secure compilation, and cryptography, without new theorems.
Discussion (0). Continue with ORCID to comment.