Deriving Complexity Results for Interaction Systems from 1-safe Petri Nets


Majster-Cederbaum, Mila ; Minnameier, Christoph



URL: http://dx.doi.org/10.1007/978-3-540-77566-9_30
Document Type: Conference or workshop publication
Year of publication: 2008
Book title: 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
The title of a journal, publication series: Lecture Notes in Computer Science
Volume: 4910
Page range: 352-363
Author/Publisher of the book
(only the first ones mentioned)
:
Geffert, Viliam
Place of publication: Berlin [u.a.]
Publishing house: Springer
ISBN: 978-3-540-77565-2 , 978-3-540-77566-9
Publication language: English
Institution: School of Business Informatics and Mathematics > Praktische Informatik II (Majster-Cederbaum Em)
Subject: 004 Computer science, internet

Dieser Eintrag ist Teil der Universitätsbibliographie.




+ Citation Example and Export

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.] [Conference or workshop publication]


+ Search Authors in

+ Page Views

Hits per month over past year

Detailed information



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


Actions (login required)

Show item Show item