Modal logics for mobile processes

DOI10.1016/0304-3975(93)90156-NzbMATH Open0778.68033OpenAlexW2106102830MaRDI QIDQ685408FDOQ685408

Authors: Juan-Miguel Gracia 

Publication date: 13 January 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90156-n

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

zbMATH Keywords

process algebrabisimulationmobile processPi calculus

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55)

Cites Work

• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• A calculus of communicating systems
• Title not available (Why is that?)
• On the termination of program schemas

Cited In (69)

• A spatial logic for concurrency. I
• A π-calculus with explicit substitutions: The late semantics
• Modelling and analysing neural networks using a hybrid process algebra
• A name abstraction functor for named sets
• Event structures for the reversible early internal \(\pi\)-calculus
• Observational structures and their logic
• Causality for mobile processes
• Title not available (Why is that?)
• A characterisation of open bisimilarity using an intuitionistic modal logic
• On process equivalence = equation solving in CCS
• Models for name-passing processes: Interleaving and causal
• Language-based performance prediction for distributed and mobile systems
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Bisimilar and logically equivalent programs in PDL
• On the decidability of process equivalences for the π-calculus
• Mechanized metatheory revisited
• An algebraic verification of a mobile network
• Confluence of processes and systems of objects
• A \(\pi\)-calculus with explicit substitutions
• Non-interleaving semantics for mobile processes
• Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda
• Symbolic bisimulations
• A modal logic for message passing processes
• Partial confluence of processes and systems of objects
• Formal semantics of a dynamic epistemic logic for describing knowledge properties of \(\pi \)-calculus processes
• Modal logics for nominal transition systems
• Bisimilar and logically equivalent programs in PDL with parallel operator
• A stable non-interleaving early operational semantics for the pi-calculus
• Coalgebraic modal logic beyond sets
• Reasoning about higher-order processes
• Modal logics for cryptographic processes
• On the decidability of process equivalences for the \(\pi\)-calculus
• Logics for bisimulation and divergence
• A filter model for mobile processes
• A generic framework for \(n\)-protocol compatibility checking
• Synthesising correct concurrent runtime monitors
• Mathematical modal logic: A view of its evolution
• \(\pi\)-calculus in (Co)inductive-type theory
• Congruence from the operator's point of view. Syntactic requirements on modal characterizations
• On sequential composition, action prefixes and process prefix
• Model-checking process equivalences
• Model-checking process equivalences
• Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
• Barbed bisimulation
• Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus.
• The security pi-calculus and non-interference
• Bisimulation and logic
• Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus
• Encoding generic judgments: preliminary results
• Title not available (Why is that?)
• Title not available (Why is that?)
• A proof theoretic approach to operational semantics
• Algebra and Coalgebra in Computer Science
• Title not available (Why is that?)
• Decidable Extensions of Hennessy-Milner Logic
• Static analysis for the \(\pi\)-calculus with applications to security
• A propositional dynamic logic for concurrent programs based on the \(\pi\)-calculus
• Distinguishing between communicating transactions
• Co-algebraic models for quantitative spatial logics
• On confluence in the \(\pi\)-calculus
• A Logic for Distributed Higher Order π-Calculus
• Names of the \(\pi\)-calculus agents handled locally
• Discrimination by parallel observers: the algorithm.
• A logical characterisation of static equivalence
• 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
• Comparing the expressiveness of the \(\pi \)-calculus and CCS
• Explicit substitutions for \(\pi\)-congruences
• A Complete Axiomatic System for a Process-Based Spatial Logic

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)