The following pages link to CONCUR 2006 – Concurrency Theory (Q5756587):
Displayed 34 items.
- Probability and Nondeterminism in Operational Models of Concurrency (Q5756588) (← links)
- Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words (Q5756590) (← links)
- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems (Q5756591) (← links)
- On Interleaving in Timed Automata (Q5756592) (← links)
- On Finite Alphabets and Infinite Bases III: Simulation (Q5756593) (← links)
- Weak Bisimulation Up to Elaboration (Q5756594) (← links)
- Reachability in Recursive Markov Decision Processes (Q5756595) (← links)
- A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification (Q5756596) (← links)
- Proving Liveness by Backwards Reachability (Q5756597) (← links)
- Event Structure Semantics for Nominal Calculi (Q5756598) (← links)
- Concurrent Rewriting for Graphs with Equivalences (Q5756599) (← links)
- Sortings for Reactive Systems (Q5756600) (← links)
- A Capability Calculus for Concurrency and Determinism (Q5756601) (← links)
- Operational Determinism and Fast Algorithms (Q5756602) (← links)
- A Complete Axiomatic Semantics for the CSP Stable-Failures Model (Q5756603) (← links)
- Model Checking Quantified Computation Tree Logic (Q5756604) (← links)
- Modeling Timed Concurrent Systems (Q5756605) (← links)
- Liveness, Fairness and Impossible Futures (Q5756606) (← links)
- Some Remarks on Definability of Process Graphs (Q5756607) (← links)
- Second-Order Simple Grammars (Q5756608) (← links)
- A Language for Task Orchestration and Its Semantic Properties (Q5756609) (← links)
- Controller Synthesis for MTL Specifications (Q5756610) (← links)
- Inference of Event-Recording Automata Using Timed Decision Trees (Q5756611) (← links)
- Generic Forward and Backward Simulations (Q5756612) (← links)
- Strategy Improvement for Stochastic Rabin and Streett Games (Q5756613) (← links)
- Sanity Checks in Formal Verification (Q5756614) (← links)
- Probabilistic I/O Automata: Theories of Two Equivalences (Q5756615) (← links)
- Encoding ℂDuce in the ℂπ-Calculus (Q5756616) (← links)
- Dynamic Access Control in a Concurrent Object Calculus (Q5756617) (← links)
- A New Type System for Deadlock-Free Processes (Q5756618) (← links)
- Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi (Q5756619) (← links)
- Minimization, Learning, and Conformance Testing of Boolean Programs (Q5756620) (← links)
- Transition Systems of Elementary Net Systems with Localities (Q5756621) (← links)
- Checking a Mutex Algorithm in a Process Algebra with Fairness (Q5756622) (← links)