A Model for Data Structures. - Mila E. Majster-Cederbaum (ECI, 1976)

Extended Directed Graphs, a Formalism for Structured Data and Data Structures. - Mila E. Majster-Cederbaum (Acta Informatica, 1977)

An Efficient On-Line Position Tree Construction Algorithm. - Mila E. Majster-Cederbaum; Angelika Reiser (Theoretical Computer Science, 1979)

Data Types, Abstract Data Types and Their Specification Problem. - Mila E. Majster-Cederbaum (Theor. Comput. Sci., 1979)

Semantics: Algebras, Fixed Points, Axioms. - Mila E. Majster-Cederbaum (ICALP, 1980)

A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs. - Mila E. Majster-Cederbaum (Inf. Process. Lett., 1980)

Efficient On-Line Construction and Correction of Position Trees. - Mila E. Majster-Cederbaum; Angelika Reiser (SIAM J. Comput., 1980)

Elimination of redundant operations in relational queries with general selection operators. - Mila E. Majster-Cederbaum (Computing, 1985)

On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. - Mila E. Majster-Cederbaum (Inf. Process. Lett., 1988)

The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. - Mila E. Majster-Cederbaum (Inf. Process. Lett., 1989)

The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. - Christel Baier; Mila E. Majster-Cederbaum (FCT, 1991)

Towards a Foundation for Semantics in Complete Metric Spaces - Mila E. Majster-Cederbaum; Frank Zetzsche (Inf. Comput., 1991)

Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time. - Mila E. Majster-Cederbaum (Inf. Process. Lett., 1992)

The Connection between an Event Structure Semantics and an Operational Semantics for TCSP. - Christel Baier; Mila E. Majster-Cederbaum (Acta Informatica, 1994)

Denotational Semantics in the CPO and Metric Approach. - Christel Baier; Mila E. Majster-Cederbaum (Theor. Comput. Sci., 1994)

The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP. - Mila E. Majster-Cederbaum; Frank Zetzsche (Theor. Comput. Sci., 1994)

A Categorical Characterization of Consistency Results. - Christel Baier; Mila E. Majster-Cederbaum (AMAST, 1996)

On two different Characterizations of Bisimulation. - Mila E. Majster-Cederbaum; Markus Roggenbach (Bull. EATCS, 1996)

Denotational Linear Time Semantics and Sequential Composition. - Christel Baier; Mila E. Majster-Cederbaum (Inf. Process. Lett., 1996)

Metric Completion versus Ideal Completion. - Mila E. Majster-Cederbaum; Christel Baier (Theor. Comput. Sci., 1996)

Metric Semantics from Partial Order Semantics. - Christel Baier; Mila E. Majster-Cederbaum (Acta Informatica, 1997)

The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach. - Christel Baier; Mila E. Majster-Cederbaum (Formal Aspects Comput., 1997)

How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. - Christel Baier; Mila E. Majster-Cederbaum (Fundam. Informaticae, 1997)

Transistion Systems from Event Structures Revisited. - Mila E. Majster-Cederbaum; Markus Roggenbach (Inf. Process. Lett., 1998)

A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic. - Mila E. Majster-Cederbaum; Frank Salger (ASIAN, 1999)

A Priori Verification of Reactive Systems. - Mila E. Majster-Cederbaum; Frank Salger; Maria Sorea (FORTE, 2000)

Correctness by Construction: Towards Verification in Hierarchical System Development. - Mila E. Majster-Cederbaum; Frank Salger (SPIN, 2000)

Deciding Bisimilarity and Similarity for Probabilistic Processes. - Christel Baier; Bettina Engelen; Mila E. Majster-Cederbaum (J. Comput. Syst. Sci., 2000)

Towards a unified view of bisimulation: a comparative study. - Markus Roggenbach; Mila E. Majster-Cederbaum (Theor. Comput. Sci., 2000)

Action Refinement for True Concurrent Real Time. - Mila E. Majster-Cederbaum; Jinzhao Wu (ICECCS, 2001)

Underspecification for a simple process algebra of recursive processes. - Mila E. Majster-Cederbaum (Theor. Comput. Sci., 2001)

Action Refinement for Probabilistic Processes with True Concurrency Models. - Harald Fecher; Mila E. Majster-Cederbaum; Jinzhao Wu (PAPM-PROBMIV, 2002)

Taking decisions late: end-based choice combined with action refinement. - Harald Fecher; Mila E. Majster-Cederbaum (Refine, 2002)

Refinement of actions in a real-time process algebra with a true concurrency model. - Harald Fecher; Mila E. Majster-Cederbaum; Jinzhao Wu (Refine, 2002)

Bundle event structures: A revised cpo approach. - Harald Fecher; Mila E. Majster-Cederbaum; Jinzhao Wu (Inf. Process. Lett., 2002)

Adding Action Refinement to Stochastic True Concurrency Models. - Mila E. Majster-Cederbaum; Jinzhao Wu (ICFEM, 2003)

