Abstract
This paper may be seen as proposing a tentative synthesis of various models of parallelism : we establish representation results for three kinds of Models for Distributed Systems, Labelled Transition Systems, Labelled Event Structures and Distributed Languages. For that purpose, we introduce a new representation model for concurrent systems, the Distributed Languages. Based on Words and Equivalence Relations, they are generalizations of the Trace Languages and model the behaviour of any asynchronous concurrent system.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
