| Publication | Date of Publication | Type |
|---|
| Early detection of temporal constraint violations | 2024-01-18 | Paper |
| Linear constraint query languages expressive power and complexity | 2023-12-12 | Paper |
| GSM+T: A Timed Artifact-Centric Process Model. | 2022-05-28 | Paper |
| ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS | 2015-04-30 | Paper |
| Conversation Protocols: A Formalism for Specification and Verification of Reactive Electronic Services | 2010-05-07 | Paper |
| Minimum-cost delegation in service composition | 2009-01-08 | Paper |
| A representation independent language for planar spatial databases with Euclidean distance | 2007-08-23 | Paper |
| Automated Technology for Verification and Analysis | 2006-10-25 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| On composition and lookahead delegation of \(e\)-services modeled by automata | 2005-09-22 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Conversation protocols: a formalism for specification and verification of reactive electronic services | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473162 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473168 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428410 | 2003-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782101 | 2003-05-12 | Paper |
| Counter machines and verification problems. | 2003-01-21 | Paper |
| Augmenting the discrete timed automaton with other data structures. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536602 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778759 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778769 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540965 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536378 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2769584 | 2002-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754074 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508938 | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941150 | 2000-02-29 | Paper |
| A technique for proving decidability of containment and equivalence of linear constraint queries | 1999-11-23 | Paper |
| Support for modeling relationships in object-oriented databases | 1999-04-28 | Paper |
| Arity bounds in first-order incremental evaluation and definition of polynomial time database queries | 1999-02-21 | Paper |
| Deductive query languages for recursively typed complex objects | 1999-01-11 | Paper |
| Queries with arithmetical constraints | 1998-07-23 | Paper |
| Dynamic constraints and object migration | 1998-07-22 | Paper |
| Finitely representable databases | 1997-12-17 | Paper |
| Deterministic FOIES are strictly weaker | 1997-10-26 | Paper |
| Conjunctive query containment with respect to views and constraints | 1997-02-28 | Paper |
| Nonrecursive incremental evaluation of Datalog queries | 1996-10-20 | Paper |
| Incremental and decremental evaluation of transitive closure by first- order queries | 1995-09-17 | Paper |
| Domain independence and the relational calculus | 1994-11-23 | Paper |
| Dependency preservation in semantic databases | 1994-05-10 | Paper |
| Algebraic and calculus query languages for recursively typed complex objects | 1993-10-10 | Paper |
| On the expressive power of database queries with intermediate types | 1992-06-25 | Paper |
