Daniel Brand
- 1 BARTLETT, K A., SCANTLEBURY, R A, AND WILKINSON, P T A note on reliable full-duplex tran$- mission over half-duplex links Commun, ACM 12, 5 (May 1969), 260-261. Google Scholar
- 2 BOCHMANN, G V Communlcatton protocols and error recovery procedures, ACM Oper. Syst Rev. 9. 3 (July 1975), pp 45-50 Google Scholar
- 3 BOCHMANN G V Flmte state description of communicattons protocols. Proc. Computer Network Protocols Symp., L~ege, Belgium, Feb. 1978, pp F3-I-F3-11Google Scholar
- 4 BOCHMANN, G,V, ANO GESCEI, J. A unified method for specificatton and vertlication of protocols. Proc IFIP 77, AFIPS Press, Arlington, Va, 1977, pp 229-234Google Scholar
- 5 BOCHMANN, G.V, AND MERLIN, P,On the construction of communication protocols. Pro~. Int. Conf on Computer Commumcat~ons, Oct 1980, pp 371-378Google Scholar
- 6 BOCHMANN, G.V., AND SUNSHINE, C. Use of formal methods in communication protocol design. IEEE Trans. Commun COM-28, 4 (Apr. 1980), 624-631Google Scholar
- 7 BRAND, D., AND JOYNER, W.H, JR. Verification of protocols using symbolic execution. Comput. Networks 2, 4/5 (Sept./Oct. 1978), 351-360.Google Scholar
- 8 BRAND, D., AND ZAFIROPULO, P.Synthesis of protocols for an unlimited number of processes. In Proc. of Trends and Applicanons 1980: Computer Network Protocols, National Bureau of Standards, Gaithersburg, Md., May 1980, pp. 29--40.Google Scholar
- 9 BRAND, D., AND ZAFIROPULO, P.On communicating fimte-state machines. Tech Pep. RZ 1053, IBM Zurich Research Lab., Rfischlikon, Switzerland, Jan. 1981.Google Scholar
- 10 CCITT.Recommendauon X 21 (revised), AP VI, No. 55-E, Geneve, Switzerland, 1976.Google Scholar
- 11 DANTHINE, A, ED Proc Computer Network Protocols Symp, Liege, Belgium, 1978; see also specaal lSSile off computer network protocols, Comput Networks 2, 4/5 (Sept/Oct. 1978)Google Scholar
- 12 DEvY, M., AND DIAZ, M Multdevel speclficatmn and validation of the control in communication systems. Conf. on Distributed Comput. Syst, Oct 1979, pp. 43-50Google Scholar
- 13 GOUDA, M.G, AND MANNING, E.G On the modehng, analysis and design of protocols---A special class of software structures Proe. 2nd lnt Conf on Software Engineenng, San Francisco, Calif, Oct. 1976, pp. 256-262 Google Scholar
- 14 HAILPERN, B., AND OWICKI, S.Verifying network protocols using temporal logic. In Proc Trends and Applicaoons 198ff Computer Network Protocols, National Bureau of Standards, Gaithersburg, Md., May 1980, pp 18-28.Google Scholar
- 15 HAJEK, J Automaucally verified data transfer protocols Proc Int Conf on Computer Commumcations, Kyoto, Japan, Sept 1978, pp. 749-756Google Scholar
- 16 KARP, R M, Arid MILLER, R E Parallel program schemata: A mathemaucal model for parallel computaUon Conf Rec 8th Ann. IEEE S),mp on S~~,achtng and Automata Theory (Oct 1967), IEEE, New York, pp 55-61.Google Scholar
- 17 MERLIN, P.M.A methodology for the design and Jmplementauon of commumcatmn protocols IEEE Trans Commun. COM.24, 6 (June 1976), 614--621.Google Scholar
- 18 MERLIN, P.M.Specificatmn and vahdatton of protocols. IEEE Trans Commun. COM-27, 11 (Nov 1979), 1671-1680Google Scholar
- 19 PETERSON, J LPetn nets Comput. Sum, 9, 3 (Sept. 1977), 223-251 Google Scholar
- 20 RUDIN, H, WEST, C H., AND ZAFIROPULO, P Automated protocol validauon. One cram of development Proc Computer Network Protocols Conf., Liege, Belgium, Feb 1978, pp F4-1-F4-6Google Scholar
- 21 SCHULTZ, G D., RosE, D B., WEST, C H, AND GRAY, J.P. Executable descnpuon and validation of SNA. IEEE Trans. Commun COM-28, 4 (Apr. 1980), 661--667.Google Scholar
- 22 STENNING,INING, N V.A data transfer protocol Comput Networks 1, 2 (Sept 1976), 99-110Google Scholar
- 23 SUNSHINE, C.A Commumcaoon Protocol Modebng. Artech House, Dedham, Mass, 1981Google Scholar
- 24 SYMONS, F I.W Representation, analys~s and verification of commumcatton protocols. Rep. No 7380, Telecom Australia Research Labs, November 1980,Google Scholar
- 25 WEST, C H.General teclmtque for commumcations protocol vahdauon IBM J. Res. Devel. 22, 4 (July 1978), 393--404.Google Scholar
- 26 WESt, C H, AND ZArmOI'ULO, P Automated vahdation of a communicauons protocol. The CCITT X21 recommendation IBM J Res Devel 22, 10an. 1978), 60-71Google Scholar
- 27 YOELI, M., AND BARZILAI, Z.Behavioral descnptmn of commumcatmn switching systems using extended Petn nets. Dtgttal Processes 3 (1977), 307-320.Google Scholar
- 28 ZAFIROPULO, P. Protocol vahdation by duologue-matrix analys~s IEEE Trans Commun COM-26, 8 (Aug 1978), 1187-1194Google Scholar
- 29 ZAFIROPULO, P, WEST, C H, RUDIN, H, COWAN, D.D., AND BRAND, D.Towards analyzing and synthesizing protocols IEEE Trans Commun COM-28, 4 (Apr 1980), 651-661Google Scholar
Index Terms
- On Communicating Finite-State Machines
Recommendations
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10: Proceedings of the 4th international conference on Reachability problemsUnambiguity and its generalization to quantified ambiguity are important concepts in, e.g., automata and complexity theory. Basically, an unambiguous machine has at most one accepting computation path for each accepted word. While unambiguous pushdown ...
From Two-Way to One-Way Finite State Transducers
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceAny two-way finite state automaton is equivalent to some one-way finite state automaton. This well-known result, shown by Rabin and Scott and independently by Shepherd son, states that two-way finite state automata (even non-deterministic) characterize ...
State-Identification problems for finite-state transducers
FATES'06/RV'06: Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime VerificationA well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class of problems handled by this theory is state identification: we are given a machine with known state space and transition ...
Comments