Knowledge-Based Distributed Conflict Resolution for Multiparty Interactions and Priorities

Distributed decentralized implementation of systems of communicating processes raises non-trivial problems. Correct execution of multiparty interactions, subject to priority rules, requires sophisticated mechanisms for runtime conflict detection and resolution. We propose a method for detection of false conflicts which combines partial observation of the system's state and apriori knowledge extracted from invariants. We propose heuristics for determining optimal sets of observations leading to implementations with particular guarantees. We provide preliminary experimental results on an implementation of the method in the BIP framework.

[1]  Grzegorz Rozenberg Advances in Petri Nets 1987 , 1986, Lecture Notes in Computer Science.

[2]  Joseph Sifakis,et al.  A framework for automated distributed implementation of component-based models , 2012, Distributed Computing.

[3]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[4]  Sophie Quinton,et al.  Building Distributed Controllers for Systems with Priorities , 2011, J. Log. Algebraic Methods Program..

[5]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[6]  Rajive L. Bagrodia,et al.  Process Synchronization: Design and Performance Evaluation of Distributed Algorithms , 1989, IEEE Trans. Software Eng..

[7]  D. Kumar An implementation of N-party synchronization using tokens , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[8]  Yuh-Jzer Joung,et al.  Strong interaction fairness via randomization , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[9]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[10]  Borzoo Bonakdarpour,et al.  Automated distributed implementation of component-based models with priorities , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[11]  S. Laurie Ricker,et al.  Know means no: Incorporating knowledge into discrete-event control systems , 2000, IEEE Trans. Autom. Control..

[12]  Joseph Sifakis,et al.  Compositional verification for component-based systems and application , 2010, IET Softw..

[13]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[14]  José Antonio Pérez,et al.  An order‐based algorithm for implementing multiparty synchronization , 2004, Concurr. Pract. Exp..

[15]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[16]  Joseph Sifakis,et al.  Incremental component-based construction and verification using invariants , 2010, Formal Methods in Computer Aided Design.

[17]  Frank S. de Boer,et al.  Formal Methods for Components and Objects , 2012, Lecture Notes in Computer Science.

[18]  Joseph Sifakis,et al.  From high-level component-based models to distributed implementations , 2010, EMSOFT '10.

[19]  Joseph Sifakis,et al.  Modeling Heterogeneous Real-time Components in BIP , 2006, Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06).

[20]  Joseph Sifakis,et al.  D-Finder: A Tool for Compositional Deadlock Detection and Verification , 2009, CAV.

[21]  Fritz Krückeberg,et al.  Mathematical methods for calculating invariants in Petri nets , 1986, European Workshop on Applications and Theory of Petri Nets.

[22]  Ronald Fagin,et al.  Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.

[23]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[25]  Doron A. Peled,et al.  Methods for Knowledge Based Controlling of Distributed Systems , 2010, ATVA.

[26]  Joseph Sifakis,et al.  Priority Systems , 2003, FMCO.