Export 74 results:
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
P. R. D'Argenio and Katoen, J. - P., A theory of stochastic systems part I: Stochastic automata, Inf. Comput., vol. 203, no. 1, pp. 1-38, 2005.PDF icon paper-3.pdf (530.65 KB)
P. R. D'Argenio, Sánchez Terraf, P., and Wolovick, N., Bisimulations for non-deterministic labelled Markov processes, Mathematical Structures in Computer Science, vol. 22, no. 1, pp. 43 - 68, 2012.PDF icon paper-39.pdf (250.46 KB)
P. R. D'Argenio, Gebler, D., and Lee, M. D., A general SOS theory for the specification of probabilistic transition systems, Inf. Comput., vol. 249, pp. 76–109, 2016.PDF icon paper-655.pdf (995.37 KB)
P. R. D'Argenio, Legay, A., Sedwards, S., and Traonouez, L. - M., Smart sampling for lightweight verification of Markov decision processes, International Journal on Software Tools for Technology Transfer, vol. 17, pp. 469–484, 2015.
P. R. D'Argenio, Gebler, D., and Lee, M. D., Axiomatizing Bisimulation Equivalences and Metrics from Probabilistic SOS Rules, in Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings, 2014, vol. 8412, pp. 289-303.PDF icon paper-413.pdf (345.34 KB)
P. R. D'Argenio and Baeten, J. C. M., Guest editors' introduction: Special issue on Probabilistic Techniques for the Design and Analysis of Systems, J. Log. Algebr. Program., vol. 56, pp. 1-2, 2003.
P. R. D'Argenio, Lee, M. D., and Monti, R. E., Input/Output Stochastic Automata - Compositionality and Determinism, in Formal Modeling and Analysis of Timed Systems - 14th International Conference, FORMATS 2016, Quebec, QC, Canada, August 24-26, 2016, Proceedings, vol. 9884, M. Fränzle and Markey, N. Springer, 2016, pp. 53–68.PDF icon paper-654.pdf (1.49 MB)
P. R. D'Argenio and Gebremichael, B., The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation, in CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005, vol. LNCS 3653, pp. 125-140.
P. R. D'Argenio, Wolovick, N., Sánchez Terraf, P., and Celayes, P., Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization, in QEST 2009, Sixth International Conference on the Quantitative Evaluation of Systems, 2009, pp. 11-20.PDF icon paper-16.pdf (525.46 KB)
P. R. D'Argenio, Lee, M. D., and Gebler, D., SOS rule formats for convex and abstract probabilistic bisimulations, in Proceedings of the Combined 22th International Workshop on Expressiveness in Concurrency and 12th Workshop on Structural Operational Semantics, and 12th Workshop on Structural Operational Semantics, {EXPRESS/SOS} 2015, Madrid, Spain, 31st August 2015., vol. 190, S. Crafa and Gebler, D. 2015, pp. 31–45.PDF icon paper-553.pdf (205.49 KB)
P. R. D'Argenio and Lee, M. D., Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation, in Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings, 2012, vol. 7213, pp. 452-466.PDF icon paper-123.pdf (269.47 KB)
P. R. D'Argenio, Barthe, G., Biewer, S., Finkbeiner, B., and Hermanns, H., Is Your Software on Dope? - Formal Analysis of Surreptitiously "enhanced" Programs, in Programming Languages and Systems - 26th European Symposium on Programming, {ESOP} 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, vol. 10201, H. Yang Springer, 2017, pp. 83–110.PDF icon paper-714.pdf (429.13 KB)
P. R. D'Argenio, Hartmanns, A., Legay, A., and Sedwards, S., Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata, in Integrated Formal Methods: 12th International Conference, IFM 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, vol. 9681, E. Ábrahám and Huisman, M. Springer, 2016, pp. 99-114.PDF icon paper-632.pdf (463.65 KB)
P. R. D'Argenio and Niebert, P., Partial Order Reduction on Concurrent Probabilistic Programs, in 1st International Conference on Quantitative Evaluation of Systems (QEST 2004), 2004, pp. 240-249.PDF icon paper-28.pdf (884.87 KB)
P. R. D'Argenio, Melgratti, H., and Sangiorgi, D., Special Issue: Selected Papers of the "24th International Conference on Concurrency Theory" CONCUR 2013, Logical Methods in Computer Science, 2015.
P. R. D'Argenio and Katoen, J. - P., A theory of Stochastic systems. Part II: Process algebra, Inf. Comput., vol. 203, no. 1, pp. 39-74, 2005.PDF icon paper-4.pdf (976.9 KB)
P. R. D'Argenio and Melgratti, H., CONCUR 2013 - Concurrency Theory - 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings, Lecture Notes in Computer Science, vol. 8052. Springer, 2013.
F. S. de Boer, Bravetti, M., Grabe, I., Lee, M. D., Steffen, M., and Zavattaro, G., A Petri Net Based Analysis of Deadlocks for Active Objects and Futures, in Formal Aspects of Component Software, 9th International Symposium, FACS 2012, Mountain View, CA, USA, September 12-14, 2012. Revised Selected Papers, 2013, vol. 7684, pp. 110-127.
E. E. Ferrero, De Francesco, J. P., Wolovick, N., and Cannas, S. A., q-state Potts model metastability study using optimized GPU-based Monte Carlo algorithms, Computer Physics Communications, vol. 183, pp. 1578-1587, 2012.PDF icon paper-128.pdf (692.27 KB)
M. Fränzle, Hahn, E. M., Hermanns, H., Wolovick, N., and Zhang, L., Measurability and safety verification for stochastic hybrid systems, in Proceedings of the 14th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2011, 2011, pp. 43-52.
S. Giro, D'Argenio, P. R., and Ferrer Fioriti, L. M., Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms, Theoretical Computer Science, vol. 538, pp. 84-102, 2014.PDF icon paper-425.pdf (689.43 KB)
S. Giro and D'Argenio, P. R., On the verification of probabilistic I/O automata with unspecified rates, in Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009, pp. 582-586.PDF icon paper-17.pdf (312.21 KB)
S. Giro, Undecidability Results for Distributed Probabilistic Systems, in Formal Methods: Foundations and Applications, 12th Brazilian Symposium on Formal Methods, SBMF 2009, 2009, vol. LNCS 5902, pp. 220-235.
S. Giro, On the automatic verification of Distributed Probabilistic Automata with Partial Information, Universidad Nacional de Córdoba, Córdoba, 2010.PDF icon paper-176.pdf (1.79 MB)
S. Giro and D'Argenio, P. R., Quantitative Model Checking Revisited: Neither Decidable Nor Approximable, in Formal Modeling and Analysis of Timed Systems, 5th International Conference, FORMATS 2007, 2007, vol. LNCS 4763, pp. 179-194.PDF icon paper-20.pdf (414.71 KB)


Powered by Drupal