12 search results - page 2 / 3 » Weak bisimulation for Probabilistic Timed Automata |
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
VMCAI
2012
Springer
12 years 12 days ago
2012
Springer
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
ATVA
2004
Springer
13 years 10 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
IJFCS
2006
13 years 4 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...