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