Communicating sequential processes
Communicating sequential processes
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Communication and Concurrency
Process Oriented Design for Java: Concurrency for All
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Concurrency: State Models And Java Programs
Concurrency: State Models And Java Programs
Proving event ordering properties for information systems
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Automatic translation from Circus to Java
FM'06 Proceedings of the 14th international conference on Formal Methods
Efficient symbolic computation of process expressions
Science of Computer Programming
| Hi-index | 0.00 |
This paper describes three optimization techniques for a process algebra interpreter called EB3PAI. This interpreter supports the EB3 method, which was developed for the purpose of automating the development of information systems using efficient symbolic execution of abstract specifications. The proposed optimizations allow an interpreter to execute actions on a quantified choice in constant time and on a quantified parallel composition in logarithmic time with respect to the number of entities in a quantified entity type. This time complexity is comparable to that of programmer-derived implementation of process expressions and significantly better than the time complexity of common process algebra simulators, which execute quantifications by computing their expansion into binary expressions.