697 search results - page 13 / 140 » Implementation of Timed Automata: An Issue of Semantics or M... |
179
click to vote
FOSSACS
2011
Springer
14 years 8 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
137
Voted
EPIA
1989
Springer
15 years 9 months ago
1989
Springer
In this paper a model for temporal references in natural language (NL) is studied and a Prolog implementation of it is presented. This model is intended to be a common framework f...
127
click to vote
FORMATS
2007
Springer
15 years 11 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
153
Voted
CASES
2006
ACM
15 years 8 months ago
2006
ACM
Many embedded systems exhibit temporally and behaviorally disjoint behavior slices. When such behaviors are captured by state machines, the current design flow will capture it as ...
153
Voted
FUIN
2010
15 years 2 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...