80 search results - page 7 / 16 » Robust safety of timed automata |
110
click to vote
PEPM
1999
ACM
15 years 3 months ago
1999
ACM
A certifying compiler takes a source language program and produces object code, as well as a certi cate" that can be used to verify that the object code satis es desirable pr...
HYBRID
2005
Springer
15 years 5 months ago
2005
Springer
This paper focuses on hybrid systems whose discrete state transitions depend on both deterministic and stochastic events. For such systems, after introducing a suitable hybrid mod...
CAV
2007
Springer
15 years 5 months ago
2007
Springer
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
CONCUR
2010
Springer
15 years 23 days ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
132
click to vote
ESOP
2012
Springer
13 years 7 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...