Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming

Abstract

Process calculi provide a language in which the structure of terms represents the structure of processes together with an operational semantics to represent computational steps. This paper uses rewriting logic for specifying and analyzing a process calculus for concurrent constraint programming (ccp), combining spatial and real-time behavior. In these systems, agents can run processes in different computational spaces (e.g., containers) while subject to real-time requirements (e.g., upper bounds in the execution time of a given operation), which can be specified with both discrete and dense linear time. The real-time rewriting logic semantics is fully executable in Maude with the help of rewriting modulo SMT: partial information (i.e., constraints) in the specification is represented by quantifier-free formulas on the shared variables of the system that are under the control of SMT decision procedures. The approach is used to symbolically analyze existential real-time reachability properties of process calculi in the presence of spatial hierarchies for sharing information and knowledge.

Semantic Structures for Spatially-Distributed Multi-Agent Systems

“…In [14,13] we described D-SPACES, an implementation of scs that provides property-checking methods as well as an implementation of a specific type of constraint systems (boolean algebras). In [21] we used rewriting logic for specifying and analyzing ccp processes combining spatial and real-time behavior. These processes can run processes in different computational spaces while subject to real-time requirements.…”

A Rewriting Logic Approach to Stochastic and Spatial Constraint System Specification and Verification

“…• In terms of formal analysis, the semantics proposed in this work can be used for probabilistic simulation and quantitative analysis, extending the reachability and LTL model checking analysis previously offered in [40].…”

“…In sscc, the underlying notion of hierarchical and distributed store found in scc [29] is faithfully modeled by local spaces, where inconsistent local stores need not propagate their inconsistencies towards the global store. Previous efforts by the authors to bring executable semantics and reachability analysis to scc using rewriting logic in [43] -and its subsequent extension to real-time in [40]-are transparently subsumed as sub-models in sscc, and further extended with stochastic features and support for statistical model checking. This latter claim means that the sscc executable semantics presented in this work can also be used for reachability analysis and LTL model checking of reactive systems, although these features are not part of the present exposition.…”

“…This latter claim means that the sscc executable semantics presented in this work can also be used for reachability analysis and LTL model checking of reactive systems, although these features are not part of the present exposition. The reader is referred to [43,40] for an explanation and examples of how these features can be supported by a subset of the rewriting logic semantics presented in this work.…”