Spatio-Temporal Logic (SpaTiaL)

• SpaTiaL is a formal framework that integrates learned spatial classifiers with temporal logic to specify and monitor dynamic, pattern-rich systems.
• It employs SVM-STL to construct spatial predicates via machine learning and uses robust parameter synthesis techniques like Particle Swarm Optimization.
• The framework has practical applications in reaction-diffusion systems, swarm robotics, and cyber-physical systems, enhancing interpretability and automation.

Spatio-Temporal Logic (SpaTiaL)

Spatio-Temporal Logic (SpaTiaL) constitutes a formal framework for specifying and learning properties of dynamical systems that exhibit both spatial and temporal structure. The framework extends the expressiveness of traditional Signal Temporal Logic (STL) by enabling the specification and learning of properties involving time-varying spatial patterns, incorporating spatial classification through machine learning, and supporting robust parameter synthesis and interpretability for complex spatio-temporal dynamics. The SVM-STL formulation provides a unified technical foundation for learning, monitoring, and synthesizing spatio-temporal logic specifications in dynamical systems and serves as a prototype for second-generation SpaTiaL methodologies (Alsalehi et al., 2021).

1. Syntax and Semantics of SVM-STL

Let $S:\mathbb{N}\to\mathbb{R}^{L\times W\times C}$ denote a spatio-temporal trajectory over a discrete time index (e.g., system simulations producing image-like grid data over time). Formulas in (parametric) SVM-STL are generated as follows: $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$

• $\mu_j$ is a spatial predicate of the form either $h_j(S[k]) > r$ or $h_j(S[k]) \le r$, where $h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$ is a learned spatial classifier and $r\in\mathbb{R}$ is a threshold.
• The temporal interval operators $\mathcal{G}_{[a,b]}$ (“always in $[a,b]$”) and $\mathcal{F}_{[a,b]}$ (“eventually in $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$0”) quantify over time indices.

Qualitative semantics are inductively defined:

$$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$1

Quantitative (robustness) semantics return a real-valued signal $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$2: $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$3 This semantic lifting supports both binary satisfaction and margin-based robustness.

2. Spatial Predicates and Classifier Construction

Classical STL predicates operate as $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$4 for some real-valued function $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$5. In SVM-STL, these are generalized to $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$6, which are learned spatial classifiers operating on each spatio-temporal frame (e.g., an image, grid of concentrations).

Construction of $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$7:

• Extract features using a pre-trained CNN feature extractor $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$8.
• Form a one-vs-rest binary classification problem for each spatial class $$\varphi ::= \top \;\mid\; \mu_j \;\mid\; \neg\varphi \;\mid\; \varphi_1\wedge\varphi_2 \;\mid\; \varphi_1\vee\varphi_2 \;\mid\; \mathcal{G}_{[a,b]}\varphi \;\mid\; \mathcal{F}_{[a,b]}\varphi$$9.
• Solve the convex SVM: $\mu_j$0
• Define $\mu_j$1, which provides a normalized margin indicating the presence of spatial pattern $\mu_j$2.

These spatial classifiers can thus detect complex visual patterns, acting as the bridge from geometric structure to Boolean/spatial logic predicates.

3. Learning SVM-STL Specifications from Data

The framework for learning SVM-STL formulas from data consists of several pipeline stages:

3.1 Clustering unlabeled spatial data:

• Treat spatial frames $\mu_j$3 as points in the CNN feature space.
• Run $\mu_j$4-means clustering (optimized via Particle Swarm Optimization, PSO) on feature vectors, yielding $\mu_j$5 spatial classes.

3.2 Learning predicates (SVMs):

• For each cluster $\mu_j$6, perform one-vs-rest classification to train $\mu_j$7.

3.3 Clustering spatio-temporal trajectories:

• Map each trajectory $\mu_j$8 to a time series $\mu_j$9.
• Cluster these multivariate time series using dynamic time warping (DTW) distance and PSO-tuned $h_j(S[k]) > r$0-means.

