The following pages link to CONCUR 2005 – Concurrency Theory (Q5897497):
Displayed 27 items.
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Reversible session-based pi-calculus (Q492908) (← links)
- Causal-consistent rollback in a tuple-based language (Q516034) (← links)
- Reversibility and asymmetric conflict in event structures (Q890616) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- A theory of reversibility for Erlang (Q1785852) (← links)
- An axiomatic approach to reversible computation (Q2200840) (← links)
- Specifying reversibility with \(\mathrm{TLA}^+\) (Q2210867) (← links)
- A parametric framework for reversible \(\pi\)-calculi (Q2216133) (← links)
- A control flow analysis for Beta-binders with and without static compartments (Q2271446) (← links)
- Reversibility in session-based concurrency: a fresh look (Q2360649) (← links)
- Verifying chemical reaction network implementations: a pathway decomposition approach (Q2422010) (← links)
- Reversing algebraic process calculi (Q2643334) (← links)
- Self-assembling Trees (Q2866313) (← links)
- General Reversibility (Q2866345) (← links)
- A Static Analysis for Beta-Binders (Q2870298) (← links)
- Controlling Reversibility in Higher-Order Pi (Q3090837) (← links)
- Static VS Dynamic Reversibility in CCS (Q3186583) (← links)
- Reversing Single Sessions (Q3186584) (← links)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- (Q5129948) (← links)
- Control Flow Analysis for Brane Calculi (Q5179425) (← links)
- Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications (Q5237227) (← links)
- Operational Semantics of Reversibility in Process Algebra (Q5262973) (← links)
- Control Flow Analysis of Generalised Boolean Networks (Q5404092) (← links)
- An Observational Model for Transactional Calculus of Services Orchestration (Q5505603) (← links)