About the decision of reachability for register machines
RAIRO-Theor. Inf. Appl., 36 4 (2002) 341-358
Published online: 2003-02-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Porous invariants for linear systems
Engel Lefaucheux, Joël Ouaknine, David Purser and James WorrellFormal Methods in System Design 63 (1-3) 235 (2024)
https://doi.org/10.1007/s10703-024-00444-3
Forward analysis and model checking for trace bounded WSTS
Pierre Chambart, Alain Finkel and Sylvain SchmitzTheoretical Computer Science 637 1 (2016)
https://doi.org/10.1016/j.tcs.2016.04.020
https://doi.org/10.1002/9781118602638.ch8
Applications and Theory of Petri Nets
Pierre Chambart, Alain Finkel and Sylvain SchmitzLecture Notes in Computer Science, Applications and Theory of Petri Nets 6709 49 (2011)
https://doi.org/10.1007/978-3-642-21834-7_4
Model-checking CTL* over flat Presburger counter systems
Stéphane Demri, Alain Finkel, Valentin Goranko and Govert van DrimmelenJournal of Applied Non-Classical Logics 20 (4) 313 (2010)
https://doi.org/10.3166/jancl.20.313-344
Linear-time temporal logics with Presburger constraints: an overview ★
Stéphane DemriJournal of Applied Non-Classical Logics 16 (3-4) 311 (2006)
https://doi.org/10.3166/jancl.16.311-347
Automated Technology for Verification and Analysis
S. Demri, A. Finkel, V. Goranko and G. van DrimmelenLecture Notes in Computer Science, Automated Technology for Verification and Analysis 4218 493 (2006)
https://doi.org/10.1007/11901914_36