Abstract
With algebraic laws a process can be simplified before verifying its equivalence with another process. Also needed are laws to allow a process to be simplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms for some important classes of temporal properties.
Cite
CITATION STYLE
Bruns, G. (1993). A practical technique for process abstraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 715 LNCS, pp. 37–49). Springer Verlag. https://doi.org/10.1007/3-540-57208-2_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
