Sciweavers

181 search results - page 29 / 37
» Testable Use Cases in the Abstract State Machine Language
Sort
View
ASM
2004
ASM
15 years 4 months ago
Observations on the Decidability of Transitions
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
Yuri Gurevich, Rostislav Yavorskiy
LICS
1997
IEEE
15 years 3 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
DSRT
2009
IEEE
15 years 3 months ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
65
Voted
ZUM
1992
Springer
15 years 3 months ago
Specification in Fresco
software in the form of abstract classes; and the specification elements of the language can also be used in concrete classes to document the implementations and their development ...
Alan Wills
ECOOPW
1998
Springer
15 years 3 months ago
Mapping Business Processes to Software Design Artifacts
This paper explains the structure of a project repository, which enables you to trace business processes and business rules to the architecture and design of the software system. T...
Pavel Hruby