Graph generation to statically represent CSP processes
The CSP language allows the specification and verification of complex concurrent systems. Many analyses for CSP exist that have been successfully applied in different industrial projects. However, the cost of the analyses performed is usually very high, and sometimes prohibitive, due to the complexi...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2011 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/36090 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/36090 |
| Access Level: | acceso abierto |
| Palabra clave: | Complex concurrent systems CSP specifications Deterministic execution Graph generation Industrial projects Specification and verification Algorithms Animation Data structures Logic programming Specifications LENGUAJES Y SISTEMAS INFORMATICOS |
| Sumario: | The CSP language allows the specification and verification of complex concurrent systems. Many analyses for CSP exist that have been successfully applied in different industrial projects. However, the cost of the analyses performed is usually very high, and sometimes prohibitive, due to the complexity imposed by the non-deterministic execution order of processes and to the restrictions imposed on this order by synchronizations. In this work, we define a data structure that allows us to statically simplify a specification before the analyses. This simplification can drastically reduce the time needed by many CSP analyses. We also introduce an algorithm able to automatically generate this data structure from a CSP specification. The algorithm has been proved correct and its implementation for the CSP's animator ProB is publicly available. © 2011 Springer-Verlag. |
|---|