Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMila E. Majster-Cederbaum
Person information
- affiliation: LMU Munich, Germany
- affiliation (former): University of Mannheim, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j32]Mila E. Majster-Cederbaum, Nils Semmelrock:
A basis for compositionally ensuring safety properties and its connection to relational algebraic operators. Sci. Comput. Program. 98: 516-530 (2015)- 2013
- [j31]Christian Lambertz, Mila E. Majster-Cederbaum:
Efficient deadlock analysis of component-based software architectures. Sci. Comput. Program. 78(12): 2488-2510 (2013) - 2012
- [j30]Moritz Martens, Mila E. Majster-Cederbaum:
Deadlock-freedom in component systems with architectural constraints. Formal Methods Syst. Des. 41(2): 129-177 (2012) - 2010
- [j29]Naijun Zhan, Mila E. Majster-Cederbaum:
On hierarchically developing reactive systems. Inf. Comput. 208(9): 997-1019 (2010) - 2006
- [j28]Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue:
Refinement of actions for real-time concurrent systems with causal ambiguity. Acta Informatica 42(6-7): 389-418 (2006) - [j27]Harald Fecher, Mila E. Majster-Cederbaum:
Action Refinement Applied to Late Decisions. Formal Aspects Comput. 18(2): 211-230 (2006) - 2005
- [j26]Harald Fecher, Mila E. Majster-Cederbaum:
Event Structures for Arbitrary Disruption. Fundam. Informaticae 68(1-2): 103-130 (2005) - 2004
- [j25]Mila E. Majster-Cederbaum, Frank Salger:
Towards the hierarchical verification of reactive systems. Theor. Comput. Sci. 318(3): 243-296 (2004) - 2003
- [j24]Mila E. Majster-Cederbaum, Jinzhao Wu:
Towards action refinement for true concurrent real time. Acta Informatica 39(8): 531-577 (2003) - 2002
- [j23]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Bundle event structures: A revised cpo approach. Inf. Process. Lett. 83(1): 7-12 (2002) - 2001
- [j22]Mila E. Majster-Cederbaum:
Underspecification for a simple process algebra of recursive processes. Theor. Comput. Sci. 266(1-2): 935-950 (2001) - 2000
- [j21]Christel Baier, Bettina Engelen, Mila E. Majster-Cederbaum:
Deciding Bisimilarity and Similarity for Probabilistic Processes. J. Comput. Syst. Sci. 60(1): 187-231 (2000) - [j20]Markus Roggenbach
, Mila E. Majster-Cederbaum:
Towards a unified view of bisimulation: a comparative study. Theor. Comput. Sci. 238(1-2): 81-130 (2000) - 1998
- [j19]Mila E. Majster-Cederbaum, Markus Roggenbach:
Transistion Systems from Event Structures Revisited. Inf. Process. Lett. 67(3): 119-124 (1998) - 1997
- [j18]Christel Baier, Mila E. Majster-Cederbaum:
Metric Semantics from Partial Order Semantics. Acta Informatica 34(9): 701-735 (1997) - [j17]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): 425-445 (1997) - [j16]Christel Baier, Mila E. Majster-Cederbaum:
How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages. Fundam. Informaticae 29(3): 225-256 (1997) - 1996
- [j15]Mila E. Majster-Cederbaum, Markus Roggenbach:
On two different Characterizations of Bisimulation. Bull. EATCS 59 (1996) - [j14]Christel Baier, Mila E. Majster-Cederbaum:
Denotational Linear Time Semantics and Sequential Composition. Inf. Process. Lett. 59(3): 135-143 (1996) - [j13]Mila E. Majster-Cederbaum, Christel Baier:
Metric Completion versus Ideal Completion. Theor. Comput. Sci. 170(1-2): 145-171 (1996) - 1994
- [j12]Christel Baier, Mila E. Majster-Cederbaum:
The Connection between an Event Structure Semantics and an Operational Semantics for TCSP. Acta Informatica 31(1): 81-104 (1994) - [j11]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): 1-40 (1994) - [j10]Christel Baier, Mila E. Majster-Cederbaum:
Denotational Semantics in the CPO and Metric Approach. Theor. Comput. Sci. 135(2): 171-220 (1994) - 1992
- [j9]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
- [j8]Mila E. Majster-Cederbaum, Frank Zetzsche:
Towards a Foundation for Semantics in Complete Metric Spaces. Inf. Comput. 90(2): 217-243 (1991) - 1989
- [j7]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
- [j6]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) - 1985
- [j5]Mila E. Majster-Cederbaum:
Elimination of redundant operations in relational queries with general selection operators. Computing 34(4): 303-323 (1985) - 1980
- [j4]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) - [j3]Mila E. Majster-Cederbaum, Angelika Reiser:
Efficient On-Line Construction and Correction of Position Trees. SIAM J. Comput. 9(4): 785-807 (1980) - 1979
- [j2]Mila E. Majster-Cederbaum:
Data Types, Abstract Data Types and Their Specification Problem. Theor. Comput. Sci. 8: 89-127 (1979) - 1977
- [j1]Mila E. Majster-Cederbaum:
Extended Directed Graphs, a Formalism for Structured Data and Data Structures. Acta Informatica 8: 37-59 (1977)
Conference and Workshop Papers
- 2013
- [c38]Mila E. Majster-Cederbaum, Nils Semmelrock:
Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete. GRAPHITE 2013: 1-11 - 2011
- [c37]Christian Lambertz, Mila E. Majster-Cederbaum:
Analyzing Component-Based Systems on the Basis of Architectural Constraints. FSEN 2011: 64-79 - 2010
- [c36]Christian Lambertz, Mila E. Majster-Cederbaum:
Port Protocols for Deadlock-Freedom of Component Systems. ICE 2010: 7-11 - 2009
- [c35]Felix C. Freiling, Christian Lambertz, Mila E. Majster-Cederbaum:
Modular Consensus Algorithms for the Crash-Recovery Model. PDCAT 2009: 287-292 - [c34]Mila E. Majster-Cederbaum, Christoph Minnameier:
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems. RP 2009: 189-202 - [c33]Moritz Martens, Mila E. Majster-Cederbaum:
Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation. TASE 2009: 225-232 - [c32]Mila E. Majster-Cederbaum, Nils Semmelrock:
Reachability in Tree-Like Component Systems is PSPACE-Complete. FACS@FMWeek 2009: 197-210 - 2008
- [c31]Mila E. Majster-Cederbaum, Moritz Martens:
Compositional analysis of deadlock-freedom for tree-like component architectures. EMSOFT 2008: 199-206 - [c30]Mila E. Majster-Cederbaum, Christoph Minnameier:
Everything Is PSPACE-Complete in Interaction Systems. ICTAC 2008: 216-227 - [c29]Mila E. Majster-Cederbaum, Christoph Minnameier:
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. SOFSEM 2008: 352-363 - [c28]Felix C. Freiling, Christian Lambertz, Mila E. Majster-Cederbaum:
Easy Consensus Algorithms for the Crash-Recovery Model. DISC 2008: 507-508 - 2007
- [c27]Mila E. Majster-Cederbaum, Nils Semmelrock, Verena Wolf:
Interaction Models for Biochemical Reactions. BIOCOMP 2007: 480-486 - [c26]Mila E. Majster-Cederbaum, Moritz Martens:
Robustness in Interaction Systems. FORTE 2007: 325-340 - [c25]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 - [c24]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 - [c23]Mila E. Majster-Cederbaum, Moritz Martens, Christoph Minnameier:
Liveness in Interaction Systems. FACS 2007: 57-74 - 2006
- [c22]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 - [c21]Mila E. Majster-Cederbaum, Christoph Minnameier:
Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa. ICTAC 2006: 65-79 - [c20]Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum:
Trace Semantics for Stochastic Systems with Nondeterminism. QAPL 2006: 187-204 - 2005
- [c19]Naijun Zhan, Mila E. Majster-Cederbaum:
Deriving Non-determinism from Conjunction and Disjunction. FORTE 2005: 351-365 - [c18]Verena Wolf, Christel Baier, Mila E. Majster-Cederbaum:
Trace Machines for Observing Continuous-Time Markov Chains. QAPL 2005: 259-277 - 2004
- [c17]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 - [c16]Xiuli Sun, Jinzhao Wu, Xiaoyu Song, Mila E. Majster-Cederbaum:
Formal Specification of an Asynchronous Processor via Action Refinement. MTV 2004: 36-41 - 2003
- [c15]Mila E. Majster-Cederbaum, Jinzhao Wu:
Adding Action Refinement to Stochastic True Concurrency Models. ICFEM 2003: 226-245 - [c14]Mila E. Majster-Cederbaum, Naijun Zhan, Harald Fecher:
Action Refinement from a Logical Point of View. VMCAI 2003: 253-267 - 2002
- [c13]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Action Refinement for Probabilistic Processes with True Concurrency Models. PAPM-PROBMIV 2002: 77-94 - [c12]Harald Fecher, Mila E. Majster-Cederbaum:
Taking decisions late: end-based choice combined with action refinement. Refine 2002: 244-259 - [c11]Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Refinement of actions in a real-time process algebra with a true concurrency model. Refine 2002: 260-280 - 2001
- [c10]Mila E. Majster-Cederbaum, Jinzhao Wu:
Action Refinement for True Concurrent Real Time. ICECCS 2001: 58-68 - 2000
- [c9]Mila E. Majster-Cederbaum, Frank Salger, Maria Sorea:
A Priori Verification of Reactive Systems. FORTE 2000: 35-50 - [c8]Mila E. Majster-Cederbaum, Frank Salger:
Correctness by Construction: Towards Verification in Hierarchical System Development. SPIN 2000: 163-180 - 1999
- [c7]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 - 1996
- [c6]Christel Baier, Mila E. Majster-Cederbaum:
A Categorical Characterization of Consistency Results. AMAST 1996: 473-486 - 1995
- [c5]Mila E. Majster-Cederbaum, Christel Baier:
Metric completion versus ideal completion. STRICT 1995: 236-248 - 1991
- [c4]Christel Baier, Mila E. Majster-Cederbaum:
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. FCT 1991: 105-120 - 1980
- [c3]Mila E. Majster-Cederbaum:
Semantics: Algebras, Fixed Points, Axioms. ICALP 1980: 394-408 - 1979
- [c2]Mila E. Majster-Cederbaum, Angelika Reiser:
An Efficient On-Line Position Tree Construction Algorithm. Theoretical Computer Science 1979: 190-198 - 1976
- [c1]Mila E. Majster-Cederbaum:
A Model for Data Structures. ECI 1976: 161-177
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
