| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437137 | Theoretical Computer Science | 2006 | 20 Pages |
Abstract
This paper presents a method for the decomposition of HML formulas. It can be used to decide whether a process algebra term satisfies a HML formula, by checking whether subterms satisfy certain formulas, obtained by decomposing the original formula. The method uses the structural operational semantics of the process algebra. The main contribution of this paper is the extension of an earlier decomposition method for the De Simone format from the Ph.D. thesis of Larsen in 1986, to more general formats.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
