Modal logics for mobile processes
From MaRDI portal
Recommendations
- A modal logic for mobile agents
- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
- CONCUR 2004 - Concurrency Theory
- A predicate spatial logic for mobile process
- A modal logic for message passing processes
- Modal Logic, Transition Systems and Processes
- Formal Methods for Components and Objects
- Anytime, anywhere: modal logics for mobile ambients
Cites work
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 48630 (Why is no real title available?)
- A calculus of communicating systems
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Algebraic laws for nondeterminism and concurrency
- On the termination of program schemas
Cited in
(69)- Comparing the expressiveness of the \(\pi \)-calculus and CCS
- When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus
- Multiple-Labelled Transition Systems for nominal calculi and their logics
- A Complete Axiomatic System for a Process-Based Spatial Logic
- A logical characterisation of static equivalence
- Explicit substitutions for \(\pi\)-congruences
- Model-checking process equivalences
- Symbolic bisimulations
- Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
- scientific article; zbMATH DE number 1231561 (Why is no real title available?)
- Bisimulation and logic
- On the decidability of process equivalences for the \(\pi\)-calculus
- Co-algebraic models for quantitative spatial logics
- Decidable Extensions of Hennessy-Milner Logic
- A name abstraction functor for named sets
- Partial confluence of processes and systems of objects
- Names of the \(\pi\)-calculus agents handled locally
- On sequential composition, action prefixes and process prefix
- Confluence of processes and systems of objects
- Static analysis for the \(\pi\)-calculus with applications to security
- Synthesising correct concurrent runtime monitors
- Language-based performance prediction for distributed and mobile systems
- A propositional dynamic logic for concurrent programs based on the \(\pi\)-calculus
- Formal semantics of a dynamic epistemic logic for describing knowledge properties of \(\pi \)-calculus processes
- A randomized encoding of the \(\pi\)-calculus with mixed choice
- Bisimilar and logically equivalent programs in PDL
- An algebraic verification of a mobile network
- Causality for mobile processes
- On confluence in the \(\pi\)-calculus
- Models for name-passing processes: Interleaving and causal
- Congruence from the operator's point of view. Syntactic requirements on modal characterizations
- Modal logics for cryptographic processes
- Logics for bisimulation and divergence
- A modal logic for message passing processes
- A proof theoretic approach to operational semantics
- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
- A \(\pi \)-calculus with explicit substitutions: the late semantics
- Barbed bisimulation
- A \(\pi\)-calculus with explicit substitutions
- Modal logics for nominal transition systems
- A Logic for Distributed Higher Order π-Calculus
- A filter model for mobile processes
- \(\pi\)-calculus in (Co)inductive-type theory
- scientific article; zbMATH DE number 4118343 (Why is no real title available?)
- Coalgebraic modal logic beyond sets
- Algebra and Coalgebra in Computer Science
- A spatial logic for concurrency. I
- A generic framework for \(n\)-protocol compatibility checking
- A characterisation of open bisimilarity using an intuitionistic modal logic
- Event structures for the reversible early internal \(\pi\)-calculus
- Reasoning about higher-order processes
- Mechanized metatheory revisited
- Bisimilar and logically equivalent programs in PDL with parallel operator
- On the decidability of process equivalences for the \(\pi\)-calculus
- Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
- Non-interleaving semantics for mobile processes
- A stable non-interleaving early operational semantics for the pi-calculus
- Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda
- Mathematical modal logic: A view of its evolution
- The security pi-calculus and non-interference
- Modelling and analysing neural networks using a hybrid process algebra
- Encoding generic judgments: preliminary results
- Observational structures and their logic
- Distinguishing between communicating transactions
- Model-checking process equivalences
- Discrimination by parallel observers: the algorithm.
- On process equivalence = equation solving in CCS
- scientific article; zbMATH DE number 7379295 (Why is no real title available?)
- scientific article; zbMATH DE number 7407774 (Why is no real title available?)
This page was built for publication: Modal logics for mobile processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685408)
