The following pages link to Pict (Q20925):
Displaying 50 items.
- An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems (Q520240) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Fundamentals of session types (Q714736) (← links)
- Relating state-based and process-based concurrency through linear logic (full-version) (Q731895) (← links)
- Process algebras as support for sustainable systems of services (Q814902) (← links)
- A closer look at constraints as processes (Q844200) (← links)
- Creol: A type-safe object-oriented model for distributed concurrent systems (Q854164) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- A formal semantics for the Taverna 2 workflow model (Q980997) (← links)
- Pict correctness revisited (Q1004056) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- Process calculus based upon evaluation to committed form (Q1276241) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- Primitives for authentication in process algebras. (Q1603653) (← links)
- Application of a stochastic name-passing calculus to representation and simulation of molecular processes (Q1607114) (← links)
- A calculus for reasoning about software composition (Q1770365) (← links)
- An ``abstract process'' approach to algebraic dynamic architecture description (Q1779318) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- Mixed sessions (Q2055956) (← links)
- On distributability (Q2123059) (← links)
- Coupled similarity: the first 32 years (Q2182667) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- A type system for lock-free processes (Q2497143) (← links)
- Modelling dynamic web data (Q2566029) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- Subtyping for session types in the pi calculus (Q2576666) (← links)
- (Q2763378) (← links)
- (Q2767062) (← links)
- On the Relative Expressive Power of Calculi for Mobility (Q2805161) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- A Calculus of Global Interaction based on Session Types (Q2864218) (← links)
- Synchrony vs Asynchrony in Communication Primitives (Q2866346) (← links)
- A Coq Library for Verification of Concurrent Programs (Q2871836) (← links)
- A Formal Environment Model for Multi-Agent Systems (Q2999310) (← links)
- PiStache: Implementing π-Calculus in Scala (Q3098054) (← links)
- (Q3150203) (← links)
- (Q3413373) (← links)
- Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines (Q3458151) (← links)
- A Hybrid Type System for Lock-Freedom of Mobile Processes (Q3512484) (← links)
- Algebraic Pattern Matching in Join Calculus (Q3518273) (← links)
- The Orc Programming Language (Q3634722) (← links)
- (Q4219040) (← links)
- (Q4223012) (← links)
- (Q4223019) (← links)
- (Q4223023) (← links)
- (Q4248252) (← links)
- (Q4251118) (← links)
