Partial Commutation and Traces

@inproceedings{Diekert1997PartialCA,
  title={Partial Commutation and Traces},
  author={V. Diekert and Y. M{\'e}tivier},
  booktitle={Handbook of Formal Languages},
  year={1997}
}
  • V. Diekert, Y. Métivier
  • Published in Handbook of Formal Languages 1997
  • Computer Science
    • Parallelism and concurrency are fundamental concepts in computer science. Specification and verification of concurrent programs are of first importance. It concerns our daily life whether software written for distributed systems behaves correctly. 
    View via Publisher
    150 Citations
    Highly Influencial Citations
    11
    Background Citations
    70
    Methods Citations
    13
    Results Citations
    3

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

        150 Citations
        Citation Type

        Citation Type

        Implementation Relations for Testing Through Asynchronous Channels
        • 11
        • PDF
        Semantics of Deterministic Shared-Memory Systems
        • 4
        • Highly Influenced
        Languages, Automata, and Logic
        • W. Thomas
        • Mathematics, Computer Science
        • Handbook of Formal Languages
        • 1997
        • 1,065
        • PDF
        Realizability of Concurrent Recursive Programs
        • 11
        • PDF
        Unambiguous Shared-Memory Systems
        • R. Morin
        • Computer Science
        • Int. J. Found. Comput. Sci.
        • 2010
        • 1
        MSO Logic for Unambiguous Shared-Memory Systems
        • R. Morin
        • Mathematics, Computer Science
        • Developments in Language Theory
        • 2008
        • 1
        • PDF
        Timed traces and their applications in specification and verification of distributed real-time systems
        • 4
        Category of asynchronous systems and polygonal morphisms
        • 1
        • PDF
        Bounded Reachability Checking with Process Semantics
        • 58
        • PDF
        Distributed Graph Automata
        • Fabian Reiter
        • Computer Science, Mathematics
        • 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
        • 2015
        • 26
        • PDF

        References

        SHOWING 1-10 OF 134 REFERENCES
        Combinatorics on Traces
        • V. Diekert
        • Mathematics, Computer Science
        • Lecture Notes in Computer Science
        • 1990
        • 185
        Determinizing Asynchronous Automata
        • 17
        • PDF
        An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs
        • 19
        Star-Free Trace Languages
        • 33
        A Metric for Traces
        • 36
        Coding with Traces
        • 8
        Recognizable Languages in Concurrency Monoids
        • M. Droste
        • Mathematics, Computer Science
        • Theor. Comput. Sci.
        • 1995
        • 22
        On Regular Trace Languages
        • 40
        Time, clocks, and the ordering of events in a distributed system
        • 8,734
        • PDF
        Logical Definability on Infinite Traces
        • 82