Action Refinement from a Logical Point of View. - Mila E. Majster-Cederbaum; Naijun Zhan; Harald Fecher (VMCAI, 2003)

Towards action refinement for true concurrent real time. - Mila E. Majster-Cederbaum; Jinzhao Wu (Acta Informatica, 2003)

Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity. - Mila E. Majster-Cederbaum; Jinzhao Wu; Houguang Yue; Naijun Zhan (ICFEM, 2004)

Formal Specification of an Asynchronous Processor via Action Refinement. - Xiuli Sun; Jinzhao Wu; Xiaoyu Song; Mila E. Majster-Cederbaum (MTV, 2004)

Towards the hierarchical verification of reactive systems. - Mila E. Majster-Cederbaum; Frank Salger (Theor. Comput. Sci., 2004)

Deriving Non-determinism from Conjunction and Disjunction. - Naijun Zhan; Mila E. Majster-Cederbaum (FORTE, 2005)

Trace Machines for Observing Continuous-Time Markov Chains. - Verena Wolf; Christel Baier; Mila E. Majster-Cederbaum (QAPL, 2005)

Event Structures for Arbitrary Disruption. - Harald Fecher; Mila E. Majster-Cederbaum (Fundam. Informaticae, 2005)

Ensuring Properties of Interaction Systems. - Gregor Gößler; Susanne Graf; Mila E. Majster-Cederbaum; Moritz Martens; Joseph Sifakis (Program Analysis and Compilation, 2006)

Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa. - Mila E. Majster-Cederbaum; Christoph Minnameier (ICTAC, 2006)

Refinement of actions for real-time concurrent systems with causal ambiguity. - Mila E. Majster-Cederbaum; Jinzhao Wu; Houguang Yue (Acta Informatica, 2006)

Trace Semantics for Stochastic Systems with Nondeterminism. - Verena Wolf; Christel Baier; Mila E. Majster-Cederbaum (QAPL, 2006)

Action Refinement Applied to Late Decisions. - Harald Fecher; Mila E. Majster-Cederbaum (Formal Aspects Comput., 2006)

Interaction Models for Biochemical Reactions. - Mila E. Majster-Cederbaum; Nils Semmelrock; Verena Wolf (BIOCOMP, 2007)

Robustness in Interaction Systems. - Mila E. Majster-Cederbaum; Moritz Martens (FORTE, 2007)

An Approach to Modelling and Verification of Component Based Systems. - Gregor Gößler; Susanne Graf; Mila E. Majster-Cederbaum; Moritz Martens; Joseph Sifakis (SOFSEM (1), 2007)

A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems. - Mila E. Majster-Cederbaum; Moritz Martens; Christoph Minnameier (SOFSEM (1), 2007)

Liveness in Interaction Systems. - Mila E. Majster-Cederbaum; Moritz Martens; Christoph Minnameier (FACS, 2007)

Compositional analysis of deadlock-freedom for tree-like component architectures. - Mila E. Majster-Cederbaum; Moritz Martens (EMSOFT, 2008)

Everything Is PSPACE-Complete in Interaction Systems. - Mila E. Majster-Cederbaum; Christoph Minnameier (ICTAC, 2008)

Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. - Mila E. Majster-Cederbaum; Christoph Minnameier (SOFSEM, 2008)

Easy Consensus Algorithms for the Crash-Recovery Model. - Felix C. Freiling; Christian Lambertz; Mila E. Majster-Cederbaum (DISC, 2008)

Modular Consensus Algorithms for the Crash-Recovery Model. - Felix C. Freiling; Christian Lambertz; Mila E. Majster-Cederbaum (PDCAT, 2009)

Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems. - Mila E. Majster-Cederbaum; Christoph Minnameier (RP, 2009)

Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation. - Moritz Martens; Mila E. Majster-Cederbaum (TASE, 2009)

Reachability in Tree-Like Component Systems is PSPACE-Complete. - Mila E. Majster-Cederbaum; Nils Semmelrock (FACS@FMWeek, 2009)

Port Protocols for Deadlock-Freedom of Component Systems - Christian Lambertz; Mila E. Majster-Cederbaum (ICE, 2010)

On hierarchically developing reactive systems. - Naijun Zhan; Mila E. Majster-Cederbaum (Inf. Comput., 2010)

Analyzing Component-Based Systems on the Basis of Architectural Constraints. - Christian Lambertz; Mila E. Majster-Cederbaum (FSEN, 2011)

Deadlock-freedom in component systems with architectural constraints. - Moritz Martens; Mila E. Majster-Cederbaum (Formal Methods Syst. Des., 2012)

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete. - Mila E. Majster-Cederbaum; Nils Semmelrock (GRAPHITE, 2013)

Efficient deadlock analysis of component-based software architectures. - Christian Lambertz; Mila E. Majster-Cederbaum (Sci. Comput. Program., 2013)

A basis for compositionally ensuring safety properties and its connection to relational algebraic operators. - Mila E. Majster-Cederbaum; Nils Semmelrock (Sci. Comput. Program., 2015)