Decidability of reachability for polymorphic systems with arrays: A complete classification

Electronic Notes in Theoretical Computer Science

Volumn 138, Issue 3, 2005, Pages 3-19

  Lazić, Ranko ^a,b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b MATHEMATICAL INSTITUTE   (Serbia)

Author keywords

Array; Decidability; Infinite state; Model checking; Parameterised

Indexed keywords

ARRAY; INFINITE-STATE; MODEL CHECKING; PARAMETERIZED; POLYMORPHIC SYSTEMS;

COMPUTATIONAL METHODS; DATA ACQUISITION; DECISION MAKING; MAPPING; PARAMETER ESTIMATION; PROBLEM SOLVING;

SYSTEMS ANALYSIS;

EID: 29144474436     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.08.001     Document Type: Conference Paper

References (17)

1. M. Bozzano, and G. Delzanno Beyond Parameterized Verification Proceedings of TACAS '02 Lecture Notes in Computer Science 2280 2002 221 235
2. M. Bozzano and G. Delzanno, Automatic Verification of Invalidation-based Protocols, Proceedings of CAV '02, July 2002
3. G. Delzanno An Assertional Language for Systems Parametric in Several Dimensions Proceedings of the Workshop on Verification of Parameterized Systems (VEPAS 2001) Electronic Notes in Theoretical Computer Science 50 2001 Elsevier
4. G. Delzanno, On the Automated Verification of Parameterized Concurrent Systems with Unbounded Local Data, Technical Report, Dipartimento Informatica e Scienze dell'Informazione, Università di Genova, 2002. Revised and extended version of [3], [1], [2]
5. E.A. Emerson and K.S. Namjoshi, On model checking for non-deterministic infinite-state systems, Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS), 1998
6. A. Finkel, and Ph. Schnoebelen Well-structured transition systems everywhere! Theoretical Computer Science 256 1-2 2001 63 92
7. H. Garcia-Molina Elections in a distributed computing system IEEE Transactions on Computers 31 1 1982 48 59
8. R.S. Lazić, T.C. Newcomb, and A.W. Roscoe On model checking data-independent systems with arrays without reset Theory and Practice of Logic Programming 4 5 & 6 2004 659 693 Cambridge University Press
9. R.S. Lazić, T.C. Newcomb and A.W. Roscoe, On model checking data-independent systems with arrays with whole-array operations, Proceedings of 25 Years of CSP, July 2004, to appear
10. R.S. Lazić, T.C. Newcomb and A.W. Roscoe, Polymorphic systems with arrays, 2-counter machines and multiset rewriting, Proceedings of the International Workshop on Verification of Infinite-State Systems (INFINITY 2004), Electronic Notes in Theoretical Computer Science
11. R. Lazić and A.W. Roscoe, Verifying determinism of concurrent systems which use unbounded arrays, Proceedings of the 3rd International Workshop on Verification of Infinite-State Systems (INFINITY '98), Report TUM-I9825, 2-8, Technical University of Munich, July 1998
12. I.A. Lomazova Nested Petri Nets: Multi-level and Recursive Systems Fundamenta Informaticae 47 2001 283 294 IOS Press
13. J.C. Mitchell, Type Systems for Programming Languages, in [17], 365-458
14. T.C. Newcomb, Model Checking Data-Independent Systems with Arrays, D. Phil. thesis, Computing Laboratory, Oxford University, 2003
15. J.-F. Raskin and L. Van Begin, Petri Nets with Non-blocking Arcs are Difficult to Analyse, Proceedings of the International Workshop on Verification of Infinite-State Systems (INFINITY 2003), Electronic Notes in Theoretical Computer Science
16. Ph. Schnoebelen Verifying Lossy Channel Systems has Nonprimitive Recursive Complexity Information Processing Letters 83 5 2002 251 261
17. J. van Leeuwen Formal Models and Semantics Handbook of Theoretical Computer Science volume B 1990 Elsevier