Learn More
The Event-B method is a formal approach for reliable systems specification and verification, being supported by the Rodin platform , which includes mature plugins for theorem-proving, model-checking, or model (de)composition features. In order to complement these techniques with test generation and state model inference from Event-B models , we developed a(More)
Event-B is a formal modeling language having set theory as its mathematical foundation and abstract state machines as its behav-ioral specifications. The language has very good tool support based on theorem proving and model checking technologies, but very little support for test generation. Motivated by industrial interest in the latter domain, this paper(More)
Zielonka's theorem, established 25 years ago, states that any regular language closed under com-mutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchron-ous automata has been simplified and We first survey these constructions and(More)
We propose an approach which, given a state-transition model of a system, constructs, in parallel, an approximate automaton model and a test suite for the system. The approximate model construction relies on a variant of Angluin's automata learning algorithm, adapted to finite cover automata. A finite cover automaton represents an approximation of the(More)
In this paper, we prove that deterministic 1-membrane systems with symport/antiport rules are Turing-complete. Our proof is based on the notion of numerical partial recursive function computed by numerical programs of a language with simple instructions, defined by Martin Davis and Elaine Weyuker [10]. We reduced the task from partial recursive functions to(More)
  • 1