Mila E. Majster-Cederbaum

Sci. Comput. Program., 2015

2013

Efficient deadlock analysis of component-based software architectures.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2013

Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2nd Workshop on GRAPH Inspection and Traversal Engineering, 2013

2012

Deadlock-freedom in component systems with architectural constraints.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2012

2011

Analyzing Component-Based Systems on the Basis of Architectural Constraints.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

2010

On hierarchically developing reactive systems.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Port Protocols for Deadlock-Freedom of Component Systems

[BibT_eX]

[DOI]

Proceedings of the Proceedings Third Interaction and Concurrency Experience: Guaranteed Interaction, 2010

2009

Reachability in Tree-Like Component Systems is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Formal Aspects of Component Software, 2009

Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation.

[BibT_eX]

[DOI]

Proceedings of the TASE 2009, 2009

Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Modular Consensus Algorithms for the Crash-Recovery Model.

[BibT_eX]

[DOI]

Felix C. Freiling

Proceedings of the 2009 International Conference on Parallel and Distributed Computing, 2009

2008

Easy Consensus Algorithms for the Crash-Recovery Model.

[BibT_eX]

[DOI]

Felix C. Freiling

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Everything Is PSPACE-Complete in Interaction Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2008

Compositional analysis of deadlock-freedom for tree-like component architectures.

[BibT_eX]

[DOI]

Proceedings of the 8th ACM & IEEE International conference on Embedded software, 2008

2007

Liveness in Interaction Systems.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Formal Aspects of Component Software, 2007

A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

An Approach to Modelling and Verification of Component Based Systems.

[BibT_eX]

[DOI]

Gregor Gößler

Susanne Graf

Joseph Sifakis

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Robustness in Interaction Systems.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2007

Interaction Models for Biochemical Reactions.

[BibT_eX]

Verena Wolf

Proceedings of the International Conference on Bioinformatics & Computational Biology, 2007

2006

Action Refinement Applied to Late Decisions.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2006

Trace Semantics for Stochastic Systems with Nondeterminism.

[BibT_eX]

[DOI]

Verena Wolf

Proceedings of the 4th International Workshop on Quantitative Aspects of Programming Languages, 2006

Refinement of actions for real-time concurrent systems with causal ambiguity.

[BibT_eX]

[DOI]

Houguang Yue

Acta Informatica, 2006

Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2006

Ensuring Properties of Interaction Systems.

[BibT_eX]

[DOI]

Gregor Gößler

Susanne Graf

Joseph Sifakis

Proceedings of the Program Analysis and Compilation, 2006

2005

Event Structures for Arbitrary Disruption.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Trace Machines for Observing Continuous-Time Markov Chains.

[BibT_eX]

[DOI]

Verena Wolf

Proceedings of the Third Workshop on Quantitative Aspects of Programming Languages, 2005

Deriving Non-determinism from Conjunction and Disjunction.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

2004

Towards the hierarchical verification of reactive systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Formal Specification of an Asynchronous Processor via Action Refinement.

[BibT_eX]

[DOI]

Xiuli Sun

Xiaoyu Song

Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (MTV 2004), 2004

Refinement of Actions for Real-Time Concurrent Systems with Causal Ambiguity.

[BibT_eX]

[DOI]

Houguang Yue

Proceedings of the Formal Methods and Software Engineering, 2004

2003

Towards action refinement for true concurrent real time.

[BibT_eX]

[DOI]

Acta Informatica, 2003

Action Refinement from a Logical Point of View.

[BibT_eX]

[DOI]

Proceedings of the Verification, 2003

Adding Action Refinement to Stochastic True Concurrency Models.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods and Software Engineering, 2003

2002

Bundle event structures: A revised cpo approach.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Refinement of actions in a real-time process algebra with a true concurrency model.

[BibT_eX]

[DOI]

Proceedings of the BCS FACS Refinement Workshop 2002, 2002

Taking decisions late: end-based choice combined with action refinement.

[BibT_eX]

[DOI]

Proceedings of the BCS FACS Refinement Workshop 2002, 2002

Action Refinement for Probabilistic Processes with True Concurrency Models.

[BibT_eX]

[DOI]

Proceedings of the Process Algebra and Probabilistic Methods, 2002

2001

Underspecification for a simple process algebra of recursive processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Action Refinement for True Concurrent Real Time.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Engineering of Complex Computer Systems (ICECCS 2001), 2001

2000

Towards a unified view of bisimulation: a comparative study.

[BibT_eX]

[DOI]

Markus Roggenbach

Theor. Comput. Sci., 2000

Deciding Bisimilarity and Similarity for Probabilistic Processes.

[BibT_eX]

[DOI]

Bettina Engelen

J. Comput. Syst. Sci., 2000

Correctness by Construction: Towards Verification in Hierarchical System Development.

[BibT_eX]

[DOI]

Proceedings of the SPIN Model Checking and Software Verification, 7th International SPIN Workshop, Stanford, CA, USA, August 30, 2000

A Priori Verification of Reactive Systems.

[BibT_eX]

Maria Sorea

Proceedings of the Formal Techniques for Distributed System Development, 2000

1999

A Verification Technique Based on Syntactic Action Refinement in a TCSP-like Process Algebra and the Hennessy-Milner-Logic.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing Science, 1999

1998

Transistion Systems from Event Structures Revisited.

[BibT_eX]

[DOI]

Markus Roggenbach

Inf. Process. Lett., 1998

1997

How to Interpret and Establish Consistency Results for Semantics of Concurrent Programming Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

The Connection Between Initial and Unique Solutions of Domain Equations in the Partial Order and Metric Approach.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1997

Metric Semantics from Partial Order Semantics.

[BibT_eX]

[DOI]

Acta Informatica, 1997

1996

Metric Completion versus Ideal Completion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Denotational Linear Time Semantics and Sequential Composition.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

On two different Characterizations of Bisimulation.

[BibT_eX]

Markus Roggenbach

Bull. EATCS, 1996

A Categorical Characterization of Consistency Results.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1996

1994

The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP.

[BibT_eX]

[DOI]

Frank Zetzsche

Theor. Comput. Sci., 1994

Denotational Semantics in the CPO and Metric Approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

The Connection between an Event Structure Semantics and an Operational Semantics for TCSP.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1992

Ensuring the Existence of a BCNF-Decomposition that Preserves Functional Dependencies in O(N²) Time.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

1991

Towards a Foundation for Semantics in Complete Metric Spaces

[BibT_eX]

[DOI]

Frank Zetzsche

Inf. Comput., February, 1991

The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1989

The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

1985

Elimination of redundant operations in relational queries with general selection operators.

[BibT_eX]

[DOI]

Computing, 1985

1980

Efficient On-Line Construction and Correction of Position Trees.

[BibT_eX]

[DOI]

Angelika Reiser

SIAM J. Comput., 1980

A Simple Relation Between Relational and Predicate Transformer Semantics for Nondeterministic Programs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

Semantics: Algebras, Fixed Points, Axioms.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

1979

Data Types, Abstract Data Types and Their Specification Problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

An Efficient On-Line Position Tree Construction Algorithm.

[BibT_eX]

[DOI]

Angelika Reiser

Proceedings of the Theoretical Computer Science, 1979

1977

Extended Directed Graphs, a Formalism for Structured Data and Data Structures.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1976

A Model for Data Structures.

[BibT_eX]

[DOI]