X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
Keywords
  • 1
    Book
    Book
    Combinatorics on traces (1990)
    Berlin : Springer
    Details
    UID:
    gbv_025362259
    Format: XII, 164 S. , graph. Darst.
    ISBN: 3540530312 , 0387530312
    Series Statement: Lecture notes in computer science 454
    Note: Literaturverz. S. [157] - 164 , Teilw. zugl.: München, Techn. Univ., Habil.-Schr.
    Additional Edition: Online-Ausg. Diekert, Volker Combinatorics on traces Berlin [u.a.] : Springer, 1990 ISBN 9783540463184
    Additional Edition: Erscheint auch als Online-Ausgabe Diekert, Volker, 1955 - Combinatorics on Traces Berlin, Heidelberg : Springer Berlin Heidelberg, 1990 ISBN 9783540463184
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    RVK:
    ST 130
    Keywords: Spurtheorie ; Spurtheorie ; Hochschulschrift
    URL: Inhaltsverzeichnis
    URL: Cover
    URL: Inhaltstext
    Author information: Diekert, Volker 1955-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
  • 2
    Online Resource
    Online Resource
    Combinatorics on Traces (1990)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920881902882
    Format: XIV, 174 p. , online resource.
    ISBN: 9783540463184
    Series Statement: Lecture Notes in Computer Science, 454
    Content: Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
    Note: Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540530312
    Language: English
    DOI: 10.1007/3-540-53031-2
    URL: http://dx.doi.org/10.1007/3-540-53031-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 3
    Online Resource
    Online Resource
    Combinatorics on Traces (1990)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621516702882
    Format: XIV, 174 p. , online resource.
    Edition: 1st ed. 1990.
    ISBN: 9783540463184
    Series Statement: Lecture Notes in Computer Science, 454
    Content: Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
    Note: Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662175842
    Additional Edition: Printed edition: ISBN 9783540530312
    Language: English
    DOI: 10.1007/3-540-53031-2
    URL: https://doi.org/10.1007/3-540-53031-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 4
    Online Resource
    Online Resource
    Combinatorics on Traces (1990)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186218702883
    Format: 1 online resource (XIV, 174 p.)
    Edition: 1st ed. 1990.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46318-6
    Series Statement: Lecture Notes in Computer Science, 454
    Content: Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
    Note: Bibliographic Level Mode of Issuance: Monograph , Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-53031-2
    Language: English
    DOI: 10.1007/3-540-53031-2
    URL: http://dx.doi.org/10.1007/3-540-53031-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 5
    Online Resource
    Online Resource
    Combinatorics on Traces (1990)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186218702883
    Format: 1 online resource (XIV, 174 p.)
    Edition: 1st ed. 1990.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46318-6
    Series Statement: Lecture Notes in Computer Science, 454
    Content: Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
    Note: Bibliographic Level Mode of Issuance: Monograph , Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-53031-2
    Language: English
    DOI: 10.1007/3-540-53031-2
    URL: http://dx.doi.org/10.1007/3-540-53031-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
  • 6
    Online Resource
    Online Resource
    Combinatorics on Traces (1990)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186218702883
    Format: 1 online resource (XIV, 174 p.)
    Edition: 1st ed. 1990.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46318-6
    Series Statement: Lecture Notes in Computer Science, 454
    Content: Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.
    Note: Bibliographic Level Mode of Issuance: Monograph , Free partialy commutative monoids -- Recognizable and rational trace languages -- Petri nets and synchronization -- Complete semi-thue systems and möbius functions -- Trace replacement systems. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-53031-2
    Language: English
    DOI: 10.1007/3-540-53031-2
    URL: http://dx.doi.org/10.1007/3-540-53031-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783540403104?
Did you mean 9783540083184?
Did you mean 9783440163184?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages