481 search results - page 91 / 97 » Model Checking Abstract State Machines and Beyond |
SIGSOFT
2003
ACM
14 years 8 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...
FUIN
2008
13 years 7 months ago
2008
A deterministic behavior of systems composed of several modules is a desirable design goal. Assembling a complex system from components requires also a high degree of re-usability....
JAIR
2008
13 years 7 months ago
2008
Experience in the physical sciences suggests that the only realistic means of understanding complex systems is through the use of mathematical models. Typically, this has come to ...
ASM
2004
ASM
14 years 24 days ago
2004
ASM
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 ×·...
DAGSTUHL
1998
13 years 8 months ago
1998
Abstract. During the last years, a number of formal specification languages for knowledge-based systems have been developed. Characteristic for knowledge-based systems are a comple...