A Practical Technique for Process Abstraction

cal Technique for Process Abstraction Glenn Bruns Department of Computer Science University of Edinburgh Edinburgh EH9 3JZ, UK 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.

• Type: Conference
• Year: 1993
• Where: CONCUR
• Authors: Glenn Bruns
• Keywords: Computer Science University, CONCUR 1993, Distributed And Parallel Computing, Process Abstraction Glenn, Temporal Logic Formula