Approaching the Coverability Problem Continuously-Reference-Cited by-同舟云学术

Approaching the Coverability Problem Continuously

Published:2016 Issue: Volume: Page:480-496
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Blondin Michael,Finkel Alain,Haase Christoph,Haddad Serge

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-49674-9_28

Reference28 articles.

1. Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1–2), 109–127 (2000)

2. Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously (2015). CoRR, abs/1510.05724

3. Lecture notes in Computer Science;L Bozzelli,2011

4. Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for Petri nets, commutative semigroups: preliminary report. In: Symposium on Theory of Computing, STOC, pp. 50–54 (1976)

5. David, R., Alla, H.: Continuous Petri nets. In: Proceedings of the 8th European Workshop on Application and Theory of Petri nets, pp. 275–294 (1987)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reachability in Continuous Pushdown VASS;Proceedings of the ACM on Programming Languages;2024-01-05

2. Ramsey Quantifiers in Linear Arithmetics;Proceedings of the ACM on Programming Languages;2024-01-05

3. On Verifying Unbounded Client-Server Systems;Multi-Agent Systems;2023

4. Fast Termination and Workflow Nets;Computer Aided Verification;2023

5. Linear equations for unordered data vectors in $[D]^k\to{}Z^d$;Logical Methods in Computer Science;2022-12-12