204 search results - page 34 / 41 » Abstract Simulators for the DSDE Formalism |
154
click to vote
ENTCS
2006
15 years 4 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
156
click to vote
IJSI
2008
15 years 4 months ago
2008
Abstract Commercial organizations increasingly need software processes sensitive to business value, quick to apply, supportive of multi-stakeholder collaboration, and capable of ea...
243
click to vote
POPL
2009
ACM
16 years 5 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...
161
click to vote
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...
145
click to vote
ROBOCUP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...