Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
TCSP: theory of communicating sequential processes
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Design and validation of computer protocols
Design and validation of computer protocols
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
A classical mind
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
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
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool
FME '93 Proceedings of the First International Symposium of Formal Methods Europe on Industrial-Strength Formal Methods
Compositionality in State Space Verification Methods
Proceedings of the 17th International Conference on Application and Theory of Petri Nets
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alphabet-Based Synchronisation is Exponentially Cheaper
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
| Hi-index | 0.00 |
This paper describes an on-the-fly technique for computing the CFFD-preorder relation on two labelled transition systems (LTSs). CFFD is a process-algebraic semantic model for comparing processes. It is a modification of the CSP model. LTSs are used as a representation of processes. The presented technique is based on transforming the specification process into a special tester process. The tester is then composed in parallel with the processes of the implementation. Violations against the specification are detected as illegal states, deadlocks and livelocks during the computation of the composition. Tester processes are an extension of Brinksma's canonical testers. Using a tester process can be a substantially faster method of computing CFFD-preorder than the previously used method of comparing acceptance graphs.