Parametric probabilistic transition systems for system design and analysis-Reference-Cited by-同舟云学术

Parametric probabilistic transition systems for system design and analysis

Published:2007-03 Issue:1 Volume:19 Page:93-109
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Lanotte Ruggero¹,Maggiolo-Schettini Andrea²,Troina Angelo²

Affiliation:

1. Dipartimento di Scienze della Cultura, Politiche e dell’Informazione, Università dell’Insubria, Via Valleggio 11, 22100, Como, Italy

2. Dipartimento di Informatica, Universitá di pisa, Largo Pontecorvo 3, 56127, Pisa, Italy

Abstract

Abstract We develop a model of parametric probabilistic transition Systems (PPTSs), where probabilities associated with transitions may be parameters. We show how to find instances of the parameters that satisfy a given property and instances that either maximize or minimize the probability of reaching a certain state. As an application, we model a probabilistic non-repudiation protocol with a PPTS. The theory we develop allows us to find instances that maximize the probability that the protocol ends in a fair state (no participant has an advantage over the others).

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-006-0015-2.pdf

Reference45 articles.

1. Aldini A Gorrieri R (2002) Security analysis of a probabilistic non-repudiation protocol. In: Proceedings. of PAPM-PROBMIV’02 Springer LNCS 2399 pp 17–36

2. de Alfaro L (1998) How to specify and verify the long-run average behaviour of probabilistic systems. In: Proceedings of LICS’98 IEEE pp 454–465

3. de Alfaro L (1999) Computing minimum and maximum reachability times in probabilistic systems. In: Proceedings. of CONCUR’99 Springer LNCS 1664 pp 66–81

4. Alur R Henzinger TA Vardi MY (1993) Parametric real-time reasoning. In: Proceedings. of STOC’93 ACM pp 592–601

5. A theory of timed automata

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formally verifying decompositions of stochastic specifications;International Journal on Software Tools for Technology Transfer;2024-02-21

2. Parameter synthesis for Markov models: covering the parameter space;Formal Methods in System Design;2024-02-17

3. Qualitative reachability for open interval Markov chains;PeerJ Computer Science;2023-08-28

4. Interval Markov Decision Processes with Continuous Action-Spaces;Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control;2023-05-09

5. Formal Methods for Autonomous Systems;Foundations and Trends® in Systems and Control;2023