Event-clock automata: a determinizable class of timed automata, Theoretical Computer Science, vol.211, issue.1-2, pp.253-273, 1999. ,
DOI : 10.1016/S0304-3975(97)00173-4
Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004. ,
DOI : 10.1145/1007352.1007390
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.3757
Some decision problems related to the reachability problem for Petri nets, Theoretical Computer Science, vol.3, issue.1, pp.85-104, 1976. ,
DOI : 10.1016/0304-3975(76)90067-0
Decidable problems on the strong connectivity of Petri net reachability sets, Theoretical Computer Science, vol.4, issue.1, pp.99-119, 1977. ,
DOI : 10.1016/0304-3975(77)90059-7
ON YEN'S PATH LOGIC FOR PETRI NETS, International Journal of Foundations of Computer Science, vol.22, issue.04, pp.783-799, 2011. ,
DOI : 10.1142/S0129054111008428
Concurrent secrets. Discrete Event Dynamic Systems, pp.425-446, 2007. ,
DOI : 10.1109/wodes.2006.1678407
URL : https://hal.archives-ouvertes.fr/inria-00070249
Verifying nondeterministic probabilistic channel systems against ??-regular linear-time properties, ACM Transactions on Computational Logic, vol.9, issue.1, 2007. ,
DOI : 10.1145/1297658.1297663
URL : https://hal.archives-ouvertes.fr/inria-00424516
Principles of model checking, 2008. ,
Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems, 1973. M.I.T ,
Unfolding-based diagnosis of systems with an evolving topology, Information and Computation, vol.208, issue.10, pp.1169-1192, 2010. ,
DOI : 10.1016/j.ic.2009.11.009
URL : https://hal.archives-ouvertes.fr/inria-00638204
Quantifying opacity, QEST, pp.263-272, 2010. ,
Transductions and context-free languages. Teubner, 1979. ,
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779
Off-line test selection with test purposes for non-deterministic timed automata, Logical Methods in Computer Science, vol.8, issue.4, p.2012 ,
URL : https://hal.archives-ouvertes.fr/inria-00550923
Probabilistic regular graphs, 12th International Workshop on Verification of Infinite-State Systems, pp.77-90, 2010. ,
DOI : 10.4204/EPTCS.39.6
URL : https://hal.archives-ouvertes.fr/inria-00525388
Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000. ,
DOI : 10.1109/LICS.2000.855755
Symbolic methods for exploring infinite state spaces, 1998. ,
Diophantine equations, Presburger arithmetic and finite automata, CAAP, volume 1059 of Lecture Notes in Computer Science, pp.30-43, 1996. ,
DOI : 10.1007/3-540-61064-2_27
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5200
Fault Diagnosis Using Timed Automata, FoSSaCS'05), pp.219-233, 2005. ,
DOI : 10.1007/978-3-540-31982-5_14
Cyclic Petri Net Reachability Sets are Semi-linear Effectively Constructible, INFINITY'97, pp.15-24, 1997. ,
DOI : 10.1016/S1571-0661(05)80423-2
Fast Acceleration of Ultimately Periodic Relations, CAV'10, pp.227-242, 2010. ,
DOI : 10.1007/978-3-642-14295-6_23
URL : https://hal.archives-ouvertes.fr/hal-01418908
Discounted Properties of Probabilistic Pushdown Automata, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), pp.230-242, 2008. ,
DOI : 10.1007/978-3-540-89439-1_17
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata, Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), pp.145-157, 2005. ,
DOI : 10.1007/978-3-540-31856-9_12
A formal approach to conformance testing, Protocol Specification, Testing and Verification (PSTV'90), pp.349-363, 1990. ,
Opacity generalised to transition systems, International Journal of Information Security, vol.79, issue.3???4, pp.421-435, 2008. ,
DOI : 10.1007/s10207-008-0058-x
On a Decision Method in Restricted Second Order Arithmetic, ICLMPS, pp.1-11, 1960. ,
DOI : 10.1007/978-1-4613-8928-6_23
On Rational Trees, CSL 06, pp.225-239, 2006. ,
DOI : 10.1007/11874683_15
URL : https://hal.archives-ouvertes.fr/hal-00620171
The caucal hierarchy of infinite graphs in terms of logic and higherorder pushdown automata, FSTTCS 03, pp.112-123, 2003. ,
Introduction to Discrete Event Systems, 1999. ,
The Dark Side of Timed Opacity, Proc. of the 3rd International Conference on Information Security and Assurance (ISA'09), pp.21-30, 2009. ,
DOI : 10.1016/j.jss.2005.12.021
URL : https://hal.archives-ouvertes.fr/inria-00493635
Synthesis of opaque systems with static and dynamic masks. Formal Methods in System Design, pp.88-115, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00662539
Synchronization of Grammars, LNCS, vol.5010, pp.110-121, 2008. ,
DOI : 10.1007/978-3-540-79709-8_14
URL : https://hal.archives-ouvertes.fr/hal-00620185
An internal presentation of regular graphs by prefix-recognizable ones. Theory of Computing Systems, 2001. ,
Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956. ,
DOI : 10.1109/TIT.1956.1056813
On certain formal properties of grammars, Information and Control, vol.2, issue.2, pp.137-167, 1959. ,
DOI : 10.1016/S0019-9958(59)90362-6
Test generation from recursive tiles systems, 6th International Conference on Tests & Proofs, pp.99-114, 2012. ,
Test generation from recursive tile systems. Software Testing, Verification and Reliability, 2014. ,
Analysis of partially observed recursive tile systems, 11th edition of Workshop on Discrete Event Systems, pp.265-271, 2012. ,
DOI : 10.3182/20121003-3-MX-4033.00044
Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems. Discrete Event Dynamic Systems, pp.1-24, 2014. ,
Multiple counters automata, safety analysis and presburger arithmetic, CAV'98, pp.268-279, 1998. ,
DOI : 10.1007/BFb0028751
Automatic Test Generation from Interprocedural Specifications, TestCom/FATES'07, pp.41-57, 2007. ,
DOI : 10.1007/978-3-540-73066-8_4
URL : https://hal.archives-ouvertes.fr/inria-00137064
Handbook of Theoretical Computer Science, chapter Graph rewriting : an algebraic and logic approach, 1990. ,
Languages defined by higher type program schemes, LNCS, vol.77, issue.52, pp.164-179, 1977. ,
DOI : 10.1007/3-540-08342-1_13
Petri Net Reachability Graphs : Decidability Status of FO Properties, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), volume 13 of Leibniz International Proceedings in Informatics (LIPIcs), pp.140-151, 2011. ,
Petri net reachability graphs : Decidability status of first order properties, Logical Methods in Computer Science, vol.8, issue.4, pp.1-28 ,
Monitoring confidentiality by diagnosis techniques, ECC, pp.2584-2590, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00420420
Finite Model Theory, 1995. ,
Automata, Languages and Machines, volume A, 1974. ,
Petri nets, commutative context-free grammars, and basic parallel processes, Fundamenta Informaticae, issue.13, pp.3113-3139, 1997. ,
DOI : 10.1007/3-540-60249-6_54
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.2829
Decidability and complexity of Petri net problems ??? An introduction, Lecture Notes in Computer Science, vol.1491, pp.374-428, 1998. ,
DOI : 10.1007/3-540-65306-6_20
Model checking probabilistic pushdown automata, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., 2006. ,
DOI : 10.1109/LICS.2004.1319596
URL : http://arxiv.org/abs/cs/0508003
The theory and application of pushdown store machines. Mathematical linguistic and automatic translation report NSF-10, 1963. ,
Streamability of Nested Word Transductions, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum für Informatik, pp.312-324, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00566409
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols, FST&TCS'02, pp.145-156, 2002. ,
DOI : 10.1007/3-540-36206-1_14
A Symbolic Framework for Model-Based Testing, FATES 2006 and RV 2006, Revised Selected Papers, pp.40-54, 2006. ,
DOI : 10.1007/11940197_3
Expressive functional completeness in tense logic, Aspects of Philosophical Logic, pp.91-117, 1981. ,
Queries on Xml streams with bounded delay and concurrency, Special Issue : 3rd International Conference on Language and Automata Theory and Applications, pp.409-442, 2009. ,
DOI : 10.1016/j.ic.2010.08.003
URL : https://hal.archives-ouvertes.fr/inria-00491495
Mappings which preserve context sensitive languages, Information and Control, vol.9, issue.6, pp.563-582, 1966. ,
DOI : 10.1016/S0019-9958(66)80016-5
URL : http://doi.org/10.1016/s0019-9958(66)80016-5
Preservation of languages by transducers, Information and Control, vol.9, issue.2, pp.153-176, 1966. ,
DOI : 10.1016/S0019-9958(66)90211-7
Bounded ALGOL-like languages. Transactions od the, pp.333-368, 1964. ,
DOI : 10.2307/1994067
Semigroups, Presburger formulas, and languages, Pacific Journal of Mathematics, vol.16, issue.2, pp.285-296, 1966. ,
DOI : 10.2140/pjm.1966.16.285
The decidability of persistence for vector addition systems, Information Processing Letters, vol.11, issue.1, pp.20-23, 1980. ,
DOI : 10.1016/0020-0190(80)90026-5
Decidability Questions for Petri nets, 1975. ,
The equality problem for vector addition systems is undecidable, Theoretical Computer Science, vol.2, issue.1, pp.77-96, 1976. ,
DOI : 10.1016/0304-3975(76)90008-6
A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.512-535, 1994. ,
DOI : 10.1007/BF01211866
Semilinearity of the reachability set is decidable for Petri nets, 1990. ,
Monitoring Java Programs with Java PathExplorer, Electronic Notes in Theoretical Computer Science, vol.55, issue.2, pp.200-217, 2001. ,
DOI : 10.1016/S1571-0661(04)00253-1
Efficient monitoring of safety properties, International Journal on Software Tools for Technology Transfer, vol.1, issue.2, pp.158-173, 2004. ,
DOI : 10.1007/s10009-003-0117-6
Diagnosis from Scenarios, 2006 8th International Workshop on Discrete Event Systems, pp.307-312, 2006. ,
DOI : 10.1109/WODES.2006.1678447
On observing nondeterminism and concurrency, Lecture Notes in Computer Science, vol.80, issue.85, pp.299-309, 1980. ,
DOI : 10.1007/3-540-10003-2_79
On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, vol.8, issue.2, pp.135-159, 1979. ,
DOI : 10.1016/0304-3975(79)90041-0
Introduction to Automata Theory, Languages, and Computation, Second Edition, 2001. ,
Completeness Results for Single-Path Petri Nets, Information and Computation, vol.106, issue.2, pp.253-265, 1993. ,
DOI : 10.1006/inco.1993.1055
Diagnosis from scenarios, and applications. Discrete Event Dynamic Systems : Theory and Applications, 2013. ,
Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal of the ACM, vol.25, issue.1, pp.116-133, 1978. ,
DOI : 10.1145/322047.322058
Nondeterministic Space is Closed under Complementation, SIAM Journal on Computing, vol.17, issue.5, pp.935-938, 1988. ,
DOI : 10.1137/0217058
Undecidability of bisimilarity for Petri nets and some related problems, Theoretical Computer Science, vol.148, issue.2, pp.281-301, 1995. ,
DOI : 10.1016/0304-3975(95)00037-W
TGV: theory, principles and algorithms, International Journal on Software Tools for Technology Transfer, vol.17, issue.4, pp.297-315, 2005. ,
DOI : 10.1007/s10009-004-0153-x
Model-Based Test Selection for Infinite-State Reactive Systems, 5th International Symposium on Formal Methods for Components and Objects (FMCO'06), Revised Lectures, pp.47-69, 2006. ,
DOI : 10.1007/978-3-540-74792-5_3
URL : https://hal.archives-ouvertes.fr/inria-00564604
Supervision Patterns in Discrete Event Systems Diagnosis, 2006 8th International Workshop on Discrete Event Systems, pp.262-268, 2006. ,
DOI : 10.1109/WODES.2006.1678440
A polynomial algorithm for testing diagnosability of discrete-event systems, IEEE Transactions on Automatic Control, vol.46, issue.8, pp.1318-1321, 2000. ,
DOI : 10.1109/9.940942
Parallel program schemata, Journal of Computer and System Sciences, vol.3, pp.147-195, 1969. ,
Representation of Events in Nerve Nets and Finite Automata, Automata Studies, pp.3-40, 1956. ,
DOI : 10.1515/9781400882618-002
Verification of Opacity and Diagnosability for Pushdown Systems, Journal of Applied Mathematics, vol.36, issue.2, 2013. ,
DOI : 10.1007/978-3-540-24597-1_10
Complexity of model checking recursion schemes for fragments of the modal mu-calculus, Logical Methods in Computer Science, vol.7, issue.4, 2011. ,
Decidability of reachability in vector addition systems (Preliminary Version), Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.267-281, 1982. ,
DOI : 10.1145/800070.802201
Conformance testing for real-time systems, Formal Methods in System Design, vol.10, issue.1???2, pp.238-304, 2009. ,
DOI : 10.1007/s10703-009-0065-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.7098
Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964. ,
DOI : 10.1016/S0019-9958(64)90120-2
Automatic Structures of Bounded Degree Revisited, Lecture Notes in Computer Science, vol.27, pp.364-378, 2009. ,
DOI : 10.1007/BF00264285
Methods for Quantitative Analysis of Probabilistic Pushdown Automata, Electronic Notes in Theoretical Computer Science, vol.149, issue.1, pp.3-15, 2006. ,
DOI : 10.1016/j.entcs.2005.11.013
Three theorems on phrase structure grammars of type 1, Information and Control, vol.6, issue.2, pp.131-136, 1963. ,
DOI : 10.1016/S0019-9958(63)90169-4
Online Testing of Real-time Systems Using Uppaal, Formal Approaches to Software Testing, pp.79-94, 2005. ,
DOI : 10.1007/s100090050044
Vector Addition System Reachability Problem: A Short Self-contained Proof, POPL'11, pp.307-316, 2011. ,
DOI : 10.1007/978-3-642-21254-3_3
URL : https://hal.archives-ouvertes.fr/hal-00599756
Vector Addition System Reversible Reachability Problem, Lecture Notes in Computer Science, vol.99, issue.1, pp.327-341, 2011. ,
DOI : 10.1007/3-540-53904-2_94
URL : https://hal.archives-ouvertes.fr/hal-00599757
On Flatness for 2-Dimensional Vector Addition Systems with States, CONCUR'04, pp.402-416, 2004. ,
DOI : 10.1137/0213029
Automatic Structures of Bounded Degree, Proceedings of LPAR 03, pp.344-358, 2003. ,
DOI : 10.1007/978-3-540-39813-4_25
Multilevel stack automata. Problems of Information Transmission, pp.38-43, 1976. ,
Handbook of Formal Languages, volume 1, chapter Aspects of classical language theory, pp.175-252, 1997. ,
An algorithm for the general Petri net reachability problem, Proceedings of the 13th Symposium on Theory of Computing, pp.238-246, 1981. ,
An Algorithm for the General Petri Net Reachability Problem, SIAM Journal on Computing, vol.13, issue.3, pp.441-460, 1984. ,
DOI : 10.1137/0213029
The Complexity of the Finite Containment Problem for Petri Nets, Journal of the ACM, vol.28, issue.3, pp.561-576, 1981. ,
DOI : 10.1145/322261.322271
Communication and concurency, 1989. ,
Decidability of MSO Theories of Tree Structures, Lecture Notes in Computer Science, vol.3328, pp.434-446, 2004. ,
DOI : 10.1007/978-3-540-30538-5_36
URL : https://hal.archives-ouvertes.fr/hal-00878415
On Rational Graphs, Fossacs 00, pp.252-266, 2000. ,
DOI : 10.1007/3-540-46432-8_17
URL : https://hal.archives-ouvertes.fr/hal-00620062
Les graphes rationnels, Thèse de doctorat, 2001. ,
Contextual graph grammars characterizing context-sensitive languages, 4th International Workshop on Non-Classical Models of Automata, pp.141-153, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00366942
Diagnosability of Pushdown Systems, HVC2009, Haifa Verification Conference, pp.21-33, 2009. ,
DOI : 10.1109/TAC.2002.802763
URL : https://hal.archives-ouvertes.fr/inria-00525397
Families of automata characterizing context-sensitive languages, Acta Informatica, vol.25, issue.4-5, pp.293-314, 2005. ,
DOI : 10.1007/s00236-004-0160-0
URL : https://hal.archives-ouvertes.fr/inria-00525422
Rational Graphs Trace Context-Sensitive Languages, MFCS 01, pp.548-559, 2001. ,
DOI : 10.1007/3-540-44683-4_48
URL : https://hal.archives-ouvertes.fr/hal-00950050
The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, vol.37, pp.51-75, 1985. ,
DOI : 10.1016/0304-3975(85)90087-8
Concurrency and automata on infinite sequences, 5th GIConference, pp.167-183, 1981. ,
DOI : 10.1007/BFb0017309
Closure properties of deterministic Petri nets, STACS'87, pp.371-382, 1987. ,
DOI : 10.1007/BFb0039620
One-sided and two-sided context in formal grammars, Information and Control, vol.25, issue.4, pp.371-392, 1974. ,
DOI : 10.1016/S0019-9958(74)91049-3
Kommunikation mit Automaten, 1962. ,
Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier, Lecture Notes in Computer Science, vol.96, issue.1, pp.216-227, 2010. ,
DOI : 10.1016/0890-5401(92)90059-O
Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes Rendus du premier congrès de mathématiciens des Pays Slaves, pp.92-101, 1929. ,
Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. soc, vol.141, pp.1-35, 1969. ,
Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959. ,
DOI : 10.1147/rd.32.0114
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4472
Composition theorem for generalized sum, 2006. ,
Handbook of Graph Grammars and Computing by Graph Transformations, Foundations. World Scientific, vol.1, 1997. ,
DOI : 10.1142/3303
Verification of Infinite-Step Opacity and Complexity Considerations, IEEE Transactions on Automatic Control, vol.57, issue.5, pp.1265-1269, 2012. ,
DOI : 10.1109/TAC.2011.2173774
Verification of initial-state opacity in security applications of DES, 2008 9th International Workshop on Discrete Event Systems, pp.328-333, 2008. ,
DOI : 10.1109/WODES.2008.4605967
Elements of Automata Theory, 2009. ,
DOI : 10.1017/CBO9781139195218
Computation and Automata, 1985. ,
DOI : 10.1017/CBO9781107325630
Diagnosability of discrete-event systems, IEEE Transactions on Automatic Control, vol.40, issue.9, pp.1555-1575, 1995. ,
DOI : 10.1109/9.412626
Failure diagnosis using discrete-event models, IEEE Transactions on Control Systems Technology, vol.4, issue.2, pp.105-124, 1996. ,
DOI : 10.1109/87.486338
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.364.852
First-order logic with reachability predicates on infinite systems, FST&TCS'10, pp.493-504, 2010. ,
PROGRAMMED GRAPH REPLACEMENT SYSTEMS, Rozenberg [129], pp.479-546 ,
DOI : 10.1142/9789812384720_0007
The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975. ,
DOI : 10.2307/1971037
The method of forced enumeration for nondeterministic automata, Acta Informatica, vol.33, issue.3, pp.279-284, 1988. ,
DOI : 10.1007/BF00299636
A Decision Method for Elementary Algebra and Geometry, 1951. ,
DOI : 10.1007/978-3-7091-9459-1_3
A Short Introduction to Infinite Automata, DLT 01, pp.130-144, 2002. ,
DOI : 10.1007/3-540-46011-X_10
Diagnosability of stochastic discrete-event systems, IEEE Transactions on Automatic Control, vol.50, issue.4, pp.476-492, 2005. ,
DOI : 10.1109/TAC.2005.844722
Test generation with inputs, outputs and repetitive quiescence. Software -Concepts and Tools, pp.103-120, 1996. ,
DOI : 10.1007/3-540-61042-1_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.475.9528
Torx : Automated model-based testing, First European Conference on Model-Driven Software Engineering, pp.31-43, 2003. ,
Fault Diagnosis for Timed Automata, LNCS, vol.2469, pp.205-224, 2002. ,
DOI : 10.1007/3-540-45739-9_14
Fault detection based on Petri net models with faulty behaviors, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), pp.113-118, 1998. ,
DOI : 10.1109/ICSMC.1998.725394
Petri nets and regular languages, Journal of Computer and System Sciences, vol.23, issue.3, pp.299-325, 1981. ,
DOI : 10.1016/0022-0000(81)90067-2
URL : http://doi.org/10.1016/0022-0000(81)90067-2
Introduction à la Calculabilité, InterEditions, 1991. ,
Comparative analysis of related notions of opacity in centralized and coordinated architectures. Discrete Event Dynamical Systems, pp.307-339, 2013. ,
Polynomial-time verification of diagnosability of partially-observed discrete event systems, IEEE Trans. on Automatic Control, vol.47, issue.3, pp.1491-1495, 2002. ,
The composition method, 1994. ,