The following pages link to (Q4248252):
Displaying 50 items.
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
- A perspective on service orchestration (Q2389337) (← links)
- A static analysis for brane calculi providing global occurrence counting information (Q2405890) (← links)
- Reduction semantics in Markovian process algebra (Q2413025) (← links)
- A general overview of formal languages for individual-based modelling of ecosystems (Q2423746) (← links)
- A stable non-interleaving early operational semantics for the pi-calculus (Q2423752) (← links)
- A reduction semantics for direct-style asynchronous observables (Q2423763) (← links)
- Communicating by compatibility (Q2426519) (← links)
- Expressiveness of propositional projection temporal logic with star (Q2430015) (← links)
- Exception handling for copyless messaging (Q2441510) (← links)
- A logic of behaviour in context (Q2453209) (← links)
- Self-assembling graphs (Q2461296) (← links)
- Tutorial on separation results in process calculi via leader election problems (Q2464946) (← links)
- Behavioural equivalences for dynamic web data (Q2474049) (← links)
- CCS with priority guards (Q2474050) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Free-algebra models for the \(\pi \)-calculus (Q2474057) (← links)
- On process rate semantics (Q2474433) (← links)
- Symmetric electoral systems for ambient calculi (Q2475806) (← links)
- Pure bigraphs: structure and dynamics (Q2490119) (← links)
- A CPS encoding of name-passing in higher-order mobile embedded resources (Q2491640) (← links)
- Leader election in rings of ambient processes (Q2491642) (← links)
- A type system for lock-free processes (Q2497143) (← links)
- Types for the ambient calculus (Q2497144) (← links)
- Ensuring termination by typability (Q2500473) (← links)
- Explicit fusions (Q2566040) (← links)
- \(\pi\)-calculus with noisy channels (Q2570971) (← links)
- Communication and mobility control in boxed ambients (Q2573334) (← links)
- On an open problem of Amadio and Curien: The finite antichain condition (Q2573335) (← links)
- Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
- Dynamic input/output automata: a formal and compositional model for dynamic systems (Q2629850) (← links)
- Formal verification of temporal properties for reduced overhead in grid scientific workflows (Q2637258) (← links)
- Formal verification technique for grid service chain model and its application (Q2644410) (← links)
- CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi (Q2703692) (← links)
- The \(\pi\)-calculus: A theory of mobile processes (Q2734510) (← links)
- The \(\pi\)-calculus: An introduction (Q2767985) (← links)
- On Hierarchical Communication Topologies in the $$\pi $$ -calculus (Q2802475) (← links)
- Equational Reasoning About Quantum Protocols (Q2822505) (← links)
- A Gentle Introduction to Multiparty Asynchronous Session Types (Q2822666) (← links)
- A first-order syntax for the \(\pi\)-calculus in Isabelle/HOL using permutations (Q2841231) (← links)
- Defining actions in concurrent declarative programming (Q2841291) (← links)
- Modal logics for cryptographic processes (Q2842609) (← links)
- Safety versus Security in the Quality Calculus (Q2842642) (← links)
- The myth of `the myth of hypercomputation' (Q2842654) (← links)
- Deciding framed bisimilarity (Q2842870) (← links)
- Semantic domains for Handel-C (Q2843615) (← links)
- Relationally staged computations in calculi of mobile processes (Q2847810) (← links)
- Manipulating trees with hidden labels (Q2864150) (← links)
- Systems modelling via resources and processes: philosophy, calculus, semantics, and logic (Q2864163) (← links)
