527 search results - page 5 / 106 » Words and Bisimulations of Dynamical Systems |
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— In this paper we propose a testing based method for safety/ reachability analysis of stochastic hybrid systems. Testing based methods are characterized by analysis based on the...
104
Voted
FOSSACS
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
79
Voted
POPL
2000
ACM
15 years 1 months ago
2000
ACM
It has been shown that secret information can be leaked to external observers through covert timing channels. In this paper we are concerned with a kind of timing attack that want...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...