Abstract
This paper proposes an algorithm for abstracting infinite state CSP z - formal combination of CSP (behavioural part) and Z (data part) - processes, with the aim of model checking. Differently from previous work, where CSPz process abstraction is achieved by investigating only its data part, the current approach abstracts by exploring the whole CSPz process. In this way we obtain a faster abstraction algorithm in general, more specific data abstractions, and a wider class of infinite state CSPz processes to deal with. © Springer-Verlag 2004.
Author supplied keywords
Cite
CITATION STYLE
Farias, A., Mota, A., & Sampaio, A. (2004). Efficient CSPZ data abstraction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2999, 108–127. https://doi.org/10.1007/978-3-540-24756-2_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
