Symbolic finite automata extend classical automata by allowing infinite alphabets given by Boolean algebras and having transitions labeled by predicates over such algebras. Symbolic automata have been intensively studied recently and they have proven useful in several applications. We study some theoretical aspects of symbolic automata. Especially, we study minterms of symbolic automata, that i...

The symbolic management literature explores loose coupling between substantive and symbolic aspects of organizational activities. The prior literature, however, focuses on the benefits of symbolic management and tends to treat it as costless. If symbolic management is costless, presumably all firms should pursue it, yet in practice they do not. In this paper, we extend the theory of symbolic ma...

A symbolic compiler translates a program to symbolic constraints, automatically reducing model checking and synthesis to constraint solving. We show that new applications of constraint solving require domain-specific encodings that yield orders of magnitude improvements in solver efficiency. Unfortunately, these encodings cannot be obtained with today’s symbolic compilation. We introduce symbol...

The numerical cognition literature offers two views to explain numerical and arithmetical development. The unique-representation view considers the approximate number system (ANS) to represent the magnitude of both symbolic and non-symbolic numbers and to be the basis of numerical learning. In contrast, the dual-representation view suggests that symbolic and non-symbolic skills rely on differen...

This paper enables symbolic ternary simulation of systems with large embedded memories. Each memory array is replaced with a behavioral model, where the number of symbolic variables used to characterize the initial state of the memory is proportional to the number of distinct symbolic memory locations accessed. The behavioral model provides a conservative approximation of the replaced memory ar...

Performance on symbolic and non-symbolic numeric order determination tasks was examined as predictors of Woodcock Johnson calculation (exact) and computation estimation (approximate) scores among university aged adults. For Woodcock Johnson scores, only the symbolic task variant was found to be a significant predictor of performance outcomes after entering both task variants into a multiple reg...

Symbolic analysis of cryptographic protocols is dramatically simpler than full-fledged cryptographic analysis. In particular, it is readily amenable to automation. However, symbolic analysis does not a priori carry any cryptographic soundness guarantees. Following recent work on cryptographically sound symbolic analysis, we demonstrate how Dolev-Yao style symbolic analysis can be used to assert...

Symbolic analysis of cryptographic protocols is dramatically simpler than full-fledged cryptographic analysis. In particular, it is simple enough to be automated. However, symbolic analysis does not, by itself, provide any cryptographic soundness guarantees. Following recent work on cryptographically sound symbolic analysis, we demonstrate how Dolev-Yao style symbolic analysis can be used to as...

In this chapter, a general nonlinear symbolic LFT modelling framework and its support LFT tools are presented. The modelling approach developed combines the natural modularity and clarity of presentation from LFT modelling with the ease of manipulation from symbolic algebra. It results in an exact nonlinear symbolic LFT that represents an ideal starting point to apply subsequent assumptions and...

Symmetry based approaches are known to attack the state space explosion problem encountered during the analysis of distributed systems. In another way, BDD-like encodings enable the management of huge data sets. In this paper, we show how to benefit from both approaches automatically. Hence, a quotient set is built from a coloured Petri net description modeling the system. The reachability set ...