Sciweavers

ENTCS
2006
112views more  ENTCS 2006»
13 years 11 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
FUIN
2008
123views more  FUIN 2008»
13 years 11 months ago
Interface Automata with Complex Actions: Limiting Interleaving in Interface Automata
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...
Shahram Esmaeilsabzali, Nancy A. Day, Farhad Mavad...
TAPSOFT
1997
Springer
14 years 3 months ago
Set Operations for Recurrent Term Schematizations
Abstract. Reasoning on programs and automated deduction often require the manipulation of in nite sets of objects. Many formalisms have been proposed to handle such sets. Here we d...
Ali Amaniss, Miki Hermann, Denis Lugiez