The following pages link to A calculus of mobile processes. I (Q1198548):
Displaying 50 items.
- Network Conscious π-calculus: A Concurrent Semantics (Q3178290) (← links)
- On the Expressiveness of Symmetric Communication (Q3179397) (← links)
- A Demonic Approach to Information in Probabilistic Systems (Q3184680) (← links)
- Reversing Single Sessions (Q3186584) (← links)
- PhyChip: Growing Computers with Slime Mould (Q3295747) (← links)
- Describing Service-Oriented Architecture by extended Darwin (Q3378857) (← links)
- (Q3385647) (← links)
- MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI (Q3444848) (← links)
- A Logical Encoding of Timed $$\pi $$-Calculus (Q3453652) (← links)
- Static Evidences for Attack Reconstruction (Q3460869) (← links)
- On Beta-Binders Communications (Q3507381) (← links)
- A Category of Explicit Fusions (Q3507388) (← links)
- Ugo Montanari and Software Verification (Q3507392) (← links)
- Implementing Spi Calculus Using Nominal Techniques (Q3507444) (← links)
- On Recursion, Replication and Scope Mechanisms in Process Calculi (Q3525112) (← links)
- Bounded polymorphism in session types (Q3535678) (← links)
- Network Applications of Graph Bisimulation (Q3540393) (← links)
- A Spatial Equational Logic for the Applied π-Calculus (Q3541032) (← links)
- A Ticking Clock: Performance Analysis of a Circadian Rhythm with Stochastic Process Algebra (Q3543308) (← links)
- From Gene Regulation to Stochastic Fusion (Q3543333) (← links)
- Channel abstractions for network security (Q3550700) (← links)
- Turing universality of the Biochemical Ground Form (Q3550701) (← links)
- Security Types for Dynamic Web Data (Q3608462) (← links)
- A Look Around the Corner: The Pi-Calculus (Q3623819) (← links)
- Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication (Q3636840) (← links)
- Hornets: Nets within Nets Combined with Net Algebra (Q3636848) (← links)
- On the expressive power of process interruption and compensation (Q3636911) (← links)
- Differential Linear Logic and Polarization (Q3637207) (← links)
- An expressiveness study of priority in process calculi (Q3655761) (← links)
- On the expressive power of recursion, replication and iteration in process calculi (Q3655762) (← links)
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763) (← links)
- Mobile Petri nets (Q3655764) (← links)
- The name discipline of uniform receptiveness (extended abstract) (Q4571962) (← links)
- On confluence in the π-calculus (Q4571963) (← links)
- A proof theoretical approach to communication (Q4571964) (← links)
- Distributed processes and location failures (Q4571978) (← links)
- A programming model and foundation for lineage-based distributed computation (Q4577814) (← links)
- Abstract interpretation of temporal concurrent constraint programs (Q4592982) (← links)
- The consistent use of names and polymorphism in the definition of Object Petri Nets (Q4633175) (← links)
- Proof-relevant π-calculus: a constructive account of concurrency and causality (Q4691184) (← links)
- Strong types for coordinating active objects (Q4790922) (← links)
- Model checking with probabilistic tabled logic programming (Q4911143) (← links)
- A Graph Transformation View on the Specification of Applications using Mobile Code* *Research partially supported by project ForMOS (Métodos Formais para Código Móvelem Sistemas Abertos) - grant CNPq 520269/98-5, by the Research Training Network GET-GR (Q4921551) (← links)
- Encryption as an abstract data-type (Q4924525) (← links)
- On parameterization of higher-order processes (Q4976336) (← links)
- (Q5009452) (← links)
- (Q5013869) (← links)
- (Q5013871) (← links)
- (Q5018488) (← links)
- (Q5020947) (← links)
