- On semigroups defined by identity Smile Markovski # , Ana Sokolova # , Lidija Goracinova Ilieva +
- Coalgebraic Analysis of Probabilistic Systems
- Compositionality for Markov Reward Chains with Fast Transitions
- Traces, Executions and Schedulers, Coalgebraically
- Acta Informatica manuscript No. (will be inserted by the editor)
- Free Basic Process Algebra Smile Markovski, Ana Sokolova
- Runtime Programming through Model-Preserving, Scalable Runtime Patches
- On the functional equation A(x; B(x; y)) = y in the variety of
- Weak Bisimulation for ActionType Coalgebras 1
- Information-Acquisition-as-a-Service for Cyber-Physical Cloud Computing Silviu S. Craciunas Andreas Haas Christoph M. Kirsch Hannes Payer
- Concurrency and Scalability versus Fragmentation and Compaction with
- Term rewriting system for solving the word problem for sloops
- Scientific Annals of Computer Science vol.18, 2008 "Alexandru Ioan Cuza" University of Iasi, Romania
- Probabilistic Systems Coalgebraically: A Survey Ana Sokolova1,
- Brief Announcement: Scalability versus Semantics of Concurrent FIFO Queues
- Information Hiding in Probabilistic Concurrent Systems Miguel E. Andresa,1
- The Logical Execution Time Paradigm Christoph M. Kirsch and Ana Sokolova
- Power-aware Temporal Isolation with Variable-Bandwidth Servers
- Response Time versus Utilization in Scheduler Overhead Accounting
- Compositionality for Markov Reward Chains with Fast and Silent Transitions
- Programmable Temporal Isolation in Real-Time and Embedded Execution Environments
- Generic Trace Theory Ichiro Hasuo Bart Jacobs Ana Sokolova
- On compositions and paths for coalgebras Ana Sokolova
- Weak Bisimulation for Action-Type Coalgebras 1
- The Microcosm Principle and Concurrency in Coalgebras
- A hierarchy of probabilistic system types Falk Bartels a,1 , Ana Sokolova b,2,# Erik de Vink c
- Short-term Memory for Self-collecting Mutators Martin Aigner, Andreas Haas, Christoph M. Kirsch,
- Free Steiner Loops Smile Markovski, Ana Sokolova
- GENERIC TRACE SEMANTICS VIA COINDUCTION ICHIRO HASUO, BART JACOBS, AND ANA SOKOLOVA
- CTCS 2004 Preliminary Version Weak Bisimulation for Action-Type Coalgebras
- Runtime Programming through Model-Preserving, Scalable Runtime Patches
- PROCEEDINGS OF THE 4TH PROGRESS SYMPOSIUM ON EMBEDDED SYSTEMS PROGRESS/STW 2003, ISBN 90-73461-37-5 OCTOBRE 22, 2003, NBC NIEUWEGEIN, NL
- Information Hiding in Probabilistic Concurrent Systems
- A Companion to Coalgebraic Weak Bisimulation
- Electronic Notes in Theoretical Computer Science 82 No. 1 (2003) URL: http://www.elsevier.nl/locate/entcs/volume82.html 19 pages
- Probabilistic automata: system types, parallel composition and comparison
- Compositionality for Markov Reward Chains with Fast Transitions
- Free groupoids with the identity S. Markovski, L. Goracinova Ilieva, A. Sokolova
- Everyone Virtualizes Everything But Time Silviu Craciunas, Christoph Kirsch, Hannes Payer, Harald Rck, Ana Sokolova
- Coalgebraic Components in a Many-Sorted Microcosm
- On groupoids with identity x(xy) = y Lidija GoracinovaIlieva, Smile Markovski,
- Distributed, Modular HTL Thomas A. Henzinger Christoph M. Kirsch
- Trace Semantics via Determinization Bart Jacobs1
