Zobrazeno 1 - 10
of 17
pro vyhledávání: '"EC Grant Agreement nr.: FP7/295261"'
Autor:
Hermanns, H., Krämer, Julia, Krčál, Jan, Stoelinga, Mariëlle Ida Antoinette, Piessens, Frank, Viganò, Luca
Publikováno v:
Proceedings of the 5th International Conference on Principles of Security and Trust, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, 163-185
STARTPAGE=163;ENDPAGE=185;TITLE=Proceedings of the 5th International Conference on Principles of Security and Trust, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016
Lecture Notes in Computer Science ISBN: 9783662496343
POST
STARTPAGE=163;ENDPAGE=185;TITLE=Proceedings of the 5th International Conference on Principles of Security and Trust, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016
Lecture Notes in Computer Science ISBN: 9783662496343
POST
Success or failure of attacks on high-security systems, such as hacker attacks on sensitive data, depend on various situational conditions, including the timing and success chances of single attack steps, and concurrent countermeasures of the defende
Publikováno v:
Semantics, Logics, and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays, 214-235
STARTPAGE=214;ENDPAGE=235;TITLE=Semantics, Logics, and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays
Semantics, Logics, and Calculi ISBN: 9783319278094
Semantics, Logics, and Calculi
STARTPAGE=214;ENDPAGE=235;TITLE=Semantics, Logics, and Calculi: Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays
Semantics, Logics, and Calculi ISBN: 9783319278094
Semantics, Logics, and Calculi
Several formalisms for concurrent computation have been proposed in recent years that incorporate means to express stochastic continuous-time dynamics and non-determinism. In this setting, some obscure phenomena are known to exist, related to the fac
Autor:
Mark Timmer, Arnd Hartmanns
Publikováno v:
International journal on software tools for technology transfer, 17(4), 429-456. Springer
Statistical model checking (SMC) is an analysis method that circumvents the state space explosion problem in model-based verification by combining probabilistic simulation with statistical methods that provide clear error bounds. As a simulation-base
Autor:
Guck, Dennis, Timmer, Mark, Hatefi, Hassan, Ruijters, Enno J.J., Stoelinga, Mariëlle I.A., Cassez, Franck, Raskin, Jean-François
Publikováno v:
Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014, 168-184
STARTPAGE=168;ENDPAGE=184;TITLE=Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA
STARTPAGE=168;ENDPAGE=184;TITLE=Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis, ATVA 2014
Automated Technology for Verification and Analysis ISBN: 9783319119359
ATVA
Costs and rewards are important ingredients for many types of systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata
Publikováno v:
Proceedings of the 22nd European Symposium on Programming (ESOP 2013), 411-430
STARTPAGE=411;ENDPAGE=430;TITLE=Proceedings of the 22nd European Symposium on Programming (ESOP 2013)
Programming Languages and Systems ISBN: 9783642370359
ESOP
STARTPAGE=411;ENDPAGE=430;TITLE=Proceedings of the 22nd European Symposium on Programming (ESOP 2013)
Programming Languages and Systems ISBN: 9783642370359
ESOP
In concurrent systems, the choice of executing the next transition depends both on the timing between the agents that make independent or collaborative interactions available, and on the conflicts (nondeterministic choices) with other transitions. Th
Publikováno v:
Proceedings of the Third International Conference on Principles and Security of Trust, POST 2014, 285-305
STARTPAGE=285;ENDPAGE=305;TITLE=Proceedings of the Third International Conference on Principles and Security of Trust, POST 2014
Lecture Notes in Computer Science ISBN: 9783642547911
POST
STARTPAGE=285;ENDPAGE=305;TITLE=Proceedings of the Third International Conference on Principles and Security of Trust, POST 2014
Lecture Notes in Computer Science ISBN: 9783642547911
POST
The success of a security attack crucially depends on time: the more time available to the attacker, the higher the probability of a successful attack; when given enough time, any system can be compromised. Insight in time-dependent behaviors of atta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5860d78114cbcb63e6b6c3388bb4fdf1
https://research.utwente.nl/en/publications/7a3e4477-de68-4c7a-96c1-9c243bf22909
https://research.utwente.nl/en/publications/7a3e4477-de68-4c7a-96c1-9c243bf22909
Publikováno v:
University of Twente Research Information (Pure Portal)
Costs and rewards are important ingredients for cyberphysical systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::3ce0f1af1b6606af62009eae60f896b9
https://research.utwente.nl/en/publications/modelling-and-analysis-of-markov-reward-automata-extended-version(70bf3bde-ea44-4dbc-947d-ed9a5c1cea97).html
https://research.utwente.nl/en/publications/modelling-and-analysis-of-markov-reward-automata-extended-version(70bf3bde-ea44-4dbc-947d-ed9a5c1cea97).html
Costs and rewards are important ingredients for cyberphysical systems, modelling critical aspects like energy consumption, task completion, repair costs, and memory usage. This paper introduces Markov reward automata, an extension of Markov automata
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::6405fd69f40697f306984fe0fcbfa61f
Publikováno v:
ISSUE=10;STARTPAGE=72;ENDPAGE=88;TITLE=10th International Conference on Quantitative Evaluation of Systems, QEST 2013
Quantitative Evaluation of Systems ISBN: 9783642401954
QEST
Quantitative Evaluation of Systems ISBN: 9783642401954
QEST
Probabilistic automata (PA) are a prominent compositional concurrency model. As a way to justify property-preserving abstractions, in the last years, bisimulation relations over probability distributions have been proposed both in the strong and the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90c424abc8a5f420c3c50eab1dc2302a
https://research.utwente.nl/en/publications/05799566-c2a7-4ea1-be81-e6b6760b646d
https://research.utwente.nl/en/publications/05799566-c2a7-4ea1-be81-e6b6760b646d
Autor:
Katoen, Joost P.
Publikováno v:
24th International Conference on Concurrency Theory, CONCUR 2013, 44-45
STARTPAGE=44;ENDPAGE=45;TITLE=24th International Conference on Concurrency Theory, CONCUR 2013
STARTPAGE=44;ENDPAGE=45;TITLE=24th International Conference on Concurrency Theory, CONCUR 2013
Treating random phenomena in concurrency theory has a long tradition. Petri nets [18, 10] and process algebras [14] have been extended with probabilities. The same applies to behavioural semantics such as strong and weak (bi)simulation [1], and testi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::ff209f5a56a8df035689d858a21967e3
https://research.utwente.nl/en/publications/concurrency-meets-probability-theory-and-practice-abstract(f18633f6-ac0b-481b-8ab2-16509678472d).html
https://research.utwente.nl/en/publications/concurrency-meets-probability-theory-and-practice-abstract(f18633f6-ac0b-481b-8ab2-16509678472d).html