The following pages link to CONCUR 2007 – Concurrency Theory (Q3525625):
Displaying 32 items.
- The Saga of the Axiomatization of Parallel Composition (Q3525626) (← links)
- Rule-Based Modelling of Cellular Signalling (Q3525627) (← links)
- Making Random Choices Invisible to the Scheduler (Q3525628) (← links)
- Strategy Logic (Q3525629) (← links)
- Solving Games Via Three-Valued Abstraction Refinement (Q3525630) (← links)
- Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness (Q3525631) (← links)
- On Modal Refinement and Consistency (Q3525632) (← links)
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems (Q3525633) (← links)
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage (Q3525634) (← links)
- A Nice Labelling for Tree-Like Event Structures of Degree 3 (Q3525635) (← links)
- Causal Message Sequence Charts (Q3525636) (← links)
- Checking Coverage for Infinite Collections of Timed Scenarios (Q3525637) (← links)
- Is Observational Congruence Axiomatisable in Equational Horn Logic? (Q3525638) (← links)
- The Must Preorder Revisited (Q3525639) (← links)
- Topology-Dependent Abstractions of Broadcast Networks (Q3525640) (← links)
- On the Expressive Power of Global and Local Priority in Process Calculi (Q3525641) (← links)
- A Marriage of Rely/Guarantee and Separation Logic (Q3525642) (← links)
- Fair Cooperative Multithreading (Q3525643) (← links)
- Precise Fixpoint-Based Analysis of Programs with Thread-Creation and Procedures (Q3525644) (← links)
- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning (Q3525645) (← links)
- Compositional Event Structure Semantics for the Internal π-Calculus (Q3525646) (← links)
- Interpreting a Finitary Pi-calculus in Differential Interaction Nets (Q3525647) (← links)
- Mobility Control Via Passports (Q3525648) (← links)
- Coalgebraic Models for Reactive Systems (Q3525649) (← links)
- Reactive Systems over Directed Bigraphs (Q3525650) (← links)
- Asynchronous Games: Innocence Without Alternation (Q3525651) (← links)
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes (Q3525652) (← links)
- Strategy Synthesis for Markov Decision Processes and Branching-Time Logics (Q3525653) (← links)
- Timed Concurrent Game Structures (Q3525654) (← links)
- Pushdown Module Checking with Imperfect Information (Q3525655) (← links)
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages (Q3525656) (← links)
- Temporal Antecedent Failure: Refining Vacuity (Q3525657) (← links)
