An automaton is unambiguous if each word has at most one accepting run and separated if no word is accepted from two distinct states. The classical translation of LTL formulas to Büchi automata [5] produces unambiguous separated automata since the states of such automata correspond to complete subformula types. Motivated by this observation, Couvreur et al. [3] present a polynomialtime algorith...

The term Input/Output Automata refers to a family of system modeling frameworks based on interacting infinite-state machines. The models come in several flavors, based on which features (fairness, time, continuous behavior, probability, etc.) they can express. In each of these frameworks, automata can be composed in parallel to form more complex automata, and automata can be related using level...

In this article we propose an algorithm, based on Markov chain techniques, to generate random automata that are deterministic, accessible and acyclic. The distribution of the output approaches the uniform distribution on n-state such automata. We then show how to adapt this algorithm in order to generate minimal acyclic automata with n states almost uniformly.

In this paper we extend the predicate logic introduced in [Beauquier et al. 2002] in order to deal with Semi-Markov Processes. We prove that with respect to qualitative probabilistic properties, model checking is decidable for this logic applied to SemiMarkov Processes. Furthermore we apply our logic to Probabilistic Timed Automata considering classical and urgent semantics, and considering als...

We investigate some graph properties which may simplify the computation of the steady-state distribution of Markov chain. We consider the directed graph associated to a Markov chain derived from Stochastic Automata Network and we give an algorithm to solve the Kolmogorov equations for the steady-state distribution. Then, we present an extension of this algorithm which allows the parametric anal...

We define a new class of hybrid automata for which reachability is decidable—a proper superclass of the initialized rectangular hybrid automata—by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. ...

We describe, in detail, the modeling and automatic analysis of the Delta-Notch lateral inhibition mechanism using a hybrid systems framework. Inhibitory lateral signaling between adjacent cells is one of the central processes responsible for cell-differentiation in a cluster of identical cells. The basic modeling unit used in this paper is a hybrid automata and more complex models are built usi...