A Polynomial-Time checkable sufficient Condition for Deadlock-Freedom of Component-Based Systems

URL:	http://dx.doi.org/10.1007/978-3-540-69507-3_77
Document Type:	Conference or workshop publication
Year of publication:	2007
Book title:	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
The title of a journal, publication series:	Lecture Notes in Computer Science
Volume:	4362
Page range:	888-899
Publisher:	Leeuwen, Jan van
Place of publication:	Berlin [u.a.]
Publishing house:	Springer
ISBN:	978-3-540-69506-6
ISSN:	0302-9743 , 1611-3349
Publication language:	English
Institution:	School of Business Informatics and Mathematics > Praktische Informatik II (Majster-Cederbaum -2005, Em)
Subject:	004 Computer science, internet

Dieser Eintrag ist Teil der Universitätsbibliographie.

BASE: Majster-Cederbaum, Mila ; Martens, Moritz ; Minnameier, Christoph ; Gössler, Gregor ; Graf, Susanne ; Sifakis, Joseph

Google Scholar: Majster-Cederbaum, Mila ; Martens, Moritz ; Minnameier, Christoph ; Gössler, Gregor ; Graf, Susanne ; Sifakis, Joseph

Hits per month over past year

You have found an error? Please let us know about your desired correction here: E-Mail

Show item