On questions of fairness and temporal logic for conflict-free Petri nets
- 1 January 1988
- book chapter
- Published by Springer Nature
- p. 200-226
- https://doi.org/10.1007/3-540-50580-6_30
Abstract
No abstract availableKeywords
This publication has 35 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
- Infinite behaviour and fairness in petri netsPublished by Springer Nature ,1985
- 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