Automata based verification over linearly ordered data domains

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 81-92

  Segoufin, Luc ^a   Toruńczyk, Szymon ^b  

^a INRIA   (France)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

Data values; Linear order; Register automata

Indexed keywords

A TRANSITIONS; AUTOMATA MODELS; CURRENT CONFIGURATION; DATA VALUES; LINEAR ORDER; NONDETERMINISTIC AUTOMATA; REGISTER AUTOMATA; WORKFLOW SPECIFICATION;

COMPUTER SCIENCE;

AUTOMATA THEORY;

EID: 84880277875     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.81     Document Type: Conference Paper

References (14)

1. R. Alur, P. Cerný, and S. Weinstein. Algorithmic analysis of array-accessing programs. In Computer Science Logic (CSL), pages 86-101, 2009.
2. M. Bojańczyk and T. Colcombet. Bounds In ω-regularity. In Logic In Computer Science (LICS), pages 285-296, 2006.
3. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In Logic In Computer Science (LICS), pages 7-16, 2006.
4. A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu. Rewriting systems with data. In Fundamentals of Computation Theory (FCT), pages 1-22, 2007.
5. A. Bouajjani, Y. Jurski, and M. Sighireanu. A generic framework for reasoning about dynamic networks of infinite-state processes. In TACAS'07, 2007.
6. P. Bouyer, A. Petit, and D. Thérien. An algebraic approach to data languages and timed languages. Information and Computation, 182(2), 2003.
7. K. Čer̄ans. Deciding properties of integral relational automata. In ICALP, pages 35-46, 1994.
8. S. Demri. Linear-time temporal logics with Presburger constraints: An overview. J. of Applied Non-Classical Logics, 16(3-4):311-347, 2006.
9. S. Demri and R. Gascon. The effects of bounding syntactic resources on Presburger LTL. Journal of Logic and Computation, 19(6):1541-1575, 2009.
10. S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log., 10(3), 2009.
11. A. Deutsch, R. Hull, F. Patrizi, and V. Vianu. Automatic verification of data-centric business processes. In Intl. Conf. on Database Theory (ICDT), pages 252-267, 2009.
12. X. Du, C. R. Ramakrishnan, and S. A. Smolka. Region graphs for infinite-state systems. unpublished manuscript, 2007.
13. D. Figueira, P. Hofman, and S. Lasota. Relating timed and register automata. In Intl. Workshop on Expressiveness In Concurrency (EXPRESS'10), 2010.
14. M. Kaminski and N. Francez. Finite memory automata. Theor. Comp. Sci., 134(2):329-363, 1994.