The following pages link to Modal logics for mobile processes (Q685408):
Displaying 50 items.
- Modelling and analysing neural networks using a hybrid process algebra (Q264526) (← links)
- Bisimilar and logically equivalent programs in PDL (Q281144) (← links)
- A generic framework for \(n\)-protocol compatibility checking (Q433347) (← links)
- Model-checking process equivalences (Q477208) (← links)
- A randomized encoding of the \(\pi\)-calculus with mixed choice (Q555750) (← links)
- Models for name-passing processes: Interleaving and causal (Q598191) (← links)
- Symbolic bisimulations (Q674194) (← links)
- On process equivalence = equation solving in CCS (Q839034) (← links)
- Synthesising correct concurrent runtime monitors (Q888412) (← links)
- Observational structures and their logic (Q1190494) (← links)
- An algebraic verification of a mobile network (Q1205185) (← links)
- Partial confluence of processes and systems of objects (Q1274970) (← links)
- Non-interleaving semantics for mobile processes (Q1285660) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- A \(\pi\)-calculus with explicit substitutions (Q1350998) (← links)
- On the decidability of process equivalences for the \(\pi\)-calculus (Q1391099) (← links)
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. (Q1400579) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- \(\pi\)-calculus in (Co)inductive-type theory (Q1589654) (← links)
- Logics for bisimulation and divergence (Q1652984) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- The security pi-calculus and non-interference (Q1772311) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Language-based performance prediction for distributed and mobile systems (Q1854534) (← links)
- A spatial logic for concurrency. I (Q1887152) (← links)
- A modal logic for message passing processes (Q1894680) (← links)
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus (Q1941882) (← links)
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations (Q2182663) (← links)
- Mechanized metatheory revisited (Q2323447) (← links)
- Bisimilar and logically equivalent programs in PDL with parallel operator (Q2358700) (← links)
- A stable non-interleaving early operational semantics for the pi-calculus (Q2423752) (← links)
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda (Q2683037) (← links)
- Encoding generic judgments: preliminary results (Q2841234) (← links)
- Modal logics for cryptographic processes (Q2842609) (← links)
- Co-algebraic models for quantitative spatial logics (Q2870283) (← links)
- A name abstraction functor for named sets (Q2873662) (← links)
- A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus (Q3185762) (← links)
- A Logic for Distributed Higher Order π-Calculus (Q3502660) (← links)
- Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes (Q3582736) (← links)
- A Complete Axiomatic System for a Process-Based Spatial Logic (Q3599152) (← links)
- Decidable Extensions of Hennessy-Milner Logic (Q3613068) (← links)
- (Q4222877) (← links)
- A filter model for mobile processes (Q4237908) (← links)
- On confluence in the π-calculus (Q4571963) (← links)
- Causality for mobile processes (Q4645219) (← links)
- (Q4732449) (← links)
- Modal Logic and Equality for Process Algebra (Q4870069) (← links)
- (Q5009710) (← links)
