Publications

• Term. and Div. are undecidable under a Maximum Progress Multi-step Semantics for LinCa. ICTAC 2006: 65-79
• Local and global deadlock-detection in cp.-based systems are NP-hard. Inf. Process. Lett. 103[3]: 105-111
• A PTime Checkable Sufficient Condition for DL-Freedom of cp.-Based Systems. SOFSEM [1] 2007: 888-899
• Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. SOFSEM 2008: 352-363
• Everything Is PSPACE-Complete in Interaction Systems. ICTAC 2008: 216-227
• Resource Bounded Frequency Computations with Three Errors. COCOON 2008: 72-81
• Liveness in Interaction Systems. Electr. Notes Theor. Comput. Sci. 215: 57-74 [2008]
• Cross-Checking – Enh. Over-Appr. of the Reachable Global State Space of CP-Based Systems. RP 2009: 189-202
• Resource Bounded Frequency Computations with Three Errors. Algorithmica 56[3]: 342-363
• PhD: Interaction in Concurrent Systems.