Proving Failure-Free Properties of Concurrent Systems Using Temporal Logic
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
The Temporal Semantics of Concurrent Programs
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
A framed temporal logic programming language
Journal of Computer Science and Technology
ASDL: a wide spectrum language for designing web services
Proceedings of the 15th international conference on World Wide Web
Framed temporal logic programming
Science of Computer Programming
A Unified Model Checking Approach with Projection Temporal Logic
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Hi-index | 0.00 |
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.