SLMC

swMATH4604MaRDI QIDQ16775FDOQ16775

Author name not available (Why is that?)

Official website: http://ctp.di.fct.unl.pt/SLMC/

Cited In (94)

• Specification and refinement of mobile systems in MTLA and mobile UML
• A spatial logic for concurrency. I
• A new natural structural congruence in the pi-calculus with replication
• The Temporal Logic of Rewriting: A Gentle Introduction
• A spatial logic for concurrency. II
• A name abstraction functor for named sets
• TQL: a query language for semistructured data based on the ambient logic
• Foundations of Software Science and Computation Structures
• An Analysis for Proving Temporal Properties of Biological Systems
• Deciding safety properties in infinite-state pi-calculus via behavioural types
• An exercise in structural congruence
• Frontiers of Combining Systems
• A calculus and logic of resources and processes
• Formal Methods for Components and Objects
• Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS
• 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
• Model checking mobile stochastic logic
• What is a free name in a process algebra?
• A rewriting-based model checker for the linear temporal logic of rewriting
• Resources, concurrency, and local reasoning
• Axiomatisation and decidability of multi-dimensional Duration Calculus
• Pure bigraphs: structure and dynamics
• Nominal logic, a first order theory of names and binding
• CONCUR 2005 – Concurrency Theory
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• On the relationship between spatial logics and behavioral simulations
• A coordination approach to mobile components
• Elimination of spatial connectives in static spatial logics
• Nominal unification
• Graphical models of separation logic
• Verification of spatial and temporal modalities in biochemical systems
• Model checking mobile ambients
• Concurrent weighted logic
• Spatial and behavioral types in the pi-calculus
• Linear and affine logics with temporal, spatial and epistemic operators
• MWB
• Petruchio
• CBabel
• Name-passing in an ambient-like calculus and its proof using spatial logic
• Tools and algorithms for the construction and analysis of systems. 18th international conference, TACAS 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 -- April 1, 2012. Proceedings
• BioShape
• Motras
• KLAIM
• ULM
• MoMo
• tKlaim
• UniForM
• PIPER
• BioAmbient Machine
• BlenX
• QuteRTL
• MMC
• MAGIC
• FShell
• A decentralised graphical implementation of mobile ambients
• CC-Pi
• Spatial-behavioral types for concurrency and resource control in distributed systems
• Qu-Prolog
• DCVALID
• GcPan
• Lorel
• Towards a process calculus for REST: current state of the art
• Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
• Belief, knowledge, lies and other utterances in an algebra for space and extrusion
• A theory of structural stationarity in the \(\pi\)-calculus
• Transition systems, link graphs and Petri nets
• Deciding validity in a spatial logic for trees
• Programming Languages and Systems
• Decidable Extensions of Hennessy-Milner Logic
• Observing Distributed Computation. A Dynamic-Epistemic Approach
• Spatial-Behavioral Types, Distributed Services, and Resources
• Compositionality for quantitative specifications
• Fresh logic: Proof-theory and semantics for FM and nominal techniques
• Bialgebraic methods and modal logic in structural operational semantics
• Spatio-temporal Model Checking for Mobile Real-Time Systems
• Hierarchical design rewriting with Maude
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• A Hybrid Type System for Lock-Freedom of Mobile Processes
• Using session types for reasoning about boundedness in the \(\pi\)-calculus
• Kind Bigraphs
• Elimination of quantifiers and undecidability in spatial logics for concurrency
• A semantic framework for open processes
• Graphical Encoding of a Spatial Logic for the π-Calculus
• A study on team bisimulation and H-team bisimulation for BPP nets
• Team bisimilarity, and its associated modal logic, for BPP nets
• Partial Knowledge in Membrane Systems: A Logical Approach
• A Complete Axiomatic System for a Process-Based Spatial Logic
• Manipulating trees with hidden labels
• Undecidability of model checking in brane logic
• Extensionality of spatial observations in distributed systems
• Co-algebraic models for quantitative spatial logics
• On symbolic semantics for name-decorated contexts

This page was built for software: SLMC