For modeling and reasoning about complex systems, symbolic methods provide a prominent way to tackle the state explosion problem. It is well known that for symbolic approaches based on binary decision diagrams (BDD), the ordering of BDD variables plays a crucial role for compact representations and efficient computations. We have extended the popular probabilistic model checker PRISM with suppo...

Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event occurrences instead of clock zones that use vectors of clock values grouped in polyhedral clock constraints. Symbolic state exploration with event zones rather than clock zones can result in significant reductions in t...

This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution is used to systematically identify equivalence classes of input values and has been shown to scale well to large systems. Although mainly applied to sequential programs, this scalability makes it interesting to consider the technique in the distributed and concurrent setting as well. ...

Symbolic model checking is a powerful formal-verification technique for reactive systems. In this paper we address the problem of symbolic model checking for software specifications written as statecharts. We concentrate on how the synchronization of statecharts relates to the efficiency of model checking. We show that statecharts synchronized in an oblivious manner, such that the synchronizati...

pto Centre National de la Recherche Scientifique Institut National de Recherche en Informatique (UMR 6074) Université de Rennes 1 – Insa de Rennes et en Automatique – unité de recherche de Rennes Supervisory Control of Discrete or Hybrid Symbolic systems Abstract In this paper we tackle the safety controller synthesis problem for various models ranging from nite transition systems to hybrid sys...

In recent years, the Natural Language Processing scene has witnessed the steady growth of interest in connectionist modeling. The main appeal of such an approach is that one does not have to determine the grammar rules in advance: the learning abilities displayed by such systems take care of input regularities. Better and faster learning can be obtained through the implementation of a symbolic-...

This paper extends the familiar “query by humming” music retrieval framework into the polyphonic realm. As humming in multiple voices is quite difficult, the task is more accurately described as “query by audio example”, onto a collection of scores. To our knowledge, we are the first to use polyphonic audio queries to retrieve from polyphonic symbolic collections. Furthermore, as our results wi...

We have been developing a general symbolic-statistical modeling language [6, 19, 20] based on the logic programming framework that semantically uni es (and extends) major symbolic-statistical frameworks such as hidden Markov models (HMMs) [18], probabilistic contextfree grammars (PCFGs) [23] and Bayesian networks [16]. The language, PRISM, is intended to model complex symbolic phenomena governe...

SISTER: A SYMBOLIC INTERACTIONIST SIMULATION OF TRADE AND EMERGENT ROLES Deborah Vakas Duong George Mason University, 2004 Thesis Director: John Grefenstette SISTER, a Symbolic Interactionist Simulation of Trade and Emergent Roles, captures the fundamental social process by which macro level roles emerge from micro level symbolic interaction. SISTER may be used for the computational social scie...

Biological inspired learning systems have proven to be very powerful techniques for learning robot controllers. However, in some cases the learned concepts are unreadable for humans. This prevents a deep semantic analysis of what has been really learned by those systems. We present in this paper an alternative to obtaining rule representation of a neural network robot controller. In the first s...