Predictability of Event Occurrences in Timed Systems. Cassez, F. & Grastien, A. In Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings, volume 8053, of Lecture Notes in Computer Science, pages 62–76, 2013. Springer.
Paper
Slides
Link doi abstract bibtex 1 download We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.
@inproceedings{cassez-formats-2013,
author = {Franck Cassez and
Alban Grastien},
title = {Predictability of Event Occurrences in Timed Systems},
booktitle = {Formal Modeling and Analysis of Timed Systems - 11th International
Conference, {FORMATS} 2013, Buenos Aires, Argentina, August 29-31,
2013. Proceedings},
pages = {62--76},
year = {2013},
urlpaper = {papers/formats-2013.pdf},
urlslides = {papers/slides-formats-2013.pdf},
url_link = {http://dx.doi.org/10.1007/978-3-642-40229-6_5},
series = {Lecture Notes in Computer Science},
volume = {8053},
publisher = {Springer},
doi = {10.1007/978-3-642-40229-6_5},
show = {},
keywords = {predictability, diagnosis, timed automata},
mywbepage = {timed},
category = {Fault diagnosis},
abstract = {
We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.
},
Type = {B - International Conferences},
}
Downloads: 1
{"_id":"s4ZbxFcwv2SK7eAKz","bibbaseid":"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013","author_short":["Cassez, F.","Grastien, A."],"bibdata":{"bibtype":"inproceedings","type":"B - International Conferences","author":[{"firstnames":["Franck"],"propositions":[],"lastnames":["Cassez"],"suffixes":[]},{"firstnames":["Alban"],"propositions":[],"lastnames":["Grastien"],"suffixes":[]}],"title":"Predictability of Event Occurrences in Timed Systems","booktitle":"Formal Modeling and Analysis of Timed Systems - 11th International Conference, FORMATS 2013, Buenos Aires, Argentina, August 29-31, 2013. Proceedings","pages":"62–76","year":"2013","urlpaper":"papers/formats-2013.pdf","urlslides":"papers/slides-formats-2013.pdf","url_link":"http://dx.doi.org/10.1007/978-3-642-40229-6_5","series":"Lecture Notes in Computer Science","volume":"8053","publisher":"Springer","doi":"10.1007/978-3-642-40229-6_5","show":"","keywords":"predictability, diagnosis, timed automata","mywbepage":"timed","category":"Fault diagnosis","abstract":"We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete. ","bibtex":"@inproceedings{cassez-formats-2013,\n author = {Franck Cassez and\n Alban Grastien},\n title = {Predictability of Event Occurrences in Timed Systems},\n booktitle = {Formal Modeling and Analysis of Timed Systems - 11th International\n Conference, {FORMATS} 2013, Buenos Aires, Argentina, August 29-31,\n 2013. Proceedings},\n pages = {62--76},\n year = {2013},\n urlpaper = {papers/formats-2013.pdf},\n urlslides = {papers/slides-formats-2013.pdf},\n url_link = {http://dx.doi.org/10.1007/978-3-642-40229-6_5},\n series = {Lecture Notes in Computer Science},\n volume = {8053},\n publisher = {Springer},\n doi = {10.1007/978-3-642-40229-6_5},\n show = {},\n keywords = {predictability, diagnosis, timed automata},\n mywbepage = {timed},\n category = {Fault diagnosis},\n abstract = {\n We address the problem of predicting events' occurrences in partially observable timed systems modelled by timed automata. Our contribution is many-fold: 1) we give a definition of bounded predictability, namely k-predictability, that takes into account the minimum delay between the prediction and the actual event's occurrence; 2) we show that 0-predictability is equivalent to the original notion of predictability of S. Genc and S. Lafortune; 3) we provide a necessary and sufficient condition for k-predictability (which is very similar to k-diagnosability) and give a simple algorithm to check k-predictability; 4) we address the problem of predictability of events' occurrences in timed automata and show that the problem is PSPACE-complete.\n },\n Type = {B - International Conferences},\n\n}\n\n","author_short":["Cassez, F.","Grastien, A."],"key":"cassez-formats-2013","id":"cassez-formats-2013","bibbaseid":"cassez-grastien-predictabilityofeventoccurrencesintimedsystems-2013","role":"author","urls":{"Paper":"http://science.mq.edu.au/~fcassez/bib/papers/formats-2013.pdf","Slides":"http://science.mq.edu.au/~fcassez/bib/papers/slides-formats-2013.pdf"," link":"http://dx.doi.org/10.1007/978-3-642-40229-6_5"},"keyword":["predictability","diagnosis","timed automata"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"http://science.mq.edu.au/~fcassez/bib/franck-bib.bib","dataSources":["8742EsvjQfyP2fYBW","qbqYFWskmoonRB43F","yYF8uwWqay28JyxZC"],"keywords":["predictability","diagnosis","timed automata"],"search_terms":["predictability","event","occurrences","timed","systems","cassez","grastien"],"title":"Predictability of Event Occurrences in Timed Systems","year":2013,"downloads":1}