Process Algebra with Probabilistic Choice. - Suzana Andova (ARTS, 1999)

Time and Probability in Process Algebra. - Suzana Andova (AMAST, 2000)

Abstraction in Probabilistic Process Algebra. - Suzana Andova; Jos C. M. Baeten (TACAS, 2001)

Alternative composition does not imply non-determinism. - Suzana Andova; Jos C. M. Baeten (Bull. EATCS, 2002)

Discrete-Time Rewards Model-Checked. - Suzana Andova; Holger Hermanns; Joost-Pieter Katoen (FORMATS, 2003)

Equivalences for Silent Transitions in Probabilistic Systems: (Extended Abstract). - Suzana Andova; Tim A. C. Willemse (EXPRESS, 2004)

A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification. - Suzana Andova; Jos C. M. Baeten; Tim A. C. Willemse (CONCUR, 2006)

Cryptcoding - Encryption and Error-Correction Coding in a Single Step. - Danilo Gligoroski; Svein J. Knapskog; Suzana Andova (Security and Management, 2006)

Branching bisimulation for probabilistic systems: Characteristics and decidability. - Suzana Andova; Tim A. C. Willemse (Theor. Comput. Sci., 2006)

Architecting Security with Paradigm. - Suzana Andova; Luuk Groenewegen; Jan H. S. Verschuren; Erik P. de Vink (WADS, 2008)

On the Importance of the Key Separation Principle for Different Modes of Operation. - Danilo Gligoroski; Suzana Andova; Svein J. Knapskog (ISPEC, 2008)

A framework for compositional verification of security protocols. - Suzana Andova; Cas Cremers; Kristian Gjøsteen; Sjouke Mauw; Stig Fr. Mjølsnes; Sasa Radomirovic (Inf. Comput., 2008)

On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems. - Suzana Andova; Sonja Georgievska (SOFSEM, 2009)

Testing Probabilistic Processes: Can Random Choices Be Unobservable? - Sonja Georgievska; Suzana Andova (CoRR, 2009)

Formalizing Adaptation On-the-Fly. - Suzana Andova; Luuk Groenewegen; J. Stafleu; Erik P. de Vink (FOCLASA, 2009)

Composing Systems While Preserving Probabilities. - Sonja Georgievska; Suzana Andova (EPEW, 2010)

Distributed Adaption of Dining Philosophers. - Suzana Andova; Luuk Groenewegen; Erik P. de Vink (FACS, 2010)

Retaining the Probabilities in Probabilistic Testing Theory. - Sonja Georgievska; Suzana Andova (FoSSaCS, 2010)

Towards Dynamic Adaptation of Probabilistic Systems. - Suzana Andova; Luuk Groenewegen; Erik P. de Vink (ISoLA (2), 2010)

Testing Reactive Probabilistic Processes - Sonja Georgievska; Suzana Andova (QAPL, 2010)

Formalizing a Domain Specific Language Using SOS: An Industrial Case Study. - Frank P. M. Stappers; Sven Weber; Michel A. Reniers; Suzana Andova; Istvan Nagy 001 (SLE, 2011)

Prototyping the Semantics of a DSL using ASF+SDF: Link to Formal Verification of DSL Models - Suzana Andova; Mark van den Brand; Luc Engelen (AMMSE, 2011)

Towards reduction of Paradigm coordination models - Suzana Andova; Luuk Groenewegen; Erik P. de Vink (PACO, 2011)

Dynamic consistency in process algebra: From Paradigm to ACP. - Suzana Andova; Luuk Groenewegen; Erik P. de Vink (Sci. Comput. Program., 2011)

Reusable and Correct Endogenous Model Transformations. - Suzana Andova; Mark G. J. van den Brand; Luc Engelen (ICMT@TOOLS, 2012)

Probabilistic CSP: Preserving the Laws via Restricted Schedulers. - Sonja Georgievska; Suzana Andova (MMB/DFT, 2012)

MDE Basics with a DSL Focus. - Suzana Andova; Mark G. J. van den Brand; Luc J. P. Engelen; Tom Verhoeff (SFM, 2012)

Probabilistic may/must testing: retaining probabilities by restricted schedulers. - Sonja Georgievska; Suzana Andova (Formal Aspects Comput., 2012)

Branching bisimulation congruence for probabilistic systems. - Suzana Andova; Sonja Georgievska; Nikola Trcka (Theor. Comput. Sci., 2012)

Applying Model Transformation and Event-B for Specifying an Industrial DSL. - Ulyana Tikhonova; Maarten Manders; Mark van den Brand; Suzana Andova; Tom Verhoeff (MoDeVVa@MoDELS, 2013)

Dynamic adaptation with distributed control in Paradigm. - Suzana Andova; Luuk Groenewegen; Erik P. de Vink (Sci. Comput. Program., 2014)