Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
A context dependent equivalence between processes
Theoretical Computer Science
Tableau-based model checking in the propositional mu-calculus
Acta Informatica
SDL with applications from protocol specification
SDL with applications from protocol specification
Practical methods for the formal validation of SDL specifications
Computer Communications - Special issue on practical use of FDTs in communications & distributed systems
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Symbolic Model Checking
Data Communications Computer Networks and Open Systems 3rd Ed.
Data Communications Computer Networks and Open Systems 3rd Ed.
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Architecture-driven verification of concurrent systems
Nordic Journal of Computing
Validating SDL Specifications: an Experiment
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Automated Verification of Equivalence of Protocol Machines
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
FORTE '91 Proceedings of the IFIP TC6/WG6.1 Fourth International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols: Formal Description Techniques, IV
CADP - A Protocol Validation and Verification Toolbox
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
SDL versus c equivalence checking
SDL'05 Proceedings of the 12th international conference on Model Driven
Application of stuck-free conformance to service-role composition
SAM'06 Proceedings of the 5th international conference on System Analysis and Modeling: language Profiles
| Hi-index | 0.00 |
Faster, better networks algorithms are often being discovered, and it is desirable to be able to replace an old algorithm by a new in a manner that is completely transparent to the application using it. This paper investigates the technique for ensuring such transparency for protocols expressed in SDL, via bisimulation checking. We discuss the main issues involved in translating SDL into Concurrency Workbench, a tool for performing bisimulation checking, and illustrate the feasibility of the technique by comparing the SDL specification of the Go-Back N protocol with the family of new protocols, called Asynchronous Retransmission Go-Back- N (AR). The latter perform better in environments characterized by high error rates and/or large propagation delays.