The following pages link to CONCUR 2009 - Concurrency Theory (Q3184660):
Displaying 41 items.
- Perspectives on Transactional Memory (Q3184661) (← links)
- The Effect of Tossing Coins in Omega-Automata (Q3184662) (← links)
- Bigraphical Categories (Q3184663) (← links)
- BlenX Static and Dynamic Semantics (Q3184664) (← links)
- Flow Policy Awareness for Distributed Mobile Code (Q3184665) (← links)
- Volume and Entropy of Regular Timed Languages: Discretization Approach (Q3184666) (← links)
- A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types (Q3184667) (← links)
- Encoding Asynchronous Interactions Using Open Petri Nets (Q3184668) (← links)
- Distributed Asynchronous Automata (Q3184669) (← links)
- Algebra for Infinite Forests with an Application to the Temporal Logic EF (Q3184670) (← links)
- Deriving Syntax and Axioms for Quantitative Regular Behaviours (Q3184671) (← links)
- Weighted Bisimulation in Linear Algebraic Form (Q3184672) (← links)
- A Logic-Based Framework for Reasoning about Composite Data Structures (Q3184673) (← links)
- Measuring Permissivity in Finite Games (Q3184674) (← links)
- Contracts for Mobile Processes (Q3184675) (← links)
- Probabilistic Weighted Automata (Q3184677) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- Testing Finitary Probabilistic Processes (Q3184679) (← links)
- A Demonic Approach to Information in Probabilistic Systems (Q3184680) (← links)
- HYPE: A Process Algebra for Compositional Flows and Emergent Behaviour (Q3184681) (← links)
- Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs (Q3184683) (← links)
- Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers (Q3184684) (← links)
- Model-Checking Games for Fixpoint Logics with Partial Order Models (Q3184685) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Winning Regions of Pushdown Parity Games: A Saturation Method (Q3184687) (← links)
- Concurrent Kleene Algebra (Q3184688) (← links)
- Concavely-Priced Probabilistic Timed Automata (Q3184689) (← links)
- Compositional Control Synthesis for Partially Observable Systems (Q3184691) (← links)
- Howe’s Method for Calculi with Passivation (Q3184692) (← links)
- On the Relationship between π-Calculus and Finite Place/Transition Petri Nets (Q3184693) (← links)
- Modeling Radio Networks (Q3184694) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- Secure Enforcement for Global Process Specifications (Q3184696) (← links)
- On Convergence of Concurrent Systems under Regular Interactions (Q3184697) (← links)
- Computing Stuttering Simulations (Q3184698) (← links)
- Weak Time Petri Nets Strike Back! (Q3184699) (← links)
- A General Testability Theory (Q3184700) (← links)
- Counterexamples in Probabilistic LTL Model Checking for Markov Chains (Q3184702) (← links)
- Query-Based Model Checking of Ad Hoc Network Protocols (Q3184703) (← links)
- Strict Divergence for Probabilistic Timed Automata (Q3184704) (← links)
- Power of Randomization in Automata on Infinite Strings (Q5895118) (← links)
