Mila E. Majster-Cederbaum

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