Sciweavers

527 search results - page 5 / 106
» Words and Bisimulations of Dynamical Systems
Sort
View
ICALP
1998
Springer
13 years 11 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
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...
Petr Jancar, Antonín Kucera, Richard Mayr
CDC
2008
IEEE
131views Control Systems» more  CDC 2008»
14 years 2 months ago
Probabilistic testing for stochastic hybrid systems
— 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...
A. Agung Julius, George J. Pappas
FOSSACS
1999
Springer
13 years 11 months ago
Probabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
Murali Narasimha, Rance Cleaveland, S. Purushotham...
POPL
2000
ACM
13 years 12 months ago
Transforming Out Timing Leaks
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...
Johan Agat
LICS
2009
IEEE
14 years 2 months ago
An Algebra for Kripke Polynomial Coalgebras
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...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...