Publications


 
• Suzana Andova, Sonja Georgievska,  Nikola Trcka, Branching Bisimulation Congruence for Probabilistic Systems, TCS(2011), doi:10.1016/j.tcs.2011.07.020 

• F.P.M. Stappers, S. Weber, M.A. Reniers, S. Andova, and I. Nagy, Formalizing a domain specific language using SOS: An industrial case study, In Proc. of 4the International Conference on Software Language Engineering - SLE 2011, Braga, Portugal, LNCS 6940, Springer 2011.

• Suzana Andova, Mark van den Brand, Luc Engelen, Prototyping the Semantics of a DSL using ASF+SDF: Link to Formal Verification of DSL Models, AMMSE 2011, EPTCS 56, pages 65-79, 2011. 

• Suzana Andova, Luuk Groenewegen, Erik P. de Vink: Towards reduction of Paradigm coordination models, PACO 2011, EPTCS 60, page 1-18, 2011.

• S. Andova, L.P.J. Groenewegen, E.P. de Vink, Dynamic consistency in process algebra: From Paradigm to ACP, Science of Computer Programming, 76(8):711-735, 2011

• S. Andova, L.P.J. Groenewegen, E.P. de Vink, Towards Dynamic Adaptation of Probabilistic Systems, In Proc. of 4th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation - ISOLA2010, Crete, Greece, LNCS 6414, pages 143-159, Berlin: Springer, 2010.

• S. Georgievska, S. Andova. Composing Systems while Preserving Probabilities, In Proc. of the 7th European Performance Engineering Workshop - EPEW 2010, Bertinoro, Italy, LNCS 6342, 268-283, Berlin: Springer, 2010.

• S. Georgievska, S. Andova. Retaining the probabilities in probabilistic testing theory. In Proc. of the Foundations of Software Science and Computational Structures - 13th International Conference, FoSSaCS'10, Paphos, Cyrpus, C.-H.L. Ong (Ed.), LNCS 6014, Berlin: Springer, 2010. (bibtex)

• S. Georgievska, S. Andova. Testing Probabilistic Processes: Can Random Choices Be Unobservable?, In Proc. of 8th Workshop on Quantitative Aspects of Programming Languages - QAPL 2010, Paphos, Cyprus, Elect. Notes of Theor. Comp. Sci., 2010. (bibtex)

• S. Andova, A. McIver, P. R. D'Argenio, P.J.L. Cuijpers, J. Markovski, C. Morgan, M. Núñez. Proceedings First Workshop on Quantitative Formal Methods: Theory and Applications, Elec. Proc. Theo. Comp. Sci. 13, 2009. (bibtex)

• S. Andova, L.P.J. Groenewegen, J.H.S. Verschuren and E.P. de Vink, Architecting Security with Paradigm in Architecting Dependable Systems VI, R. de Lemos, J.-C. Fabre, C. Gacek, F. Gadducci and M.H. ter Beek (eds.), Springer, LNCS 5835, pages 255-283, 2009. (bibtex)

• S. Andova, L.P.J. Groenewegen, J. Stafleu and E.P. de Vink, Formalizing Adaptation On-the-Fly in Proc. FOCLASA 2009, Rhodes, G. Salaün and M. Sirjani, Electr. Notes Theor. Comput. Sci., 255:23-44, 2009. (bibtex)

• S. Andova, S. Georgievska, On compositionality, efficiency, and applicability of abstraction in probabilistic systems, Proc. 35th Conference on Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic, M. Nielsen, A.Kucera, P.B. Miltersen, C. Palamidessi, P. Tuma and F.D. Valencia (eds.), LNCS 5404, pp. 67-78, 2009. (bibtex)

• S. Andova, C.J.F. Cremers, K. Gjøsteen, S. Mauw, S.F. Mjølsnes, S. Radomirovic, A framework for compositional verification of security protocols, Information and Computation, 206(2-4), pp. 425-459, 2008. (bibtex)

• D. Gligoroski, S. Andova, S.J. Knapskog, On the importance of the key separation principle for different modes of operation, Proc. 4th Information Security Practice and Experience Conference, ISPEC'08, Sydney, Austrialia, L. Chen, Y. Mu, W. Susilo (eds.), LNCS 4991, pp. 404-418, 2008. (bibtex)

• N. Trcka, S. Georgievska, J. Markovski, S. Andova, E.P. de Vink, Performance analysis of chi models using discrete-time probabilistic reward graphs, Proc. 9th International Workshop on Discrete Event Systems, WODES'08, Göteborg, Sweden, B. Lennartson, M. Fabian, K. Akesson, A. Giua and R. Kumar (eds.), pages 113-118, IEEE Explorer 2008. (bibtex)

• S. Andova, L.P.J. Groenewegen and E.P. de Vink, Dynamic Consistency in Process Algebra: From Paradigm to ACP, Proc. of the 7th International Workshop on the Foundations of Coordination Languages and Software Architectures FOCLASA'08, Reykjavik, C. Canal, P. Poizat and M. Sirjani (eds), Electron. Notes Theor. Comput. Sci. 229(2), pages 3-20, 2009. (bibtex)

• S. Andova,  L.P.J. Groenewegen, E.P. de Vink, System evolution by migration coordination. Proc. 7th Belgian-Netherlands Software Evolution Workshop, Benevol 2008, Eindhoven, The Netherlands, Computer Science Reports TU/e, Vol. 08-33, pp. 18-22, A. Serebrenik (Ed.), 2008, (bibtex)

