Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Well-structured transition systems everywhere!
Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Beyond Parameterized Verification
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Algorithmic Verification of Invalidation-Based Protocols
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
On Model Checking for Non-Deterministic Infinite-State Systems
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
On model checking data-independent systems with arrays without reset
Theory and Practice of Logic Programming
Nested Petri Nets: Multi-level and Recursive Systems
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Elections in a Distributed Computing System
IEEE Transactions on Computers
On model checking data-independent systems with arrays with whole-array operations
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
Nets with tokens which carry data
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Name creation vs. replication in Petri net systems
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Algorithmic analysis of array-accessing programs
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Algorithmic analysis of array-accessing programs
ACM Transactions on Computational Logic (TOCL)
Nets with Tokens which Carry Data
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
Many interesting systems can be seen as having two kinds of state variables: array variables, which are mappings from one data type into another; and basic variables, which are used to control the system, to perform basic computations, and for operations involving arrays. We investigate such systems where:*the type of each basic variable is built from type variables using product and sum constructs; *the type of each array variable is B-B^', where B and B^' are types as for basic variables; *on any type variable, either no operations are available, or only the equality predicate, or only a linear-order predicate; *type variables denote arbitrary non-empty finite sets. We present a complete classification of reachability decision problems for these systems into decid- able or undecidable.