Parosh Aziz Abdulla
ABSTRACT
We extend the classical model of lossy channel systems by considering systems that operate on a finite set of variables ranging over an infinite data domain. Furthermore, each message inside a channel is equipped with a data item representing its value. Although we restrict the model by allowing the variables to be only tested for (dis-)equality, we show that the state reachability problem is undecidable. In light of this negative result, we consider bounded-phase reachability, where the processes are restricted to performing either send or receive operations during each phase. We show decidability of state reachability in this case by computing a symbolic encoding of the set of system configurations that are reachable from a given configuration.
- P. A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Inf. Comput., 127(2):91--101, 1996.Google Scholar
Cross Ref
- P. A. Abdulla, M. F. Atig, and J. Cederberg. Timed lossy channel systems. In Proc. FSTTCS '12, 32nd Conf. on Foundations of Software Technology and Theoretical Computer Science, 2012.Google Scholar
- P. A. Abdulla, M. F. Atig, and J. Stenman. Dense-timed pushdown automata. In LICS. IEEE Computer Society, 2012. Google ScholarDigital Library
- P. A. Abdulla, M. F. Atig, and J. Cederberg. Analysis of message passing programs using SMT-solvers. In ATVA 2013, volume 8172 of LNCS, pages 272--286, 2013.Google Scholar
- P. A. Abdulla, M. F. Atig, G. Delzanno, and A. Podelski. Push-down automata with gap-order constraints. In FSEN 2013, volume 8161 of LNCS, pages 199--216, 2013.Google ScholarCross Ref
- P. A. Abdulla, M. F. Atig, A. Kara, and O. Rezine. Verification of dynamic register automata. In FSTTCS, volume 29 of LIPIcs, pages 653--665. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014.Google Scholar
- C. Aiswarya, P. Gastin, and K. Narayan Kumar. Controllers for the verification of communicating multi-pushdown systems. In CONCUR, volume 8704 of LNCS, pages 297--311, 2014.Google Scholar
- S. Akshay, B. Bollig, and P. Gastin. Automata and logics for timed message sequence charts. In FSTTCS 2007, volume 4855 of LNCS, pages 290--302. Springer, 2007. Google ScholarDigital Library
- M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data words. ACM Trans. Comput. Log., 12(4):27, 2011. Google ScholarDigital Library
- B. Bollig and L. Hélouët. Realizability of dynamic MSC languages. In CSR'10, volume 6072 of LNCS, pages 48--59, Kazan, Russia, 2010. Springer. Google ScholarDigital Library
- B. Bollig, A. Cyriac, P. Gastin, and K. Narayan Kumar. Model checking languages of data words. In FoSSaCS'12, volume 7213 of LNCS, pages 391--405. Springer, Mar. 2012. Google ScholarDigital Library
- B. Bollig, A. Cyriac, L. Hélouët, A. Kara, and Th. Schwentick. Dynamic communicating automata and branching high-level MSCs. In (LATA'13), volume 7810 of LNCS, pages 177--189, Bilbao, Spain, 2013. Springer.Google Scholar
- A. Bouajjani and M. Emmi. Bounded phase analysis of message-passing programs. In TACAS, volume 7214 of LNCS, pages 451--465, 2012. Google ScholarDigital Library
- A. Bouajjani, R. Echahed, and R. Robbana. On the automatic verification of systems with continuous variables and unbounded discrete data structures. In Hybrid Systems II, volume 999 of LNCS, pages 64--85. Springer, 1994. Google ScholarDigital Library
- L. Clemente and S. Lasota. Timed pushdown automata revisited. In LICS 2015, pages 738--749. IEEE, 2015. Google ScholarDigital Library
- L. Clemente, F. Herbreteau, A. Stainer, and G. Sutre. Reachability of communicating timed processes. In FOSSACS 2013, volume 7794 of LNCS, pages 81--96. Springer, 2013. Google ScholarDigital Library
- S. Demri and R. Lazić. Ltl with the freeze quantifier and register automata. ACM Trans. Comput. Logic, 10(3):16:1--16:30, 2009. Google ScholarDigital Library
- A. Finkel. Decidability of the termination problem for completely specified protocols. Distributed Computing, 7(3):129--135, 1994. ISSN 0178-2770. Google ScholarDigital Library
- A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, Apr. 2001. Google ScholarDigital Library
- O. Grumberg, O. Kupferman, and S. Sheinvald. Variable automata over infinite alphabets. In LATA, volume 6031 of LNCS, pages 561--572, 2010. Google ScholarDigital Library
- M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329--363, 1994. Google ScholarDigital Library
- P. Krcál and W. Yi. Communicating timed automata: The more synchronous, the more difficult to verify. In CAV, volume 4144 of Lecture Notes in Computer Science, pages 249--262. Springer, 2006. Google ScholarDigital Library
- S. La Torre, P. Madhusudan, and G. Parlato. Context-bounded analysis of concurrent queue systems. In TACAS, volume 4963 of LNCS, pages 299--314. Springer, 2008. Google ScholarDigital Library
- R. Lazic, T. Newcomb, J. Ouaknine, A. W. Roscoe, and J. Worrell. Nets with tokens which carry data. Fundam. Inform., 88(3):251--274, 2008. Google ScholarDigital Library
- M. Musuvathi and S. Qadeer. Iterative context bounding for systematic testing of multithreaded programs. In PLDI, pages 446--455. ACM, 2007. Google ScholarDigital Library
- F. Neven, T. Schwentick, and V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic, 5(3):403--435, July 2004. ISSN 1529-3785. Google ScholarDigital Library
- S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, volume 3440 of LNCS, pages 93--107. Springer, 2005. Google ScholarDigital Library
- F. Rosa-Velardo and D. de Frutos-Escrig. Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci., 412(34):4439--4451, 2011.Google ScholarCross Ref
- N. Tzevelekos. Fresh-register automata. SIGPLAN Not., 46(1):295--306, Jan. 2011. Google ScholarDigital Library
Index Terms
- Data Communicating Processes with Unreliable Channels
Recommendations
On two-way FA with monotonic counters and quadratic Diophantine equations
We show an interesting connection between two-way deterministic finite automata with monotonic counters and quadratic Diophantine equations. The automaton M operates on inputs of the form a1i1...anin for some fixed n and distinct symbols a1,...,an, ...
Automata and processes on multisets of communicating objects
Inspired by P systems initiated by Gheorghe Pãun, we study a computation model over a multiset of communicating objects. The objects in our model are instances of finite automata. They interact with each other by firing external transitions between two ...
Non-regular unary language and parallel communicating WatsonCrick automata systems
In 2006, Czeizler et al. introduced parallel communicating WatsonCrick automata system. They showed that parallel communicating WatsonCrick automata system can accept the non-regular unary language L={an2,wheren>1} using non-injective complementarity ...
Comments