149 search results - page 20 / 30 » The Timed Abstract State Machine Language: Abstract State Ma... |
123
click to vote
FATES
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Classical state-oriented testing approaches are based on simple machine models such as Labelled Transition Systems (LTSs), in which data is represented by concrete values...
124
click to vote
FSTTCS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
137
Voted
SIGSOFT
2003
ACM
16 years 4 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 ...
112
click to vote
ENTCS
2007
15 years 3 months ago
2007
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
149
Voted
UML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Current trends in software development show a move towards supporting autonomous components (agents). The accurate timing of interactions between such components is growi...