Conference Papers Year : 2018

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.
Fichier principal
Vignette du fichier
main.pdf (144) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01934953 , version 1 (26-11-2018)

Identifiers

  • HAL Id : hal-01934953 , version 1

Cite

Sergio Ramírez, Miguel Romero, Camilo Rocha, Frank D. Valencia. Real-time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming. Rewriting Logic and Its Applications - 12th International Workshop, Jun 2018, Thessaloniki, Greece. pp.226--244. ⟨hal-01934953⟩
135 View
179 Download

Share

More