A spatial logic for concurrency. I
From MaRDI portal
Publication:1887152
DOI10.1016/S0890-5401(03)00137-8zbMATH Open1068.03022DBLPjournals/iandc/CairesC03OpenAlexW2076632469WikidataQ56982113 ScholiaQ56982113MaRDI QIDQ1887152FDOQ1887152
Authors: Luís Caires, Luca Cardelli 
Publication date: 23 November 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00137-8
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Algebraic laws for nondeterminism and concurrency
- Functions as processes
- Title not available (Why is that?)
- The Logic of Bunched Implications
- Modal logics for mobile processes
- A new approach to abstract syntax with variable binding
- Results on the propositional \(\mu\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anytime, anywhere: modal logics for mobile ambients
- Multisets and structural congruence of the pi-calculus with replication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensionality and intensionality of the ambient logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Model checking mobile processes
- Title not available (Why is that?)
Cited In (61)
- Process calculi for biological processes
- Kind Bigraphs
- Trustworthy Global Computing
- On bisimilarity for polyhedral models and \texttt{SLCS}
- Specification and refinement of mobile systems in MTLA and mobile UML
- Hierarchical design rewriting with Maude
- A spatial logic for concurrency. II
- A name abstraction functor for named sets
- CONCUR 2004 - Concurrency Theory
- Deciding safety properties in infinite-state pi-calculus via behavioural types
- A Decentralized Implementation of Mobile Ambients
- An exercise in structural congruence
- A calculus and logic of resources and processes
- Learning and Detecting Emergent Behavior in Networks of Cardiac Myocytes
- Title not available (Why is that?)
- Elimination of quantifiers and undecidability in spatial logics for concurrency
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Verification of finite-state machines: a distributed approach
- A spatial equational logic for the applied \(\pi \)-calculus
- Abstract interpretation based verification of temporal properties for BioAmbients
- Relating reasoning methodologies in linear logic and process algebra
- Model checking mobile stochastic logic
- A rewriting-based model checker for the linear temporal logic of rewriting
- Axiomatisation and decidability of multi-dimensional Duration Calculus
- A proof theoretic view of spatial and temporal dependencies in biochemical systems
- Graphical models of separation logic
- Verification of spatial and temporal modalities in biochemical systems
- Concurrent weighted logic
- Spatial and behavioral types in the pi-calculus
- Linear and affine logics with temporal, spatial and epistemic operators
- Name-passing in an ambient-like calculus and its proof using spatial logic
- A decentralised graphical implementation of mobile ambients
- Spatial-behavioral types for concurrency and resource control in distributed systems
- Physarum spatial logic
- A study on team bisimulation and H-team bisimulation for BPP nets
- Title not available (Why is that?)
- Team bisimilarity, and its associated modal logic, for BPP nets
- Belief, knowledge, lies and other utterances in an algebra for space and extrusion
- Logical vs. behavioural specifications
- A theory of structural stationarity in the \(\pi\)-calculus
- Hybrid Systems: Computation and Control
- A Spatial Equational Logic for the Applied π-Calculus
- Decidable Extensions of Hennessy-Milner Logic
- Logical Semantics of Types for Concurrency
- Spatial-Behavioral Types, Distributed Services, and Resources
- Compositionality for quantitative specifications
- A noninterleaving model of concurrency based on transition systems with spatial structure
- Title not available (Why is that?)
- A Complete Axiomatic System for a Process-Based Spatial Logic
- Fresh logic: Proof-theory and semantics for FM and nominal techniques
- Manipulating trees with hidden labels
- Extensionality of spatial observations in distributed systems
- Co-algebraic models for quantitative spatial logics
- A Spatial Logic for Simplicial Models
- A Logic for Distributed Higher Order π-Calculus
- Modular Markovian Logic
- CONCUR 2004 - Concurrency Theory
- Minimisation of spatial models using branching bisimilarity
- Bialgebraic methods and modal logic in structural operational semantics
- Title not available (Why is that?)
Uses Software
This page was built for publication: A spatial logic for concurrency. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887152)
