Name
Abstract | ||
|---|---|---|
The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems distributed in physical space. Traditional verification techniques are well suited to analyse the temporal evolution of programs; properties of space are typically not explicitly taken into account. We propose a methodology to verify properties depending upon physical space. We define an appropriate logic, stemming from the tradition of topological interpretations of modal logics, dating back to earlier logicians such as Tarski, where modalities describe neighbourhood. We lift the topological definitions to a more general setting, also encompassing discrete, graph-based structures. We further extend the framework with a spatial until operator, and define an efficient model checking procedure, implemented in a proof-of-concept tool. |
Year | Venue | Field |
|---|---|---|
2014 | CoRR | Modalities,Discrete mathematics,Graph,Model checking,Computer science,Algorithm,Neighbourhood (mathematics),Operator (computer programming),Collective adaptive systems,Modal,Computation |
DocType | Volume | Citations |
Journal | abs/1406.6393 | 2 |
PageRank | References | Authors |
0.44 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincenzo Ciancia | 1 | 96 | 10.80 |
| Diego Latella | 2 | 1168 | 113.42 |
| Michele Loreti | 3 | 812 | 58.60 |
| Mieke Massink | 4 | 1095 | 87.58 |