Modal logics for mobile processes
From MaRDI portal
Publication:685408
DOI10.1016/0304-3975(93)90156-NzbMath0778.68033OpenAlexW2106102830MaRDI QIDQ685408
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55)
Related Items (59)
Modelling and analysing neural networks using a hybrid process algebra ⋮ Bisimilar and logically equivalent programs in PDL with parallel operator ⋮ On sequential composition, action prefixes and process prefix ⋮ Bisimilar and logically equivalent programs in PDL ⋮ A spatial logic for concurrency. I ⋮ On process equivalence = equation solving in CCS ⋮ A modal logic for message passing processes ⋮ A \(\pi\)-calculus with explicit substitutions ⋮ A Propositional Dynamic Logic for Concurrent Programs Based on the π-Calculus ⋮ Models for name-passing processes: Interleaving and causal ⋮ On confluence in the π-calculus ⋮ Unnamed Item ⋮ On the decidability of process equivalences for the π-calculus ⋮ Reasoning about higher-order processes ⋮ Confluence of processes and systems of objects ⋮ A π-calculus with explicit substitutions: The late semantics ⋮ Synthesising correct concurrent runtime monitors ⋮ On the decidability of process equivalences for the \(\pi\)-calculus ⋮ When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ A Logic for Distributed Higher Order π-Calculus ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Formalizing CCS and \(\pi\)-calculus in Guarded Cubical Agda ⋮ Complete inference systems for weak bisimulation equivalences in the \(\pi\)-calculus. ⋮ Characterisations of testing preorders for a finite probabilistic \(\pi\)-calculus ⋮ Comparing the expressiveness of the \(\pi \)-calculus and CCS ⋮ A generic framework for \(n\)-protocol compatibility checking ⋮ Unnamed Item ⋮ Distinguishing between communicating transactions ⋮ Mathematical modal logic: A view of its evolution ⋮ Unnamed Item ⋮ Symbolic bisimulations ⋮ Causality for mobile processes ⋮ An algebraic verification of a mobile network ⋮ Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of π-Calculus Processes ⋮ A randomized encoding of the \(\pi\)-calculus with mixed choice ⋮ The security pi-calculus and non-interference ⋮ A Complete Axiomatic System for a Process-Based Spatial Logic ⋮ Explicit substitutions for \(\pi\)-congruences ⋮ Decidable Extensions of Hennessy-Milner Logic ⋮ Barbed bisimulation ⋮ Multiple-Labelled Transition Systems for nominal calculi and their logics ⋮ Event structures for the reversible early internal \(\pi\)-calculus ⋮ Partial confluence of processes and systems of objects ⋮ Non-interleaving semantics for mobile processes ⋮ Mechanized metatheory revisited ⋮ Encoding Generic Judgments ⋮ Modal Logics for Cryptographic Processes ⋮ Divergence and unique solution of equations ⋮ Unnamed Item ⋮ Names of the \(\pi\)-calculus agents handled locally ⋮ \(\pi\)-calculus in (Co)inductive-type theory ⋮ Discrimination by parallel observers: the algorithm. ⋮ Static analysis for the \(\pi\)-calculus with applications to security ⋮ Language-based performance prediction for distributed and mobile systems ⋮ A Logical Characterisation of Static Equivalence ⋮ Coalgebraic Modal Logic Beyond Sets ⋮ A Proof Theoretic Approach to Operational Semantics ⋮ Co-Algebraic Models for Quantitative Spatial Logics ⋮ A Name Abstraction Functor for Named Sets
Cites Work
This page was built for publication: Modal logics for mobile processes
