Result 1 to 20 of 48 total
Belief bisimulation for hidden Markov models. Logical characterisation and decision algorithm. (English)
Goodloe, Alwyn E. (ed.) et al., NASA formal methods. 4th international symposium, NFM 2012, Norfolk, VA, USA, April 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28890-6/pbk). Lecture Notes in Computer Science 7226, 326-340 (2012).
1
Efficient CSL model checking using stratification. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 17, 18 p., electronic only (2012).
2
Automata-based CSL model checking. (English)
Comput. Res. Repos. 2011, Article No. 1104.4983 (2011).
3
Automata-based CSL model checking. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 271-282 (2011).
4
Erratum to: model-checking continuous-time Markov chains by aziz et al. (English)
Comput. Res. Repos. 2011, Article No. 1102.2079 (2011).
5
The ins and outs of the probabilistic model checker MRMC. (English)
Perform. Eval. 68, No. 2, 90-104 (2011).
6
A disposable passive temperature sensor with RFID ISO15693 interface (English)
RFID-TA, 1-7 (2011).
7
Automata-based CSL model checking (English)
ICALP (2), 271-282 (2011).
8
Synthesis and stochastic assessment of cost-optimal schedules. (English)
Int. J. Softw. Tools Technol. Transf. 12, No. 5, 305-318 (2010).
9
The axiomatization of override and update. (English)
J. Appl. Log. 8, No. 1, 141-150 (2010).
10
Knowledge production and the structure of collaboration networks in two scientific fields (English)
Scientometrics 83, No. 1, 219-241 (2010).
11
Identifying ruptures in business-IT communication through business models (English)
ICEIS, 311-325 (2010).
12
Identifying ruptures in business-IT communication through business models (English)
ICEIS (3), 44-51 (2010).
13
Fortuna: model checking priced probabilistic timed automata (English)
QEST, 273-281 (2010).
14
Supersite: dictionary of metabolite and drug binding sites in proteins. (English)
Nucleic Acids Res. 37, No. Database-Issue, 195-200 (2009).
15
Undecidability of cost-bounded reachability in priced probabilistic timed automata. (English)
Chen, Jianer (ed.) et al., Theory and applications of models of computation. 6th annual conference, TAMC 2009, Changsha, China, May 18‒22, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02016-2/pbk). Lecture Notes in Computer Science 5532, 128-137 (2009).
16
Undecidability of cost-bounded reachability in priced probabilistic timed automata (English)
TAMC, 128-137 (2009).
17
The ins and outs of the probabilistic model checker MRMC (English)
QEST, 167-176 (2009).
18
Flow faster: efficient decision algorithms for probabilistic simulations. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 6, 43 p., electronic only (2008).
19
Flow faster: Efficient decision algorithms for probabilistic simulations. (English)
Comput. Res. Repos. 2008, Article No. 0808.3651 (2008).
20
Result 1 to 20 of 48 total
Start
Contact
Print
General Help
