Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchical-structured component-oriented software systems. However, the rules governing composition, as is typical for all automata-based approaches, suffer from combinatorial state explosion, an effect that can have significant ramifications on the successful application of the Component Interaction Automata formalism to real-world scenarios. We must, therefore, find some appropriate means to counteract state explosion – one of which is partition refinement through weak bisimulation. But, while this technique can yield the desired state space reduction, it does not consider synchronization cliques, i.e., groups of states that are intercon...
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems, based on I/O autom...
We present a new automata-based interface model describing the interaction behavior of software comp...
International audienceSynchronizing a (deterministic, finite-state) automaton is the problem of find...
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of...
AbstractComponent Interaction Automata provide a fitting model to capture and analyze the temporal f...
Automata-based modeling languages, like Component Interaction Automata, offer an attractive means to...
Abstract. Automata-based interface and protocol specifications provide an ele-gant framework to capt...
In this paper an algorithm is proposed which removes the synchronous behavior of events in automata....
AbstractSoftware systems assembled from a large number of autonomous components become an interestin...
Abstract. The techniques of component-based development are becom-ing a common practice in the area ...
Synchronous coordination systems allow the exchange of data by logically indivisible actions involv...
AbstractWe introduce yet another event-based formalism, that of event automata, which unifies variou...
Current advances in software engineering practice involve the adoption of a component- based approac...
Abstract. Team automata have been proposed in Ellis (1997) as a formal framework for modeling both t...
A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing wor...
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems, based on I/O autom...
We present a new automata-based interface model describing the interaction behavior of software comp...
International audienceSynchronizing a (deterministic, finite-state) automaton is the problem of find...
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of...
AbstractComponent Interaction Automata provide a fitting model to capture and analyze the temporal f...
Automata-based modeling languages, like Component Interaction Automata, offer an attractive means to...
Abstract. Automata-based interface and protocol specifications provide an ele-gant framework to capt...
In this paper an algorithm is proposed which removes the synchronous behavior of events in automata....
AbstractSoftware systems assembled from a large number of autonomous components become an interestin...
Abstract. The techniques of component-based development are becom-ing a common practice in the area ...
Synchronous coordination systems allow the exchange of data by logically indivisible actions involv...
AbstractWe introduce yet another event-based formalism, that of event automata, which unifies variou...
Current advances in software engineering practice involve the adoption of a component- based approac...
Abstract. Team automata have been proposed in Ellis (1997) as a formal framework for modeling both t...
A deterministic finite-state automaton A is said to be synchronizing if there is a synchronizing wor...
We present dynamic I/O automata (DIOA), a compositional model of dynamic systems, based on I/O autom...
We present a new automata-based interface model describing the interaction behavior of software comp...
International audienceSynchronizing a (deterministic, finite-state) automaton is the problem of find...