Arpit
ABSTRACT
Probabilistic reversible distributed systems are widely used now days. The best instance of such a system is communication protocol, which is based on the probes to carry out the communication in distributed environment. One of examples of such a protocol is Zero Conf protocol, which assigns unused link-local IPv4 addresses to the requesting nodes. Distributed systems are quite complex with respect to communications with its sub-systems. Moreover, when distributed computation is carried out in probabilistic environment further enhancement in complexity. When such a probabilistic distributed system implements fault tolerant strategy then one more dimension of complexity get added. Therefore, to ensure the correctness of such a complex system, rigorous verification and analysis are required. The objective of this paper is to present a framework named as Calculus of concurrent probabilistic reversible processes (CCPRP) in order to formally define probabilistic reversible distributed system and to carry out its verification. Moreover, CCPRP has been used to model Zero Conf protocol.
- Arpit, Afza Shafie, and Wan Fatimah Wan Ahmad. 2014. Automata for Modeling the Distributed Probabilistic Reversible Processes. Springer International Publishing, Cham, 122--136. https://doi.org/10.1007/978-3-319-04126-1_11 Google Scholar
Digital Library
- Arpit, A'fza Binti Shafie, and Wan Fatimah Binti Wan Ahmad. 2012. An introduction on extensions of process algebra: Concurrent and communicating systems. In Computer Information Science (ICCIS), 2012 International Conference on, Vol. 2. 857--862. https://doi.org/10.1109/ICCISci.2012.6297146 Google ScholarCross Ref
- Marco Bernardo and Paola Inverardi. 2003. Formal Methods for Software Architectures: Third International School on Formal Methods for the Design of Computer, Communication, and Software Systems--Software Architectures, Sfm 2003 (Lecture Notes in Computer Science, 2804). SpringerVerlag. Google ScholarCross Ref
- Patrice Marcel Andre Bremond-Gregoire. 1994. A Process Algebra of Communicating Shared Resources with Dense Time and Priorities. Ph.D. Dissertation. Philadelphia, PA, USA. UMI Order No. GAX94-27507.Google Scholar
- Vincent Danos, Jean Krivine, and PawełSobociński. 2007. General Reversibility. Electron. Notes Theor. Comput. Sci. 175, 3 (June 2007), 75--86. https://doi.org/10.1016/j.entcs.2006.07.036 Google ScholarDigital Library
- Oltea Mihaela Herescu and Catuscia Palamidessi. 2001. On the Generalized Dining Philosophers Problem. In Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing (PODC '01). ACM, New York, NY, USA, 81--89. https://doi.org/10.1145/383962.383994 Google ScholarDigital Library
- C. A. R. Hoare. 1981. Communicating Sequential Processes. Commun. ACM 21, 8 (Aug. 1981), 666--677. https://doi.org/10.1145/359576.359585 Google ScholarDigital Library
- Steve Hostettler, Alexis Marechal, Alban Linard, Matteo Risoldi, and Didier Buchs. 2011. High-Level Petri Net Model Checking with AlPiNA. Fundam. Inf. 113, 3--4 (Aug. 2011), 229--264. http://dl.acm.org/citation.cfm?id=2362136.2362139Google ScholarCross Ref
- Johannes Hlzl and Tobias Nipkow. 2012. Interactive Verification of Markov Chains: Two Distributed Protocol Case Studies. In Quantities in Formal Methods (QFM 2012) (EPTCS), U. Fahrenberg, A. Legay, and C. Thrane (Eds.), Vol. 103. arXiv:1212.3870, 17--31. https://doi.org/10.4204/EPTCS.103.2 Google ScholarCross Ref
- R. Milner. 2005. A Calculus of Communicating Systems. Springer-Verlag New York, Inc., Secaucus, NJ, USA.Google Scholar
- Napat Prapakorn and Suphamit Chittayasothorn. 2009. An RDF-based Distributed Expert System. W. Trans. on Comp. 8, 5 (May 2009), 788--798. http://dl.acm.org/citation.cfm?id=1558772.1558777Google Scholar
- Ana Sokolova and Erik P. de Vink. 2004. Probabilistic Automata: System Types, Parallel Composition and Comparison. Springer Berlin Heidelberg, Berlin, Heidelberg, 1--43. https://doi.org/10.1007/978-3-540-24611-41Google Scholar
Recommendations
Verifying concurrent probabilistic systems using probabilistic-epistemic logic specifications
In this paper, we address the problem of verifying probabilistic and epistemic properties in concurrent probabilistic systems expressed in PCTLK. PCTLK is an extension of the Probabilistic Computation Tree Logic (PCTL) augmented with Knowledge (K). In ...
Efficient Verification of Sequential and Concurrent C Programs
There has been considerable progress in the domain of software verification over the last few years. This advancement has been driven, to a large extent, by the emergence of powerful yet automated abstraction techniques such as predicate abstraction. ...
A more accurate semantics for distributed erlang
ERLANG '07: Proceedings of the 2007 SIGPLAN workshop on ERLANG WorkshopIn order to formally reason about distributed Erlang systems, it is necessary to have a formal semantics. In a previous paper we have proposed such a semantics for distributed Erlang. However, recent work with a model checker for Erlang revealed that ...
Comments