The following pages link to CONCUR 2004 - Concurrency Theory (Q5311480):
Displayed 50 items.
- Reversibility in the higher-order \(\pi\)-calculus (Q264996) (← links)
- Reversible client/server interactions (Q315298) (← links)
- Contextual equivalences in configuration structures and reversibility (Q347363) (← links)
- Reversible session-based pi-calculus (Q492908) (← links)
- Emergence of universal global behavior from reversible local transitions in asynchronous systems (Q507745) (← links)
- Causal-consistent rollback in a tuple-based language (Q516034) (← links)
- On the hierarchy of d-structures (Q523153) (← links)
- Reversibility and asymmetric conflict in event structures (Q890616) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- A theory of reversibility for Erlang (Q1785852) (← links)
- Mutual exclusion and reversibility in reaction systems (Q1982970) (← links)
- Simulating reversible computation with reaction systems (Q1982972) (← links)
- Reversible computation in nature inspired rule-based systems (Q1982978) (← links)
- Static versus dynamic reversibility in CCS (Q2022303) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Concurrencies in reversible concurrent calculi (Q2097423) (← links)
- Reversibility in Erlang: imperative constructs (Q2097430) (← links)
- Towards causal-consistent reversibility of imperative concurrent programs (Q2097433) (← links)
- From reversible programs to univalent universes and back (Q2130579) (← links)
- Modelling of DNA mismatch repair with a reversible process calculus (Q2148904) (← links)
- Controlled reversibility in communicating reaction systems (Q2152435) (← links)
- The reversible temporal process language (Q2165209) (← 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)
- Reversible sessions with flexible choices (Q2329306) (← links)
- Relational presheaves, change of base and weak simulation (Q2341703) (← links)
- Reversibility in session-based concurrency: a fresh look (Q2360649) (← links)
- Towards a categorical representation of reversible event structures (Q2423742) (← links)
- Reversing algebraic process calculi (Q2643334) (← links)
- Reversible computation in nets with bonds (Q2667186) (← links)
- A collective interpretation semantics for reversing Petri nets (Q2672648) (← links)
- Towards Modelling of Local Reversibility (Q2822522) (← links)
- Self-assembling Trees (Q2866313) (← links)
- General Reversibility (Q2866345) (← links)
- Reversibility and Models for Concurrency (Q2871832) (← links)
- Quantitative Analysis of Concurrent Reversible Computations (Q2945596) (← links)
- Controlling Reversibility in Higher-Order Pi (Q3090837) (← links)
- Rigid Families for the Reversible $$\pi $$ -Calculus (Q3186581) (← links)
- A Calculus for Local Reversibility (Q3186582) (← links)
- Static VS Dynamic Reversibility in CCS (Q3186583) (← links)
- Reversing Single Sessions (Q3186584) (← links)
- Reversible Computation vs. Reversibility in Petri Nets (Q3186587) (← links)
- (Q3384916) (← links)
- (Q3384917) (← links)
- Event-Based Service Coordination (Q3507372) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Applying Reversibility Theory for the Performance Evaluation of Reversible Computations (Q4571082) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs (Q4989177) (← links)