| 2008 |
|---|
| 57 | EE | Felix C. Freiling,
Christian Lambertz,
Mila E. Majster-Cederbaum:
Easy Consensus Algorithms for the Crash-Recovery Model.
DISC 2008: 507-508 |
| 56 | EE | Mila E. Majster-Cederbaum,
Moritz Martens:
Compositional analysis of deadlock-freedom for tree-like component architectures.
EMSOFT 2008: 199-206 |
| 55 | EE | Mila E. Majster-Cederbaum,
Christoph Minnameier:
Everything Is PSPACE-Complete in Interaction Systems.
ICTAC 2008: 216-227 |
| 54 | EE | Mila E. Majster-Cederbaum,
Christoph Minnameier:
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets.
SOFSEM 2008: 352-363 |
| 53 | EE | Mila E. Majster-Cederbaum,
Moritz Martens,
Christoph Minnameier:
Liveness in Interaction Systems.
Electr. Notes Theor. Comput. Sci. 215: 57-74 (2008) |
| 2007 |
|---|
| 52 | | Mila E. Majster-Cederbaum,
Nils Semmelrock,
Verena Wolf:
Interaction Models for Biochemical Reactions.
BIOCOMP 2007: 480-486 |
| 51 | EE | Mila E. Majster-Cederbaum,
Moritz Martens:
Robustness in Interaction Systems.
FORTE 2007: 325-340 |
| 50 | EE | 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: 295-308 |
| 49 | EE | Mila E. Majster-Cederbaum,
Moritz Martens,
Christoph Minnameier:
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems.
SOFSEM (1) 2007: 888-899 |
| 2006 |
|---|
| 48 | EE | Mila E. Majster-Cederbaum,
Christoph Minnameier:
Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa.
ICTAC 2006: 65-79 |
| 47 | EE | Gregor Gößler,
Susanne Graf,
Mila E. Majster-Cederbaum,
Moritz Martens,
Joseph Sifakis:
Ensuring Properties of Interaction Systems.
Program Analysis and Compilation 2006: 201-224 |
| 46 | EE | Mila E. Majster-Cederbaum,
Jinzhao Wu,
Houguang Yue:
Refinement of actions for real-time concurrent systems with causal ambiguity.
Acta Inf. 42(6-7): 389-418 (2006) |
| 45 | EE | Verena Wolf,
Christel Baier,
Mila E. Majster-Cederbaum:
Trace Machines for Observing Continuous-Time Markov Chains.
Electr. Notes Theor. Comput. Sci. 153(2): 259-277 (2006) |
| 44 | EE | Verena Wolf,
Christel Baier,
Mila E. Majster-Cederbaum:
Trace Semantics for Stochastic Systems with Nondeterminism.
Electr. Notes Theor. Comput. Sci. 164(3): 187-204 (2006) |
| 43 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Action Refinement Applied to Late Decisions.
Formal Asp. Comput. 18(2): 211-230 (2006) |
| 2005 |
|---|
| 42 | EE | Naijun Zhan,
Mila E. Majster-Cederbaum:
Deriving Non-determinism from Conjunction and Disjunction.
FORTE 2005: 351-365 |
| 41 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Event Structures for Arbitrary Disruption.
Fundam. Inform. 68(1-2): 103-130 (2005) |
| 2004 |
|---|
| 40 | EE | Mila E. Majster-Cederbaum,
Jinzhao Wu,
Houguang Yue,
Naijun Zhan:
Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity.
ICFEM 2004: 449-463 |
| 39 | EE | Xiuli Sun,
Jinzhao Wu,
Xiaoyu Song,
Mila E. Majster-Cederbaum:
Formal Specification of an Asynchronous Processor via Action Refinement.
MTV 2004: 36-41 |
| 38 | EE | Mila E. Majster-Cederbaum,
Frank Salger:
Towards the hierarchical verification of reactive systems.
Theor. Comput. Sci. 318(3): 243-296 (2004) |
| 2003 |
|---|
| 37 | EE | Mila E. Majster-Cederbaum,
Jinzhao Wu:
Adding Action Refinement to Stochastic True Concurrency Models.
ICFEM 2003: 226-245 |
| 36 | EE | Mila E. Majster-Cederbaum,
Naijun Zhan,
Harald Fecher:
Action Refinement from a Logical Point of View.
VMCAI 2003: 253-267 |
| 35 | EE | Mila E. Majster-Cederbaum,
Jinzhao Wu:
Towards action refinement for true concurrent real time.
Acta Inf. 39(8): 531-577 (2003) |
| 2002 |
|---|
| 34 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Action Refinement for Probabilistic Processes with True Concurrency Models.
PAPM-PROBMIV 2002: 77-94 |
| 33 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Refinement of actions in a real-time process algebra with a true concurrency model.
Electr. Notes Theor. Comput. Sci. 70(3): (2002) |
| 32 | EE | Harald Fecher,
Mila E. Majster-Cederbaum:
Taking decisions late: end-based choice combined with action refinement.
Electr. Notes Theor. Comput. Sci. 70(3): (2002) |
| 31 | EE | Harald Fecher,
Mila E. Majster-Cederbaum,
Jinzhao Wu:
Bundle event structures: A revised cpo approach.
Inf. Process. Lett. 83(1): 7-12 (2002) |
| 2001 |
|---|
| 30 | EE | Mila E. Majster-Cederbaum,
Jinzhao Wu:
Action Refinement for True Concurrent Real Time.
ICECCS 2001: 58-68 |
| 29 | EE | Mila E. Majster-Cederbaum:
Underspecification for a simple process algebra of recursive processes.
Theor. Comput. Sci. 266(1-2): 935-950 (2001) |
| 2000 |
|---|
| 28 | | Mila E. Majster-Cederbaum,
Frank Salger,
Maria Sorea:
A Priori Verification of Reactive Systems.
FORTE 2000: 35-50 |
| 27 | | Mila E. Majster-Cederbaum,
Frank Salger:
Correctness by Construction: Towards Verification in Hierarchical System Development.
SPIN 2000: 163-180 |
| 26 | | Christel Baier,
Bettina Engelen,
Mila E. Majster-Cederbaum:
Deciding Bisimilarity and Similarity for Probabilistic Processes.
J. Comput. Syst. Sci. 60(1): 187-231 (2000) |
| 25 | EE | Markus Roggenbach,
Mila E. Majster-Cederbaum:
Towards a unified view of bisimulation: a comparative study.
Theor. Comput. Sci. 238(1-2): 81-130 (2000) |
| 1999 |
|---|
| 24 | EE | 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: 379-380 |
| 1998 |
|---|
| 23 | EE | Mila E. Majster-Cederbaum,
Markus Roggenbach:
Transistion Systems from Event Structures Revisited.
Inf. Process. Lett. 67(3): 119-124 (1998) |
| 1997 |
|---|
| 22 | EE | Christel Baier,
Mila E. Majster-Cederbaum:
Metric Semantics from Partial Order Semantics.
Acta Inf. 34(9): 701-735 (1997) |
| 21 | | Christel Baier,
Mila E. Majster-Cederbaum:
The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach.
Formal Asp. Comput. 9(4): 425-445 (1997) |
| 20 | | Christel Baier,
Mila E. Majster-Cederbaum:
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages.
Fundam. Inform. 29(3): 225-256 (1997) |
| 1996 |
|---|
| 19 | | Christel Baier,
Mila E. Majster-Cederbaum:
A Categorical Characterization of Consistency Results.
AMAST 1996: 473-486 |
| 18 | | Mila E. Majster-Cederbaum,
Markus Roggenbach:
On two different Characterizations of Bisimulation.
Bulletin of the EATCS 59: (1996) |
| 17 | EE | Christel Baier,
Mila E. Majster-Cederbaum:
Denotational Linear Time Semantics and Sequential Composition.
Inf. Process. Lett. 59(3): 135-143 (1996) |
| 16 | EE | Mila E. Majster-Cederbaum,
Christel Baier:
Metric Completion versus Ideal Completion.
Theor. Comput. Sci. 170(1-2): 145-171 (1996) |
| 1994 |
|---|
| 15 | | Christel Baier,
Mila E. Majster-Cederbaum:
The Connection between an Event Structure Semantics and an Operational Semantics for TCSP.
Acta Inf. 31(1): 81-104 (1994) |
| 14 | | Mila E. Majster-Cederbaum,
F. Zetzsche:
The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP.
Theor. Comput. Sci. 124(1): 1-40 (1994) |
| 13 | | Christel Baier,
Mila E. Majster-Cederbaum:
Denotational Semantics in the CPO and Metric Approach.
Theor. Comput. Sci. 135(2): 171-220 (1994) |
| 1992 |
|---|
| 12 | | Mila E. Majster-Cederbaum:
Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time.
Inf. Process. Lett. 43(2): 95-100 (1992) |
| 1991 |
|---|
| 11 | | Christel Baier,
Mila E. Majster-Cederbaum:
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP.
FCT 1991: 105-120 |
| 10 | | Mila E. Majster-Cederbaum,
F. Zetzsche:
Towards a Foundation for Semantics in Complete Metric Spaces
Inf. Comput. 90(2): 217-243 (1991) |
| 1989 |
|---|
| 9 | | 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): 15-19 (1989) |
| 1988 |
|---|
| 8 | | Mila E. Majster-Cederbaum:
On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.
Inf. Process. Lett. 29(6): 277-281 (1988) |
| 1980 |
|---|
| 7 | | Mila E. Majster-Cederbaum:
Semantics: Algebras, Fixed Points, Axioms.
ICALP 1980: 394-408 |
| 6 | | Mila E. Majster-Cederbaum:
A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs.
Inf. Process. Lett. 11(4/5): 190-192 (1980) |
| 5 | | Mila E. Majster-Cederbaum,
Angelika Reiser:
Efficient On-Line Construction and Correction of Position Trees.
SIAM J. Comput. 9(4): 785-807 (1980) |
| 1979 |
|---|
| 4 | | Mila E. Majster-Cederbaum,
Angelika Reiser:
An Efficient On-Line Position Tree Construction Algorithm.
Theoretical Computer Science 1979: 190-198 |
| 3 | | Mila E. Majster-Cederbaum:
Data Types, Abstract Data Types and Their Specification Problem.
Theor. Comput. Sci. 8: 89-127 (1979) |
| 1977 |
|---|
| 2 | | Mila E. Majster-Cederbaum:
Extended Directed Graphs, a Formalism for Structured Data and Data Structures
Acta Inf. 8: 37-59 (1977) |
| 1976 |
|---|
| 1 | | Mila E. Majster-Cederbaum:
A Model for Data Structures.
ECI 1976: 161-177 |
