Hints for the interpretation of the ISO session layer
ACM SIGCOMM Computer Communication Review
Deriving protocol specifications from service specifications
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Specification and implementation of an ISO session layer
IBM Systems Journal
A Protocol Modeling and Verification Approach Based on a Specification Language and Petri Nets
IEEE Transactions on Software Engineering
Compositional reachability analysis using process algebra
TAV4 Proceedings of the symposium on Testing, analysis, and verification
Specification and analysis of the SNR high-speed transport protocol
IEEE/ACM Transactions on Networking (TON)
A grammar-based methodology for protocol specification and implementation
SIGCOMM '85 Proceedings of the ninth symposium on Data communications
Automated Protocol Implementation with RTAG
IEEE Transactions on Software Engineering
Semiautomatic Implementation of Protocols Using an Estelle-C Compiler
IEEE Transactions on Software Engineering
Time and Asynchrony in Interactions among Distributed Real-Time Objects
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
Telecommunication service description using state transition rules
IWSSD '91 Proceedings of the 6th international workshop on Software specification and design
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
On the axiomatisability of priority
Mathematical Structures in Computer Science
A Rule Format for Associativity
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Analysing the BKE-security Protocol with μCRL
Electronic Notes in Theoretical Computer Science (ENTCS)
Rule formats for distributivity
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
On the axiomatizability of priority
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Rule formats for distributivity
Theoretical Computer Science
| Hi-index | 0.00 |