3.4 Temporal logical structure:

• Using the above-labeled trajectories and atomic primitives $h_j(S[k]) > r$1, learn temporal formulas:
  • Fit small depth-2 decision trees (impurity = misclassification gain).
  • Apply AdaBoost to aggregate $h_j(S[k]) > r$2 such trees into a final SVM-STL classifier.

The result is a compositional spatio-temporal logic formula in which spatial structure is captured via learned image classifiers and temporal evolution is encoded via STL-like operators (Alsalehi et al., 2021).

4. Parameter Synthesis for Spatio-Temporal Specifications

Given a parametric SVM-STL formula $h_j(S[k]) > r$3 and a parametric dynamical system $h_j(S[k]) > r$4, the problem is to identify system parameters $h_j(S[k]) > r$5 that maximize the robustness of $h_j(S[k]) > r$6 on the induced trajectory $h_j(S[k]) > r$7: $h_j(S[k]) > r$8 Since the robustness function is non-differentiable, parameter optimization employs Particle Swarm Optimization (PSO): $h_j(S[k]) > r$9 This approach permits synthesis of, for example, reaction-diffusion system parameters that enforce the emergence of specified spatial patterns with temporal constraints.

5. Illustrative Case: Reaction-Diffusion Patterns

In the reaction-diffusion testbed, the system evolves on a $h_j(S[k]) \le r$0 grid involving species $h_j(S[k]) \le r$1 with spatio-temporal couplings; system trajectories $h_j(S[k]) \le r$2 are image sequences representing species concentrations.

Learned SVM-STL Specification Example:

$h_j(S[k]) \le r$3

Each $h_j(S[k]) \le r$4 is a shallow decision tree formula combining temporal windows and spatial predicates, such as: $h_j(S[k]) \le r$5 Here $h_j(S[k]) \le r$6 and $h_j(S[k]) \le r$7 distinguish “no spots” vs. “spots” and the windowing captures phase transitions in pattern formation. Parameter synthesis identifies diffusion coefficients $h_j(S[k]) \le r$8 favoring desired spatial patterns such as “large spots.” Robustness $h_j(S[k]) \le r$9 indicates margin of pattern satisfaction under optimized parameters (Alsalehi et al., 2021).

6. Expressiveness, Complexity, and Applications

SVM-STL achieves high expressiveness by coupling per-frame spatial classification with full temporal logical structure:

• Each frame is embedded as a vector of $h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$0-values, yielding data-driven detection of complex spatial types.
• Temporal formulas over spatial classes enable compositional, phase-structured modeling.

Complexity:

• Training: $h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$1 convex SVMs ($h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$2) and boosting over decision trees ($h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$3).
• Monitoring: $h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$4 for trajectory of length $h_j:\mathbb{R}^{L\times W\times C}\to\mathbb{R}$5.
• Parameter synthesis: heuristic, scaling linearly with the product of PSO particles, iterations, and system simulation cost.

Applications:

• Formal verification and automatic parameter tuning of spatio-temporal phenomena in reaction-diffusion systems, swarm robotics, smart-city monitoring, and anomaly detection in cyber-physical systems—specifically where interpretable, time-varying spatial patterns are key targets (Alsalehi et al., 2021).

7. Broader Connections and Research Context

SpaTiaL, exemplified by the SVM-STL framework, emerges as a second-generation approach for expressing learned, data-driven specifications in high-dimensional spatio-temporal systems. This approach marks a shift from hand-tuned logical templates toward logics whose atomic predicates are induced via machine learning from raw system data, enabling automated discovery and operationalization of domain-relevant spatial concepts. As research progresses, extensions to spatial logics with richer geometric primitives, finer-grained temporal operators, and robust online monitoring infrastructures are plausible developments. The SVM-STL methodology stands as a current prototype, distinct from pure hand-crafted logics and from older, limited spatial operators, in supporting practical, interpretable spatio-temporal logic specification and learning (Alsalehi et al., 2021).