Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)

DOI10.1016/0304-3975(90)90134-4zbMath0701.68023OpenAlexW1990670266MaRDI QIDQ914365

Paul Gastin

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90134-4

zbMATH Keywords

distributed modelrepresentation of concurrency

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

The word problem for \(1\mathcal{LC}\) congruences is NP-hard. ⋮ The poset of infinitary traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Calculi for synchrony and asynchrony
• Langages infinitaires et produit de mixage
• A calculus of communicating systems
• Petri nets, event structures and domains. I
• Adherences of languages
• Combinatorial problems of commutation and rearrangements
• Trace languages defined by regular string languages
• Time, clocks, and the ordering of events in a distributed system
• Software Descriptions with Flow Expressions
• Communicating sequential processes

This page was built for publication: Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)