Mila E. Majster-Cederbaum

Publication Activity (10 Years)

Years Active: 1976-2015
Publications (10 Years): 0

Top Topics

Pspace Complete

Strips Planning

Algebraic Operators

Software Architecture

Top Venues

Sci. Comput. Program.

Formal Methods Syst. Des.

Publications

Mila E. Majster-Cederbaum, Nils Semmelrock
A basis for compositionally ensuring safety properties and its connection to relational algebraic operators. Sci. Comput. Program. 98 (2015)
Mila E. Majster-Cederbaum, Nils Semmelrock
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete. GRAPHITE (2013)
Christian Lambertz, Mila E. Majster-Cederbaum
Efficient deadlock analysis of component-based software architectures. Sci. Comput. Program. 78 (12) (2013)
Moritz Martens, Mila E. Majster-Cederbaum
Deadlock-freedom in component systems with architectural constraints. Formal Methods Syst. Des. 41 (2) (2012)
Christian Lambertz, Mila E. Majster-Cederbaum
Analyzing Component-Based Systems on the Basis of Architectural Constraints. FSEN (2011)
Naijun Zhan, Mila E. Majster-Cederbaum
On hierarchically developing reactive systems. Inf. Comput. 208 (9) (2010)
Christian Lambertz, Mila E. Majster-Cederbaum
Port Protocols for Deadlock-Freedom of Component Systems ICE (2010)
Mila E. Majster-Cederbaum, Nils Semmelrock
Reachability in Tree-Like Component Systems is PSPACE-Complete. Electron. Notes Theor. Comput. Sci. 263 (2010)
Moritz Martens, Mila E. Majster-Cederbaum
Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation. TASE (2009)
Felix C. Freiling, Christian Lambertz, Mila E. Majster-Cederbaum
Modular Consensus Algorithms for the Crash-Recovery Model. PDCAT (2009)
Mila E. Majster-Cederbaum, Christoph Minnameier
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems. RP (2009)
Felix C. Freiling, Christian Lambertz, Mila E. Majster-Cederbaum
Easy Consensus Algorithms for the Crash-Recovery Model. DISC (2008)
Mila E. Majster-Cederbaum, Moritz Martens
Compositional analysis of deadlock-freedom for tree-like component architectures. EMSOFT (2008)
Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier
Liveness in Interaction Systems. Electron. Notes Theor. Comput. Sci. 215 (2008)
Mila E. Majster-Cederbaum, Christoph Minnameier
Everything Is PSPACE-Complete in Interaction Systems. ICTAC (2008)
Mila E. Majster-Cederbaum, Christoph Minnameier
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. SOFSEM (2008)
Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems. SOFSEM (1) (2007)
Mila E. Majster-Cederbaum, Moritz Martens
Robustness in Interaction Systems. FORTE (2007)
Mila E. Majster-Cederbaum, Nils Semmelrock, Verena Wolf
Interaction Models for Biochemical Reactions. BIOCOMP (2007)
Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis
An Approach to Modelling and Verification of Component Based Systems. SOFSEM (1) (2007)
Mila E. Majster-Cederbaum, Christoph Minnameier
Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa. ICTAC (2006)
Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum
Trace Semantics for Stochastic Systems with Nondeterminism. Electron. Notes Theor. Comput. Sci. 164 (3) (2006)
Harald Fecher, Mila E. Majster-Cederbaum
Action Refinement Applied to Late Decisions. Formal Aspects Comput. 18 (2) (2006)
Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum
Trace Machines for Observing Continuous-Time Markov Chains. Electron. Notes Theor. Comput. Sci. 153 (2) (2006)
Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue
Refinement of actions for real-time concurrent systems with causal ambiguity. Acta Informatica 42 (6-7) (2006)
Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis
Ensuring Properties of Interaction Systems. Program Analysis and Compilation (2006)
Naijun Zhan, Mila E. Majster-Cederbaum
Deriving Non-determinism from Conjunction and Disjunction. FORTE (2005)
Harald Fecher, Mila E. Majster-Cederbaum
Event Structures for Arbitrary Disruption. Fundam. Informaticae 68 (1-2) (2005)
Xiuli Sun, Jinzhao Wu, Xiaoyu Song, Mila E. Majster-Cederbaum
Formal Specification of an Asynchronous Processor via Action Refinement. MTV (2004)
Mila E. Majster-Cederbaum, Frank Salger
Towards the hierarchical verification of reactive systems. Theor. Comput. Sci. 318 (3) (2004)
Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue, Naijun Zhan
Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity. ICFEM (2004)
Mila E. Majster-Cederbaum, Jinzhao Wu
Adding Action Refinement to Stochastic True Concurrency Models. ICFEM (2003)
Mila E. Majster-Cederbaum, Naijun Zhan, Harald Fecher
Action Refinement from a Logical Point of View. VMCAI (2003)
Mila E. Majster-Cederbaum, Jinzhao Wu
Towards action refinement for true concurrent real time. Acta Informatica 39 (8) (2003)
Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu
Refinement of actions in a real-time process algebra with a true concurrency model. Electron. Notes Theor. Comput. Sci. 70 (3) (2002)
Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu
Action Refinement for Probabilistic Processes with True Concurrency Models. PAPM-PROBMIV (2002)
Harald Fecher, Mila E. Majster-Cederbaum
Taking decisions late: end-based choice combined with action refinement. Electron. Notes Theor. Comput. Sci. 70 (3) (2002)
Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu
Bundle event structures: A revised cpo approach. Inf. Process. Lett. 83 (1) (2002)
Mila E. Majster-Cederbaum, Jinzhao Wu
Action Refinement for True Concurrent Real Time. ICECCS (2001)
Mila E. Majster-Cederbaum
Underspecification for a simple process algebra of recursive processes. Theor. Comput. Sci. 266 (1-2) (2001)
Markus Roggenbach, Mila E. Majster-Cederbaum
Towards a unified view of bisimulation: a comparative study. Theor. Comput. Sci. 238 (1-2) (2000)
Mila E. Majster-Cederbaum, Frank Salger, Maria Sorea
A Priori Verification of Reactive Systems. FORTE (2000)
Mila E. Majster-Cederbaum, Frank Salger
Correctness by Construction: Towards Verification in Hierarchical System Development. SPIN (2000)
Christel Baier, Bettina Engelen, Mila E. Majster-Cederbaum
Deciding Bisimilarity and Similarity for Probabilistic Processes. J. Comput. Syst. Sci. 60 (1) (2000)
Mila E. Majster-Cederbaum, Frank Salger
A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic. ASIAN (1999)
Mila E. Majster-Cederbaum, Markus Roggenbach
Transistion Systems from Event Structures Revisited. Inf. Process. Lett. 67 (3) (1998)
Christel Baier, Mila E. Majster-Cederbaum
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. Fundam. Informaticae 29 (3) (1997)
Christel Baier, Mila E. Majster-Cederbaum
Metric Semantics from Partial Order Semantics. Acta Informatica 34 (9) (1997)
Christel Baier, Mila E. Majster-Cederbaum
The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach. Formal Aspects Comput. 9 (4) (1997)
Christel Baier, Mila E. Majster-Cederbaum
Denotational Linear Time Semantics and Sequential Composition. Inf. Process. Lett. 59 (3) (1996)
Christel Baier, Mila E. Majster-Cederbaum
A Categorical Characterization of Consistency Results. AMAST (1996)
Mila E. Majster-Cederbaum, Markus Roggenbach
On two different Characterizations of Bisimulation. Bull. EATCS 59 (1996)
Mila E. Majster-Cederbaum, Christel Baier
Metric Completion versus Ideal Completion. Theor. Comput. Sci. 170 (1-2) (1996)
Mila E. Majster-Cederbaum, Christel Baier
Metric completion versus ideal completion. STRICT (1995)
Christel Baier, Mila E. Majster-Cederbaum
Denotational Semantics in the CPO and Metric Approach. Theor. Comput. Sci. 135 (2) (1994)
Christel Baier, Mila E. Majster-Cederbaum
The Connection between an Event Structure Semantics and an Operational Semantics for TCSP. Acta Informatica 31 (1) (1994)
Mila E. Majster-Cederbaum, Frank Zetzsche
The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP. Theor. Comput. Sci. 124 (1) (1994)
Mila E. Majster-Cederbaum
Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time. Inf. Process. Lett. 43 (2) (1992)
Christel Baier, Mila E. Majster-Cederbaum
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. FCT (1991)
Mila E. Majster-Cederbaum, Frank Zetzsche
Towards a Foundation for Semantics in Complete Metric Spaces Inf. Comput. 90 (2) (1991)
Mila E. Majster-Cederbaum
The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. Inf. Process. Lett. 33 (1) (1989)
Mila E. Majster-Cederbaum
On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. Inf. Process. Lett. 29 (6) (1988)
Mila E. Majster-Cederbaum
Elimination of redundant operations in relational queries with general selection operators. Computing 34 (4) (1985)
Mila E. Majster-Cederbaum
A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs. Inf. Process. Lett. 11 (4/5) (1980)
Mila E. Majster-Cederbaum, Angelika Reiser
Efficient On-Line Construction and Correction of Position Trees. SIAM J. Comput. 9 (4) (1980)
Mila E. Majster-Cederbaum
Semantics: Algebras, Fixed Points, Axioms. ICALP (1980)
Mila E. Majster-Cederbaum, Angelika Reiser
An Efficient On-Line Position Tree Construction Algorithm. Theoretical Computer Science (1979)
Mila E. Majster-Cederbaum
Data Types, Abstract Data Types and Their Specification Problem. Theor. Comput. Sci. 8 (1979)
Mila E. Majster-Cederbaum
Extended Directed Graphs, a Formalism for Structured Data and Data Structures. Acta Informatica 8 (1977)
Mila E. Majster-Cederbaum
A Model for Data Structures. ECI (1976)