• S. Andova, T. A.C. Willemse, The general alternating model: support for probabilities, parallelism and abstraction, 2nd Artist Workshop on Models of Computation and Communication, Eindhoven, The Netherlands, 2008.

• S. Andova, T. Willemse, Branching bisimulation for probabilistic systems: characteristics and decidability, Theoretical Computer Science, Vol. 356(3), pp. 3250-355, Elsevier, 2006. (bibtex)  (Also appears as technical report, University of Twente TR-CTIT-05-08, 2005.)

• S. Andova, J.C.M. Baeten, P.R. D’Argenio and T.A.C. Willemse. A Compositional Merge of Probabilistic Processes in the Alternating Model. In 18th Nordic Workshop on Programming Theory (NWPT’06). Reykjavik, Iceland. October, 2006.

• S. Andova, K. Gjøsteen, L. Kråkmo, S. F. Mjølsnes, S. Radomirović, An example of proving UC-realization with formal methods, In Proc. of the Workshop on Formal and Computational Cryptography, FCC 2006, Venice, Italy, 2006

• D. Gligoroski, S. Knapskog, S. Andova, Cryptcoding - Encryption and Error-Correction Coding in a Single Step, In Proc. of the 2006 International Conference on Security & Management as a part of WORLDCOMP'06, Las Vegas, USA, 2006

• D. Gligoroski, S. Knapskog, S. Andova, Schemes for Secure Management of Digitally Produced Documents, In Proc. of the 2nd International Conference on Internet and Society, Southampton, UK, 2006

• S. Andova, J. Baeten, T. Willemse, Complete axiomatization of branching bisimulation for probabilistic systems, 17th International Conference on Concurrency Theory, CONCUR’06, Bonn, Germany, 2006. (bibtex)

• Suzana Andova, Cas J. F. Cremers, Kristian Gjøsteen, Sjouke Mauw, Stig Fr. Mjølsnes, Sasa Radomirovic, A framework for compositional verification of security protocols, CoRR abs/cs/0611062, 2006.

• S. Andova, T. Willemse, Equivalences for silent transitions in probabilistic systems, Expressiveness in Concurrency EXPRESS 2004, London, Great Britain,  Electronic Notes in Theoretical Computer Science 128(2): 53-66, 2005.  (bibtex)

• S. Andova, H. Hermanns, J.-P. Katoen, Discrete-time rewards model-checked, Formal Modeling and Analysis of Timed Systems, FORMATS 2003, Marseille, France, K.G. Larsen, P. Niebert (eds.), LNCS 2791, Springer-Verlag, pp. 88-104, 2003. (bibtex)

• S. Andova, T. Willemse, Verification of random behaviours, Proc. Of the First South-East European Workshop on Formal Methods, SEEFM’03, Thessaloniki, Greece, 2003.

• S. Andova, T. Willemse, Verification of probabilistic systems - Concurrent Alternating Bit Protocol, 4th Conference in Informatics and Information Technology CIIT 2003, Bitola, Macedonia, 2003.

• S. Andova, J. C. M. Baeten, Alternative composition does not imply non-determinism, Bulletin of the Europian Association for Theoretical Computer Science 76, EATCS, pp. 125-127, Feb. 2002. (bibtex)

• S. Andova, Probabilistic Process Algebra, Ph.D. Thesis, Eindhoven University of Technology, 2002. (bibtex)

• S. Andova, J. C. M. Baeten, Abstraction in Probabilistic Process Algebra, Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2001, Genova, Italy, T. Margaria, W. Yi (eds.), LNCS 2031, Springer-Verlag, pp. 204-219, 2001. (bibtex)

• S. Andova, Time and Probability in Process Algebra, Algebraic Methodology and Software Technology, AMAST 2000, Iowa City, USA, T. Rus (ed.), LNCS 1816, Springer-Verlag, pp. 323-338, 2000. (bibtex)

• S. Andova, Process algebra with probabilistic choice, AMAST Workshop on Real-Time and Probabilistic Systems, ARTS'99, Bamberg, Germany, J.-P. Katoen (ed.) , LNCS 1601, Springer-Verlag, pp. 111-129, 1999. (bibtex)

• S. Andova, Process Algebra with probabilistic choice, Eindhoven University of Technology, CSR 99-12, 1999.

• S. Markovski, D. Gligoroski, S. Andova, Using quasigroups for one-one secure encoding, Proceedings of the VIII Conference on Logic and Computing - LIRA'97, Novi Sad, FR Yugoslavia, September 1997.

• S. Andova, Timed Process Algebras, M.Sc. thesis, Institute of Informatics, Faculty of Natural Sciences and Mathematics, University "Sts. Cyril and Methodius", 1997 (in Macedonian)

• D. Gligoroski, S. Markovski and S. Andova, Fast algorithm for coding messages with transformations on quasigroups, First Congress of the Mathematicians and Computer Scientists the Republic of Macedonia, 1996.

• S. Andova, D. Bosnacki, An Encoding of Lambda-calculus into Object Calculus for Asynchronous Communication, Proceedings of the VII Conference on Logic and Computing - LIRA'95, Novi Sad, FR Yugoslavia, September 1995.

 


Revised: 11/01/11.