Personen - MADOC

Zurück zur Übersicht

Gruppieren nach: Dokumenttyp | Erscheinungsjahr | Keine Sortierung

Anzahl der Einträge: 11.

Minnameier, Christoph (2010) Interaction in Concurrent Systems.

None [Dissertation]

Vorschau

Majster-Cederbaum, Mila ; Minnameier, Christoph Cross-Checking - Enhanced Over-Approximation of the Reachable Global State Space of Component-based Systems. Bournez, Olivier Lecture Notes in Computer Science 5697 189-202 In: Reachability problems : Third International Workshop, RP 2009, Palaiseau, France, September 23 - 25, 2009; proceeding (2009) Berlin [u.a.] [Konferenzveröffentlichung]

Majster-Cederbaum, Mila ; Minnameier, Christoph Everything is PSPACE-complete in Interaction Systems. Fitzgerald, John S. Lecture Notes in Computer Science 5160 216-227 In: Theoretical aspects of computing - ICTAC 2008 : 5th international colloquium; Istanbul, Turkey, September 1 - 3, 2008; proceeding (2008) Berlin [u.a.] [Konferenzveröffentlichung]

Majster-Cederbaum, Mila ; Minnameier, Christoph Deriving Complexity Results for Interaction Systems from 1-safe Petri Nets. Geffert, Viliam Lecture Notes in Computer Science 4910 352-363 In: SOFSEM 2008: theory and practice of computer science : 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19 - 25, 2008; proceedings (2008) Berlin [u.a.] [Konferenzveröffentlichung]

Minnameier, Christoph ; Majster-Cederbaum, Mila (2007) Interaction Systems and 1-safe Petri Nets.

None [Arbeitspapier]

Vorschau

Majster-Cederbaum, Mila ; Martens, Moritz ; Minnameier, Christoph ; Gössler, Gregor ; Graf, Susanne ; Sifakis, Joseph A Polynomial-Time checkable sufficient Condition for Deadlock-Freedom of Component-Based Systems. Leeuwen, Jan van Lecture Notes in Computer Science 4362 888-899 In: SOFSEM 2007: Theory and Practice of Computer Science : 33rd Conference on Current Trends in Theory and Practice of Computer Science; Harrachov, Czech Republic, January 20-26, 2007; proceedings (2007) Berlin [u.a.] [Konferenzveröffentlichung]

Minnameier, Christoph (2007) Local and Global Deadlock-Detection in Component-Based Systems are NP-hard. Information Processing Letters Amsterdam 103 3 105-111 [Zeitschriftenartikel]

Majster-Cederbaum, Mila ; Martens, Moritz ; Gössler, Gregor ; Graf, Susanne ; Sifakis, Joseph ; Minnameier, Christoph An Approach to Modelling and Verification of Component Based Systems. SOFSEM 2007: Theory and Practice of Computer Science : 33nd Conference on Current Trendsin Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings In: SOFSEM 2007: Theory and Practice of Computer Science : 33nd Conference on Current Trendsin Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings (2007) Berlin; Heidelberg [u.a.] [Konferenzveröffentlichung]

Minnameier, Christoph (2006) Deadlock-Detection in Component-Based Systems is NP-hard.

Technical Reports Mannheim 06-015 [Arbeitspapier]

Vorschau

Martens, Moritz ; Minnameier, Christoph ; Majster-Cederbaum, Mila (2006) Deciding Liveness in Component-Based Systems is NP-hard.

Manuskripte / Reihe Informatik Mannheim 06-17 [Arbeitspapier]

Vorschau

Majster-Cederbaum, Mila ; Minnameier, Christoph Termination and Divergence are undecidable under a Maximum Progress Multi-Step Semantics for LinCa. Barkaoui, Kamel Lecture Notes in Computer Science 4281 65-79 In: Theoretical aspects of computing - ICTAC 2006 : 3rd International Colloquium on Theoretical Aspects of Computing. Tunis, Tunisia, 20-24 November 2006 (2006) Berlin [u.a.] [Konferenzveröffentlichung]

Diese Liste wurde am Thu Nov 21 01:19:22 2024 CET automatisch erstellt.

Zitation