Abstract
Projection Temporal Logic (PTL) is a sound formalism for specifying and verifying properties of concurrent systems. The modeling, simulation and verification language MSVL for concurrent systems is an executable subset of PTL. However, asynchronous communication, a key component of modeling distributed system, has not been implemented in MSVL. This paper presents asynchronous communication techniques for MSVL to improve its capability for modeling and verifying distributed systems. First, a process structure is defined; then a channel structure and two pairs of communication commands are formalized; finally, an example of asynchronous communication for the contract signing protocol is demonstrated.
This research is supported by the National Program on Key Basic Research Project of China (973 Program) Grant No.2010CB328102, National Natural Science Foundation of China under Grant Nos. 60910004, 60873018, 91018010, 61003078 and 61003079, SRFDP Grant 200807010012, and ISN Lab Grant No. 201102001,Fundamental Research Funds for the Central Universities Grant No. JY10000903004.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Pnueli, A.: The temporal semantics of concurrent programs. In: Proceedings of the 18th IEEE Symposium Foundations of Computer Science, pp. 46–67 (1997)
Karp, Alan, R.: Proving failure-free properties of concurrent systems using temporal logic. ACM Trans. Program. Lang. Syst. 6, 239–253 (1984)
Cau, A., Moszkowski, B., Zedan, H.: Itl and tempura home page on the web, http://www.cse.dmu.ac.uk/STRL/ITL/
Tian, C., Duan, Z.: Propositional projection temporal logic, buchi automata and ω-regular expressions. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 47–58. Springer, Heidelberg (2008)
Duan, Z., Tian, C.: A unified model checking approach with projection temporal logic. In: Liu, S., Araki, K. (eds.) ICFEM 2008. LNCS, vol. 5256, pp. 167–186. Springer, Heidelberg (2008)
Solanki, M., Cau, A., Zedan, H.: Asdl: A wide spectrum language for designing web services. In: WWW, pp. 687–696 (2006)
Tang, Z.: Temporal Logic Program Designing and Engineering, vol. 1. Sicence Press, Beijing (1999)
Hale, R.: Programming in Temporal Logic. Cambridge University, Cambridge (1988)
Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)
Hoare, C.A.R.: Communicating sequential processes (August 1978)
Duan, Z., Koutny, M.: A framed temporal logic programming language. Journal Computer Science and Technology 19(3), 341–351 (2004)
Duan, Z., Yang, X., Koutny, M.: Framed temporal logic programming. Science of Computer Programming 70, 31–61 (2008)
Duan, Z., Wang, X.: Implementing pointer in temporal logic programming languages. In: Proceedings of Brazilian Symposium on Formal Methods, Natal, Brazil, pp. 171–184 (2006)
Baum-waidner, B., Waidner, M.: Optimistic asynchronous multi-party contract signing (1998)
Pagnia, H., Gartner, F.C.: On the impossibility of fair exchange without a trusted third party. Darmstadt University of Technology, Tech. Rep. Technical Report: TUD-BS-1999-02 (1999)
Asokan, N., Baum-waidner, B., Schunter, M., Waidner, M.: Optimistic synchronous multi-party contract signing (1998)
Baum-Waidner.: Optimistic asynchronous multi-party contract signing with reduced number of rounds (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mo, D., Wang, X., Duan, Z. (2011). Asynchronous Communication in MSVL. In: Qin, S., Qiu, Z. (eds) Formal Methods and Software Engineering. ICFEM 2011. Lecture Notes in Computer Science, vol 6991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24559-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-24559-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24558-9
Online ISBN: 978-3-642-24559-6
eBook Packages: Computer ScienceComputer Science (R0)