The following pages link to CONCUR 2014 – Concurrency Theory (Q3190104):
Displaying 38 items.
- The Benefits of Sometimes Not Being Discrete (Q3190105) (← links)
- Deterministic Negotiations: Concurrency for Free (Q3190106) (← links)
- Generalized Bisimulation Metrics (Q3190107) (← links)
- Choreographies, Logically (Q3190108) (← links)
- Deadlock Analysis of Unbounded Process Networks (Q3190109) (← links)
- Trees from Functions as Processes (Q3190110) (← links)
- Bisimulations Up-to: Beyond First-Order Transition Systems (Q3190111) (← links)
- Parameterized Model Checking of Rendezvous Systems (Q3190112) (← links)
- On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability (Q3190113) (← links)
- Lost in Abstraction: Monotonicity in Multi-threaded Programs (Q3190114) (← links)
- Synthesis from Component Libraries with Costs (Q3190115) (← links)
- Compositional Controller Synthesis for Stochastic Games (Q3190116) (← links)
- Synchronizing Strategies under Partial Observability (Q3190117) (← links)
- Probabilistic Robust Timed Games (Q3190118) (← links)
- Perturbation Analysis in Verification of Discrete-Time Markov Chains (Q3190120) (← links)
- Robust Synchronization in Markov Decision Processes (Q3190121) (← links)
- Probabilistic Bisimulation: Naturally on Distributions (Q3190122) (← links)
- Averaging in LTL (Q3190123) (← links)
- Decidable Topologies for Communicating Automata with FIFO and Bag Channels (Q3190124) (← links)
- Controllers for the Verification of Communicating Multi-pushdown Systems (Q3190125) (← links)
- Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking (Q3190126) (← links)
- A Linear-Time Algorithm for the Orbit Problem over Cyclic Groups (Q3190127) (← links)
- A Nearly Optimal Upper Bound for the Self-Stabilization Time in Herman’s Algorithm (Q3190128) (← links)
- Bounds on Mobility (Q3190129) (← links)
- Typing Messages for Free in Security Protocols: The Case of Equivalence Properties (Q3190130) (← links)
- Using Higher-Order Contracts to Model Session Types (Extended Abstract) (Q3190131) (← links)
- A Semantic Deconstruction of Session Types (Q3190132) (← links)
- Timed Multiparty Session Types (Q3190133) (← links)
- A Categorical Semantics of Signal Flow Graphs (Q3190134) (← links)
- Generic Forward and Backward Simulations III: Quantitative Simulations by Matrices (Q3190135) (← links)
- A General Framework for Well-Structured Graph Transformation Systems (Q3190136) (← links)
- (Un)decidable Problems about Reachability of Quantum Systems (Q3190137) (← links)
- Ordered Navigation on Multi-attributed Data Words (Q3190138) (← links)
- Verification for Timed Automata Extended with Unbounded Discrete Data Structures (Q3190139) (← links)
- Reducing Clocks in Timed Automata while Preserving Bisimulation (Q3190141) (← links)
- Qualitative Concurrent Parity Games: Bounded Rationality (Q3190142) (← links)
- Adding Negative Prices to Priced Timed Games (Q3190143) (← links)
- Tight Game Abstractions of Probabilistic Automata (Q3190145) (← links)
