Journal of the ACM (JACM)
Three partition refinement algorithms
SIAM Journal on Computing
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Information and Computation
An implementation of an efficient algorithm for bisimulation equivalence
Science of Computer Programming
Adding action refinement to a finite process algebra
Information and Computation
The weakest deadlock-preserving congruence
Information Processing Letters
Communication and Concurrency
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Fundamental Results for the Verification of Observational Equivalence: A Survey
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm
Proceedings of the IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XI
Computing Diagnostic Test for Incorrect Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
A Preorder for Partial Process Specifications
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Equivalence as a Bisimulation Equivalence
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CCS expressions, finite state processes, and three problems of equivalence
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Generating diagnostic information for behavioral preorders
Distributed Computing
| Hi-index | 0.00 |
Process algebras are convenient formalisms to develop specifications stepwise. This can be done with the help of partially defined states in a specification. When refining the specification, new transitions are added to partially defined states. At every step, it is verified with the help of special preorders, refinement relations, that the step leads towards a desired goal. This approach has already been introduced in the case, where the verification is based on weak bisimulation equivalence. We show in this article that refinement relations can also be developed in decorated trace semantics. Moreover, the intuitive picture seems to be simpler in trace-based than in bisimulation-based semantics. The algorithms to compute the new refinement relations are exponential in the worst case, but behave quite well in practical cases.