The following pages link to CONCUR 2011 – Concurrency Theory (Q3090816):
Displayed 36 items.
- Carrying Probabilities to the Infinite World (Q3090817) (← links)
- Generalized Universality (Q3090818) (← links)
- Causal Nets: A Modeling Language Tailored towards Process Discovery (Q3090820) (← links)
- On Causal Semantics of Petri Nets (Q3090821) (← links)
- On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing (Q3090822) (← links)
- Timed Automata Can Always Be Made Implementable (Q3090823) (← links)
- Coarse Abstractions Make Zeno Behaviours Difficult to Detect (Q3090824) (← links)
- Bisimulations Meet PCTL Equivalences for Probabilistic Automata (Q3090825) (← links)
- A Spectrum of Behavioral Relations over LTSs on Probability Distributions (Q3090826) (← links)
- Fixed-Delay Events in Generalized Semi-Markov Processes Revisited (Q3090827) (← links)
- Semantic Analysis of Gossip Protocols for Wireless Sensor Networks (Q3090828) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Advanced Ramsey-Based Büchi Automata Inclusion Testing (Q3090830) (← links)
- Reachability of Multistack Pushdown Systems with Scope-Bounded Matching Relations (Q3090831) (← links)
- Granularity and Concurrent Separation Logic (Q3090832) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- On Locality and the Exchange Law for Concurrent Processes (Q3090834) (← links)
- Typed ψ-calculi (Q3090835) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- Controlling Reversibility in Higher-Order Pi (Q3090837) (← links)
- A Connector Algebra for P/T Nets Interactions (Q3090838) (← links)
- Vector Addition System Reversible Reachability Problem (Q3090839) (← links)
- Efficient Contextual Unfolding (Q3090840) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- The Decidability of the Reachability Problem for CCS! (Q3090842) (← links)
- Static Livelock Analysis in CSP (Q3090843) (← links)
- Dynamic Reactive Modules (Q3090845) (← links)
- Weak Kripke Structures and LTL (Q3090846) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Reasoning about Threads with Bounded Lock Chains (Q3090848) (← links)
- A Temporal Logic for the Interaction of Strategies (Q3090849) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- A Compositional Framework for Controller Synthesis (Q3090853) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems (Q5894255) (← links)