Academic literature on the topic 'Formal communication'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Formal communication.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Formal communication"
Thacker, Alice J. "Formal Communication Disorder." British Journal of Psychiatry 165, no. 6 (December 1994): 818–23. http://dx.doi.org/10.1192/bjp.165.6.818.
Full textColomer Feliu, Jordi, and Teresa Serra. "Communication in formal and non-formal science." Communication Papers 7, no. 13 (May 25, 2018): 217. http://dx.doi.org/10.33115/udg_bib/cp.v7i13.21990.
Full textT'Hooft, G. "Formal description techniques: Communication tools for data communication specialists." Computer Networks and ISDN Systems 14, no. 2-5 (January 1987): 311–21. http://dx.doi.org/10.1016/0169-7552(87)90070-5.
Full textKoen, Chris. "A Formal Communication Network Analysis Technique." British Journal of Sociology 38, no. 3 (September 1987): 373. http://dx.doi.org/10.2307/590694.
Full textBiswas, Pratik K. "A Formal Framework for Multicast Communication." IEEE Systems Journal 4, no. 3 (September 2010): 353–62. http://dx.doi.org/10.1109/jsyst.2010.2050364.
Full textMat Hassan, Ahmad Fuad, Khairul Faiz Alimi, Hishamudin Isam, and Mashetoh Abd. Mutalib. "Amalan Kesantunan Berbahasa dalam Komunikasi Formal dan Tidak Formal dalam Kalangan Pelajar Universiti." Jurnal Komunikasi: Malaysian Journal of Communication 36, no. 4 (December 11, 2020): 410–27. http://dx.doi.org/10.17576/jkmjc-2020-3604-25.
Full textOrsini-Puente, Marta. "Education and communication: an experience in the formal education." Comunicar 10, no. 20 (March 1, 2003): 147–54. http://dx.doi.org/10.3916/c20-2003-21.
Full textMcWhirter, Gregory. "Behavioural Deception and Formal Models of Communication." British Journal for the Philosophy of Science 67, no. 3 (September 1, 2016): 757–80. http://dx.doi.org/10.1093/bjps/axv001.
Full textJohnson, J. D., W. A. Donohue, C. K. Atkin, and S. Johnson. "Differences Between Formal and Informal Communication Channels." Journal of Business Communication 31, no. 2 (April 1, 1994): 111–22. http://dx.doi.org/10.1177/002194369403100202.
Full textBarbosa, M., M. Farsi, C. Allen, and A. S. Carvalho. "Formal validation of the CANopen communication protocol." IFAC Proceedings Volumes 36, no. 13 (July 2003): 225–30. http://dx.doi.org/10.1016/s1474-6670(17)32487-4.
Full textDissertations / Theses on the topic "Formal communication"
Chen, Yushan. "Formal synthesis of control and communication schemes." Thesis, Boston University, 2013. https://hdl.handle.net/2144/10965.
Full textIn traditional motion planning, the problem is simply specified as "go from A to B while avoiding obstacles", where A and B are two configurations or regions of interest in the robot workspace. However, a large number of robotic applications require more expressive specification languages, which allow for logical and temporal statements about the satisfaction of properties of interest. Examples include "visit A and B infinitely often, always avoid C, and do not visit D unless E vas visited before". Such task specifications cannot be trivially converted to a sequence of "go from A to B" primitives. This thesis establishes theoretical and computational frameworks for automatic synthesis of robot control and communication schemes that are correct-by-construction from task specifications given in expressive languages. We consider a purely discrete scenario, in which the dynamics of each robot is modeled as a finite discrete system. The first problem addressed in this thesis is the generation of provably-correct individual control and communication strategies for a team of robots from rich task specifications in the case when the workspace is static. The second problem relaxes this assumption and considers a scenario in which the environment changes according to some unknown patterns. It proposed a combined learning and formal synthesis approach to generate correct control policies. To tackle the first problem, we draw inspirations from the research fields of formal verification and synthesis, distributed formal synthesis, and concurrency theory. We consider a team of robots that can move among the regions of a partitioned environment and have known capabilities of servicing a set of requests that can occur in the regions of the partition. Some of these requests can be serviced by a robot individually, while some require the cooperation of groups of robots. We propose a top-down approach, in which global specifications given as Regular Expressions (RE) or Linear Temporal Logics (LTL) can be decomposed into local (individual) specifications, which can then be used to automatically synthesize robot control and communication strategies. To address the second problem, we bring together automata learning methods from the field of theoretical linguistics and techniques from temporal logic games and probabilistic model checking, to develop a provably-correct control strategy for robots moving in an environment with unknown dynamics. The robots are required to achieve a surveillance mission, in which a certain request needs to be serviced repeatedly, while the expected time in between consecutive services is minimized and additional temporal logic constraints are satisfied. We define a fragment of Linear Temporal Logic (LTL) to describe such a mission. We consider a single agent case at first and then extend the results to multi-agent systems. To this end, we apply approximate dynamic programming to our computational framework, which leads to significant reduction of computational time. To demonstrate the proposed theoretical and computational frameworks, we implement the derived algorithms in two experimental platforms, the Robotic Urban-Like Environment (RULE) and the Robotic InDoor-like Environment (RIDE). We assign tasks to the team using Regular Expressions or Linear Temporal Logics over requests occurring at regions in the environment. The robots are automatically deployed to complete the missions.
Camara, Daniel. "Formal verification of communication protocols for wireless networks." Universidade Federal de Minas Gerais, 2009. http://hdl.handle.net/1843/SLSS-7XGGPD.
Full textHenderson, Neil. "Formal modelling and analysis of an asynchronous communication mechanism." Thesis, University of Newcastle Upon Tyne, 2005. http://hdl.handle.net/10443/2098.
Full textOliphant, Michael. "Formal approaches to innate and learned communication : laying the foundation for language /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1997. http://wwwlib.umi.com/cr/ucsd/fullcit?p9820887.
Full textAnderegg, Jonathan James. "The Influence of Visual Formal Features on Mental Models." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1312222237.
Full textThacker, Alice Joanna. "The manifestation of schizophrenic formal communication disorder in sign language." Thesis, St George's, University of London, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.300411.
Full textWahlgren, Jacob, and Hedin Sam Yousefzadegan. "Formal security analysis of authentication in an asynchronous communication model." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-281753.
Full textDet blir alltmer relevant med formell analys av säkerhetsprotokoll. I formell analys så skapas en modell av ett protokoll eller ett system, och påståenden om modellens säkerhet skrivs. Ett program används sedan för att verifiera att påståendena gäller, eller för att hitta exempel där de inte gäller. Den här rapporten avänder formella metoder för att analysera autentiseringsaspekten av ett protokoll som tillåter privatpersoner, företag och system att asynkront dela känslig information på ett säkert sätt. Opublicerade och tidiga utkast av protokollet studerades och de algoritmer som beskrivs i protokollet verifierades med hjälp av Tamarin Prover. Analysen avslöjade två återspelningsattacker. Förbättringar till protokollet föreslogs baserat på denna analys. I senare versioner har protokollutvecklarna implementerat förslagen.
Shu, Guoqiang. "Formal Methods and Tools for Testing Communication Protocol System Security." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211333211.
Full textLund, Lisa. "The effect of communication method on user experience in a formal communication with a stranger." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-291126.
Full textMålet med denna uppsats var att ta reda på hur kommunikationsmetod påverkar användarupplevelsen i en formell kommunikation med en främling, så som i en arbetsansökan. Kommunikationsmetoderna som undersöktes var e-post och chatt. För att ta reda på detta gjordes två studier. Den första bestod av intervjuer med rekryterare. Den andra bestod av ett frågeformulär som skickades ut till kandidater. Rekryterarna värderade inte kommunikationsmetoden i sig högt när det gällde vilket intryck de fick av en kandidat, men kommunikations-hastigheten var en viktig faktor i valet av metod. Speciellt så uppfattade de ett behov av att vara tillgänglig och kunna svara snabbt om en informell kommunikationsmetod användes, denna uppfattning delades av kandidaterna. Mina resultat visade att jobbkandidater hade en signifikant preferens för att använda formella kommunikationsmetoder, och visade sig känna sig mindre osäkra när de använde formella kommunikationsmetoder än när de använde informella metoder. Slutligen upptäckte jag att yngre användare inte visade sig föredra informella kommunikationsmetoder mer än äldre användare.
Babot, Pagès Francesc Xavier. "Contributions to Formal Communication Elimination for System Models with Explicit Parallelism." Doctoral thesis, Universitat Ramon Llull, 2009. http://hdl.handle.net/10803/9161.
Full textL'enfocament de la verificació automàtica treballa sobre el sistema de transicions del model, el qual defineix la seva semàntica. Aquest sistema de transicions té sovint molts estats, i sempre una mida gran comparada amb la mida del model del sistema, el qual és sempre infinit. Aquestes consideracions suggereixen un enfocament de verificació estàtica com els d'aquesta tesi, evitant els sistemes de transicions, treballant directament sobre el model del sistema, en principi, la complexitat computacional hauria de ser menor. L'enfocament estàtic d'aquest treball es fa sobre models de sistemes expressats en notació imperativa amb paral·lelisme explícit, sentències de comunicacions síncrones i variables d'emmagatzematge locals.
Els raonaments d'equivalència són molt empleats per números, matrius i altres camps. Tanmateix, per programes imperatius amb paral·lelisme, comunicacions i variables, encara que potencialment sigui un mètode de verificació molt intuïtiu, no han estat massa explorats. La seqüencialització formal via l'eliminació de comunicacions internes, l'àrea d'aquesta tesi, és una demostració basada en el raonament estàtic d'equivalències que, donat que disminueix la magnitud del vector d'estats, pot complementar altres mètodes de demostració. Es basa en l'aplicació d'un conjunt de lleis , apropiades per tal propòsit, com reduccions de reescriptura del model del sistema. Aquestes depenen de la noció d'equivalència i de les suposicions de justícia.
Aquesta tesi contribueix a la quasi inexplorada àrea de l'eliminació de comunicacions formal i seqüencialització de models de sistema. Les lleis estan definides sobre una equivalència feble: equivalència d'interfície. L'eliminació de comunicacions est-a limitada a models sense seleccions, per exemple models en els quals les comunicacions internes no estan dins de l'àmbit de sentències de selecció. Aplicacions interessants existeixen dins d'aquest marc. Les lleis són vàlides només per justícia feble o sense justícia. Aquesta ha estat desenvolupada seguint la semàntica proposada per Manna i Pnueli per a sistemes reactius [MP91, MP95]. S'han formulat les condicions d'aplicabilitat per les lleis de la pròpia eliminació de comunicacions. A més a més, es proposa un procediment de construcció de demostracions per l'eliminació de comunicacions, el qual intenta aplicar automàticament les lleis de la eliminació. També s'ha dissenyat un conjunt de procediments de transformació, els quals garanteixen que la transformació equivalent sempre correspon a l'aplicació d'una seqüència de lleis. Degut a que la construcció de les demostracions és impracticable, normalment impossible, sense l'ajuda d'una eina, s'ha desenvolupat un demostrador interactiu per la construcció semiautomàtica de la seqüencialització de models de sistemes i demostracions d'eliminació. Tant els procediments de transformació com els de l'eliminació de comunicacions estan integrats en l'eina. Amb l'ajuda del demostrador s'ha construït la demostració de seqüencialització d'un model, no trivial, de processador pipeline. Per aquest exemple s'ha assolit una reducció, respecte del model original, de la cota superior del nombre d'estats de 2−672.
Malgrat l'enorme quantitat d'esforç dedicat a l'àrea, abans i durant la tesi, encara queda molt treball per a que l'eliminació de comunicacions i la seqüencialització sigui realment un mètode pràctic. No obstant els resultats d'aquesta tesi han establert els fonaments i han donat l'estímul necessari per continuar l'esforç.
Los métodos de verificación formal se están usando cada vez más en la industria para establecer la corrección y encontrar los errores en modelos de sistemas; por ejemplo, la descripción de hardware, protocolos, programas distribuidos, etc. En particular, los verificadores de modelos lo hacen automáticamente para sistemas de estados finitos, pero están limitados debido al problema de la explosión de estados; y la verificación formal interactiva, el área de esta tesis, es necesaria.
El enfoque de la verificación automática trabaja sobre el sistema de transiciones del modelo, el cual define su semántica. Este sistema de transiciones tiene a menudo muchos estados, y siempre un tamaño grande comparado con el tamaño del modelo del sistema, el cual es siempre infinito. Estas consideraciones sugieren un enfoque de verificación estática como los de esta tesis, evitando los sistemas de transiciones, trabajando directamente sobre el modelo del sistema, en principio, la complejidad computacional tendría que ser menor. El enfoque estático de este trabajo se lleva a cabo sobre modelos de sistemas expresados en notación imperativa con paralelismo explícito, sentencias de comunicaciones síncronas y variables de almacenamiento locales.
Los razonamientos de equivalencia son muy empleados para números, matrices y otros campos. Sin embargo, para programas imperativos con paralelismo, comunicaciones y variables, aún teniendo la potencialidad de ser un método de verificación muy intuitivo, no han sido muy explorados. La secuencialización formal vía la eliminación de comunicaciones internas, el área de esta tesis, es una demostración basada en el razonamiento estático de equivalencias que, ya que disminuye la magnitud del vector de estados, puede complementar otros métodos de demostración. Se basa en la aplicación de un conjunto de leyes, apropiadas para tal propósito, como reducciones de reescritura del modelo del sistema. Éstas dependen de la noción de equivalencia y de las suposiciones de justicia.
Esta tesis contribuye a la casi inexplorada área de la eliminación de comunicaciones formal y secuencialización de modelos de sistema. Las leyes están definidas sobre una equivalencia débil: equivalencia de interfaz. La eliminación de comunicaciones está limitada a modelos sin selecciones, por ejemplo modelos en los cuales las comunicaciones internas no están dentro del ámbito de sentencias de selección. Aplicaciones interesantes existen dentro de este marco. Las leyes son válidas sólo para justicia débil o sin justicia. Ésta ha sido desarrollada siguiendo la semántica propuesta por Manna y Pnueli para sistemas reactivos [MP91, MP95]. Se han formulado las condiciones de aplicabilidad para las leyes de la propia eliminación de comunicaciones. Además, se propone un procedimiento de construcción de demostraciones para la eliminación de comunicaciones, el cual intenta aplicar automáticamente las leyes de la eliminación. También se ha diseñado un conjunto de procedimientos de transformación, los cuales garantizan que la transformación equivalente siempre corresponde a la aplicación de una secuencia de leyes. Debido a que la construcción de las demostraciones es impracticable, normalmente imposible, sin la ayuda de una herramienta, se ha desarrollado un demostrador interactivo para la construcción semiautomática de la secuencialización de modelos de sistemas y demostraciones de eliminación. Tanto los procedimientos de transformación como los de la eliminación de comunicaciones están integrados en la herramienta. Con la ayuda del demostrador se ha construido la demostración de secuencialización de un modelo, no trivial, de procesador pipeline. Para este ejemplo se ha logrado una reducción, respecto del modelo original, de la cota superior del número de estados de 2−672.
A pesar de la enorme cantidad de esfuerzo dedicado al área, antes y durante esta tesis, todavía queda mucho trabajo para que la eliminación de comunicaciones y la secuencialización sea realmente un método práctico. Sin embargo los resultados de esta tesis han establecido los cimientos y han dado el estímulo necesario para continuar el esfuerzo.
Formal verification methods are increasingly being used in industry to establish the correctness of, and to find the flaws in, system models; for instance, descriptions of hardware, protocols, distributed programs, etc. In particular, model checking does that automatically for finite-state systems, but it is limited in scope due to the state explosion problem; and interactive formal verification, the broad area of this thesis, is needed.
Automatic verification approaches work on the transition system of the model, which defines its semantics. This transition system has often infinitely many states, and always a large size compared to the size of the system model, which is always finite. These considerations suggest that static verification approaches such as those of this thesis, avoiding the transition system, working directly on the system model would have less computational complexity, in principle. The static approach of this work is carried out on system models expressed in imperative notations with explicit parallelism and synchronous communication statements, and with local storage variables.
Equivalence reasoning is heavily used for numbers, matrices, and other fields. However, for imperative programs with parallelism, communications, and variables, although having the potentiality of being a very intuitive verification method, it has not been much explored. Formal sequentialization via internal communication elimination, the area of this thesis, is a static equivalence reasoning proof that, since it decreases the size of the state vector, could complement other proof methods. It is based on the application of a set of laws, suitable for that purpose, as rewriting reductions to a system model. These proofs need both proper communication elimination laws and auxiliary basic laws. These depend on the notion of equivalence and on the fairness assumptions.
This thesis contributes to the almost unexplored area of formal communication elimination and system model sequentialization. The laws are defined over a weak equivalence: interface equivalence. Communication elimination is confined to selection-free models, i.e. models none of whose inner communications are within the scope of selection statements. Interesting applications already exist within this framework. The laws are valid only with weak fairness or no fairness. It has been developed following the same semantics as Manna and Pnueli for reactive systems [MP91, MP95]. Applicability conditions for the proper communication elimination laws are derived. In addition, a communication elimination proof construction procedure, which attempts to apply the elimination laws automatically is proposed. A set of transformation procedures, guaranteeing that the equivalence transformation always corresponds to the application of a sequence of laws have been designed as well. Since the construction of elimination proofs is impractical, even impossible, without a tool, an interactive prover for semi-automatic construction of system model sequentialization and elimination proofs has been developed. Both transformation and communication elimination procedures are integrated within the tool. As a non-trivial example, a sequentialization proof of a pipelined processor model, has been constructed with the help of the prover. A
reduction, with respect to the original model, of 2−672 on the upper bound on the number of states has been achieved in this example.
In spite of the huge amount of effort already devoted to the area, before and during this thesis, much work still needs to be done until communication elimination and sequentialization become a practical method. Nevertheless the results of this thesis have established its foundations and given the necessary encouragement for continuing the effort.
Books on the topic "Formal communication"
Design as aesthetic communication: Structuring random-order, deconstruction of formal rationality. New York: P. Lang, 1989.
Find full textGhoshal, Sumantra. Interunit communication within MNCs: The influence of formal structure versus integrative processes. Fontainebleau: INSEAD, 1991.
Find full textFontana, Andrea. The interview: From formal to postmodern. Walnut Creek, CA: Left Coast Press, 2006.
Find full textH, Prokos Anastasia, ed. The interview: From formal to postmodern. Walnut Creek, CA: Left Coast Press, 2007.
Find full textMoore, J. Strother. A formal model of asynchronous communication and its use in mechanically verifying a biphase mark protocol. Hampton, Va: Langley Research Center, 1992.
Find full textMarco, Bernardo, Padovani Luca, and Zavattaro Gianluigi, eds. Formal methods for web services: 9th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2009, Bertinoro, Italy, June 1-6, 2009 ; advanced lectures. Berlin: Springer, 2009.
Find full textBilingual community education and multilingualism: Beyond heritage languages in a global city. Bristol: Multilingual Matters, 2012.
Find full textInternational School on Formal Methods for the Design of Computer, Communication, and Software Systems (10th 2010 Bertinoro, Italy). Formal methods for quantitative aspects of programming languages: 10th international school on formal methods for the design of computer, communication and software systems, SFM 2010, Bertinoro, Italy, June 21-26, 2010 : advanced lectures. Berlin: Springer, 2010.
Find full textInternational School on Formal Methods for the Design of Computer, Communication, and Software Systems (6th 2006 Bertinoro, Italy). Formal methods for hardware verification: 6th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2006, Bertinoro, Italy, May 22-27, 2006 : advanced lectures. Berlin: Springer, 2006.
Find full textBook chapters on the topic "Formal communication"
Andrews, Deborah C., and Jason C. K. Tham. "Formal Reports." In Designing Technical and Professional Communication, 267–88. New York: Routledge, 2021. http://dx.doi.org/10.4324/9781003093763-20.
Full textPopescu, Daniel. "Parallel communicating grammar systems with communication by signals." In New Trends in Formal Languages, 267–77. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62844-4_19.
Full textLai, Richard, and Ajin Jirachiefpattana. "Formal Description Techniques." In Communication Protocol Specification and Verification, 27–37. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5549-0_2.
Full textChan, Mable. "Formal business reports/proposals." In English for Business Communication, 116–40. London ; New York : Taylor and Francis, 2020. | Series: Routledge applied English language introductions: Routledge, 2020. http://dx.doi.org/10.4324/9781351060035-7.
Full textSmith, M. A. S. "Formal Verification of Communication Protocols." In Formal Description Techniques IX, 129–44. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-0-387-35079-0_8.
Full textMo, Dapeng, Xiaobing Wang, and Zhenhua Duan. "Asynchronous Communication in MSVL." In Formal Methods and Software Engineering, 82–97. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24559-6_8.
Full textHorn, Raymond A. "Post-Formal Conversation." In Dialogue as a Means of Collective Communication, 291–321. Boston, MA: Springer US, 2005. http://dx.doi.org/10.1007/0-306-48690-3_14.
Full textJonkers, H. B. M. "Communication and synchronisation using interaction objects." In FM’99 — Formal Methods, 1321–42. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48118-4_20.
Full textFenstad, J. E. "Formal Semantics, Geometry, and Mind." In Discourse, Interaction and Communication, 85–103. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-015-8994-9_5.
Full textLienhardt, Michael, Claudio Antares Mezzina, Alan Schmitt, and Jean-Bernard Stefani. "Typing Component-Based Communication Systems." In Formal Techniques for Distributed Systems, 167–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02138-1_11.
Full textConference papers on the topic "Formal communication"
Stenning, Keith, and Corin Gurr. "Formal Methods and Human Communication." In Proceedings of the BCS-FACS Workshop on Formal Aspects of the Human Computer Interface. BCS Learning & Development, 1996. http://dx.doi.org/10.14236/ewic/fac1996.14.
Full textGburzynski, P., and P. Rudnicki. "On formal modeling of communication channels." In IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 1989. http://dx.doi.org/10.1109/infcom.1989.101447.
Full textHu, Yayun, and Dongfang Li. "Formal Verification Technology for Asynchronous Communication Protocol." In 2019 IEEE 19th International Conference on Software Quality, Reliability and Security Companion (QRS-C). IEEE, 2019. http://dx.doi.org/10.1109/qrs-c.2019.00092.
Full textLi, L. "A formal specification technique for communication protocol." In IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 1989. http://dx.doi.org/10.1109/infcom.1989.101436.
Full textJuan Roig, Pedro, Salvador Alcaraz, Katja Gilly, and Carlos Juiz. "OSPF Algebraic Formal Modelling using ACP - A Formal Description on OSPF Routing Protocol." In International Conference on Data Communication Networking. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006838700550066.
Full textJuan Roig, Pedro, Salvador Alcaraz, Katja Gilly, and Carlos Juiz. "OSPF Algebraic Formal Modelling using ACP - A Formal Description on OSPF Routing Protocol." In International Conference on Data Communication Networking. SCITEPRESS - Science and Technology Publications, 2018. http://dx.doi.org/10.5220/0006838702210232.
Full textBhuria, Indu, Pawan Inaniya, and Pramod Kaler. "Testing and Formal Verification of Decoder Circuit." In Communication Technologies (ACCT). IEEE, 2012. http://dx.doi.org/10.1109/acct.2012.111.
Full textXie, Guo, Akira Asano, Xinhong Hei, Hiroshi Mochizuki, Sei Takahashi, and Hideo Nakamura. "Formal verification of Communication based Train Control system." In 2011 International Conference on Quality, Reliability, Risk, Maintenance, and Safety Engineering (ICQR2MSE). IEEE, 2011. http://dx.doi.org/10.1109/icqr2mse.2011.5976639.
Full textKamali, Maryam, Luigia Petre, Kaisa Sere, and Masoud Daneshtalab. "CorreComm: A formal hierarchical framework for communication designs." In 2011 IEEE 2nd International Conference on Networked Embedded Systems for Enterprise Applications (NESEA). IEEE, 2011. http://dx.doi.org/10.1109/nesea.2011.6144950.
Full textCheng, Bo, Xiangtao Lin, Xiaoxiao Hu, and Junliang Chen. "Formal Analysis for Multimedia Conferencing Communication Services Orchestration." In 2009 IEEE International Conference on Web Services (ICWS). IEEE, 2009. http://dx.doi.org/10.1109/icws.2009.148.
Full textReports on the topic "Formal communication"
Amer, Paul D. Formal Design of Communication Protocols Using Estelle. Fort Belvoir, VA: Defense Technical Information Center, October 1994. http://dx.doi.org/10.21236/ada290584.
Full textAmer, Paul D. Formal Design of Communication Protocols Based on The Estelle ISO Formal Description Technique. Fort Belvoir, VA: Defense Technical Information Center, October 1999. http://dx.doi.org/10.21236/ada370116.
Full textBelta, Calin. Formal Synthesis of Control and Communication Strategies for Teams of Unmanned Vehicles. Fort Belvoir, VA: Defense Technical Information Center, April 2012. http://dx.doi.org/10.21236/ada567708.
Full textLaFlamme, Marcel. Affiliation in Transition: Rethinking Society Membership with Early-Career Researchers in the Social Sciences. Association of Research Libraries, October 2020. http://dx.doi.org/10.29242/report.affiliationintransition2020.
Full textPerdigão, Rui A. P. New Horizons of Predictability in Complex Dynamical Systems: From Fundamental Physics to Climate and Society. Meteoceanics, October 2021. http://dx.doi.org/10.46337/211021.
Full textAguilar, L. Format for a graphical communication protocol. RFC Editor, December 1985. http://dx.doi.org/10.17487/rfc0965.
Full textLam, Terence, and Keith Gale. Construction frameworks in the public sector: Do they deliver what they promise? Property Research Trust, November 2021. http://dx.doi.org/10.52915/sbuk7331.
Full textChisholm, G. H., and R. A. Kemmerer. A two-level formal specification of a defense communications system. Office of Scientific and Technical Information (OSTI), April 1994. http://dx.doi.org/10.2172/10155353.
Full textButyrina, Maria, and Valentina Ryvlina. MEDIATIZATION OF ART: VIRTUAL MUSEUM AS MASS MEDIA. Ivan Franko National University of Lviv, February 2021. http://dx.doi.org/10.30970/vjo.2021.49.11075.
Full textBeiker, Sven, ed. Unsettled Issues Regarding Visual Communication Between Automated Vehicles and Other Road Users. SAE International, July 2021. http://dx.doi.org/10.4271/epr2021016.
Full text