Concurrent systems and inevitability
- 1 May 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 64 (3) , 281-304
- https://doi.org/10.1016/0304-3975(89)90052-2
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Traces, histories, graphs: Instances of a process monoidPublished by Springer Nature ,2005
- Inevitability in diamond-discrete systems: Wojciech Penczek: Institute of Computer Science, Polish Academy of Sciences, Warsaw, Jan. 1987Decision Support Systems, 1988
- Inevitability in concurrent systemsInformation Processing Letters, 1987
- Defining livenessInformation Processing Letters, 1985
- Fairness and conspiraciesInformation Processing Letters, 1984
- Proving Liveness Properties of Concurrent ProgramsACM Transactions on Programming Languages and Systems, 1982
- Petri nets, event structures and domains, part ITheoretical Computer Science, 1981
- The temporal semantics of concurrent programsTheoretical Computer Science, 1981
- Behaviours of concurrent systemsTheoretical Computer Science, 1980
- A remark on method in transfinite algebraBulletin of the American Mathematical Society, 1935