| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7314999 (Why is no real title available?) | 2021-02-24 | Paper |
scientific article; zbMATH DE number 7314999 (Why is no real title available?)
(available as arXiv preprint) | 2021-02-24 | Paper |
Transition systems from event structures revisited
Information Processing Letters | 2016-06-09 | Paper |
Deadlock-freedom in component systems with architectural constraints
Formal Methods in System Design | 2014-03-28 | Paper |
| Refinement of actions in a real-time process algebra with a true concurrency model | 2013-08-19 | Paper |
| Taking decisions late: end-based choice combined with action refinement | 2013-08-19 | Paper |
Analyzing component-based systems on the basis of architectural constraints
Fundamentals of Software Engineering | 2012-06-29 | Paper |
On hierarchically developing reactive systems
Information and Computation | 2010-10-07 | Paper |
Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-Based Systems
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Robustness in Interaction Systems
Lecture Notes in Computer Science | 2009-03-10 | Paper |
Everything Is PSPACE-Complete in Interaction Systems
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa
Lecture Notes in Computer Science | 2008-09-11 | Paper |
An Approach to Modelling and Verification of Component Based Systems
Lecture Notes in Computer Science | 2008-03-07 | Paper |
A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Ensuring Properties of Interaction Systems
Program Analysis and Compilation, Theory and Practice | 2007-09-24 | Paper |
Action refinement applied to late decisions
Formal Aspects of Computing | 2006-10-25 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
| Event structures for arbitrary disruption | 2006-06-19 | Paper |
Refinement of actions for real-time concurrent systems with causal ambiguity
Acta Informatica | 2006-05-26 | Paper |
| scientific article; zbMATH DE number 2090704 (Why is no real title available?) | 2004-08-13 | Paper |
Towards the hierarchical verification of reactive systems
Theoretical Computer Science | 2004-08-10 | Paper |
Towards action refinement for true concurrent real time
Acta Informatica | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 1953035 (Why is no real title available?) | 2003-07-25 | Paper |
Bundle event structures: a revised cpo approach.
Information Processing Letters | 2003-01-21 | Paper |
Underspecification for a simple process algebra of recursive processes.
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1670558 (Why is no real title available?) | 2002-01-14 | Paper |
Towards a unified view of bisimulation: A comparative study
Theoretical Computer Science | 2000-08-21 | Paper |
Deciding bisimilarity and similarity for probabilistic processes.
Journal of Computer and System Sciences | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1113858 (Why is no real title available?) | 1998-03-02 | Paper |
The connection between initial and unique solutions of domain equations in the partial order and metric approach
Formal Aspects of Computing | 1998-02-04 | Paper |
| scientific article; zbMATH DE number 1023018 (Why is no real title available?) | 1997-09-15 | Paper |
Metric semantics from partial order semantics
Acta Informatica | 1997-09-09 | Paper |
Denotational linear time semantics and sequential composition
Information Processing Letters | 1997-02-27 | Paper |
Metric completion versus ideal completion
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 938519 (Why is no real title available?) | 1997-02-03 | Paper |
Denotational semantics in the cpo and metric approach
Theoretical Computer Science | 1995-04-06 | Paper |
The connection between an event structure semantics and an operational semantics for TCSP
Acta Informatica | 1994-05-10 | Paper |
The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
Theoretical Computer Science | 1994-04-05 | Paper |
Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time
Information Processing Letters | 1993-01-17 | Paper |
Towards a foundation for semantics in complete metric spaces
Information and Computation | 1992-06-25 | Paper |
The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Information Processing Letters | 1989-01-01 | Paper |
On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
Information Processing Letters | 1988-01-01 | Paper |
Elimination of redundant operations in relational queries with general selection operators
Computing | 1985-01-01 | Paper |
A simple relation between relational and predicate transformer semantics for nondeterministic programs
Information Processing Letters | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3754073 (Why is no real title available?) | 1980-01-01 | Paper |
