Problems concerning fairness and temporal logic for conflict-free petri nets
- 29 May 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 64 (3) , 305-329
- https://doi.org/10.1016/0304-3975(89)90053-4
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Limits for automatic verification of finite-state concurrent systemsInformation Processing Letters, 1986
- Fairness and conspiracies: Information processing letters Vol. 18, No. 4 (14 May 1984) pp. 215-220Information Processing Letters, 1984
- Fairness and conspiraciesInformation Processing Letters, 1984
- Termination of Probabilistic Concurrent ProgramACM Transactions on Programming Languages and Systems, 1983
- The decidability of persistence for vector addition systemsInformation Processing Letters, 1980
- Vector addition systems and regular languagesJournal of Computer and System Sciences, 1980
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976
- A decidability theorem for a class of vector-addition systemsInformation Processing Letters, 1975