244
M. Bozga et al.
References
1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinitestate systems. In: LICS. pp. 313–321. IEEE Computer Society (1996)
2. Abdulla, P.A., Delzanno, G., Henda, N.B., Rezine, A.: Regular model checking without
transducers (on efficient verification of parameterized systems). In: Grumberg, O., Huth,
M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 721–736
(2007)
3. Abdulla, P.A., Haziza, F., Hol´ ık, L.: Parameterized verification through view abstraction.
STTT 18(5), 495–516 (2016)
4. Alberti, F., Ghilardi, S., Sharygina, N.: A framework for the verification of parameterized
infinite-state systems. CEUR Workshop Proceedings 1195, 302–308 (01 2014)
5. Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of
rendezvous systems. Distributed Computing 31(3), 187–222 (Jun 2018)
6. Apt, K.R., Kozen, D.C.: Limits for automatic verification of finite-state concurrent systems.
Information Processing Letters 22(6), 307 – 309 (1986)
7. Außerlechner, S., Jacobs, S., Khalimov, A.: Tight cutoffs for guarded protocols with fairness.
In: VMCAI. Lecture Notes in Computer Science, vol. 9583, pp. 476–494. Springer (2016)
8. Barkaoui, K., Lemaire, B.: An effective characterization of minimal deadlocks and traps in
Petri nets based on graph theory. In: 10th Int. Conf. on Application and Theory of Petri Nets
ICATPN’89. pp. 1–21 (1989)
9. Basu, A., Bensalem, S., Bozga, M., Combaz, J., Jaber, M., Nguyen, T., Sifakis, J.: Rigorous component-based system design using the BIP framework. IEEE Software 28(3), 41–48
(2011)
10. Baukus, K., Bensalem, S., Lakhnech, Y., Stahl, K.: Abstracting WS1S systems to verify
parameterized networks. In: Graf, S., Schwartzbach, M. (eds.) Tools and Algorithms for the
Construction and Analysis of Systems. pp. 188–203 (2000)
11. Bensalem, S., Bozga, M., Nguyen, T., Sifakis, J.: D-Finder: A tool for compositional deadlock detection and verification. In: CAV’09 Proceedings. LNCS, vol. 5643, pp. 614–619
(2009)
12. Bloem, R., Jacobs, S., Khalimov, A., Konnov, I., Rubin, S., Veith, H., Widder, J.: Decidability
of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan
& Claypool Publishers (2015)
13. Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously. In: TACAS. Lecture Notes in Computer Science, vol. 9636, pp. 480–496. Springer
(2016)
14. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Alur, R., Peled,
D.A. (eds.) Computer Aided Verification. pp. 372–386 (2004)
15. Bozga, M., Esparza, J., Iosif, R., Sifakis, J., Welzel, C.: ostrich (Feb 2020), https://doi.org/
10.5281/zenodo.3676940
16. Bozga, M., Esparza, J., Iosif, R., Sifakis, J., Welzel, C.: Structural invariants for the verification of systems with parameterized architectures (2020)
17. Bozga, M., Iosif, R., Sifakis, J.: Checking deadlock-freedom of parametric component-based
systems. In: 25th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of
Systems (TACAS). (2019)
18. Browne, M., Clarke, E., Grumberg, O.: Reasoning about networks with many identical finite
state processes. Information and Computation 81(1), 13 – 31 (1989)
19. Chen, Y., Hong, C., Lin, A.W., R¨ ummer, P.: Learning to prove safety over parameterised
concurrent systems. In: 2017 Formal Methods in Computer Aided Design, FMCAD 2017,
Vienna, Austria, October 2-6, 2017. pp. 76–83 (2017)
M. Bozga et al.
References
1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinitestate systems. In: LICS. pp. 313–321. IEEE Computer Society (1996)
2. Abdulla, P.A., Delzanno, G., Henda, N.B., Rezine, A.: Regular model checking without
transducers (on efficient verification of parameterized systems). In: Grumberg, O., Huth,
M. (eds.) Tools and Algorithms for the Construction and Analysis of Systems. pp. 721–736
(2007)
3. Abdulla, P.A., Haziza, F., Hol´ ık, L.: Parameterized verification through view abstraction.
STTT 18(5), 495–516 (2016)
4. Alberti, F., Ghilardi, S., Sharygina, N.: A framework for the verification of parameterized
infinite-state systems. CEUR Workshop Proceedings 1195, 302–308 (01 2014)
5. Aminof, B., Kotek, T., Rubin, S., Spegni, F., Veith, H.: Parameterized model checking of
rendezvous systems. Distributed Computing 31(3), 187–222 (Jun 2018)
6. Apt, K.R., Kozen, D.C.: Limits for automatic verification of finite-state concurrent systems.
Information Processing Letters 22(6), 307 – 309 (1986)
7. Außerlechner, S., Jacobs, S., Khalimov, A.: Tight cutoffs for guarded protocols with fairness.
In: VMCAI. Lecture Notes in Computer Science, vol. 9583, pp. 476–494. Springer (2016)
8. Barkaoui, K., Lemaire, B.: An effective characterization of minimal deadlocks and traps in
Petri nets based on graph theory. In: 10th Int. Conf. on Application and Theory of Petri Nets
ICATPN’89. pp. 1–21 (1989)
9. Basu, A., Bensalem, S., Bozga, M., Combaz, J., Jaber, M., Nguyen, T., Sifakis, J.: Rigorous component-based system design using the BIP framework. IEEE Software 28(3), 41–48
(2011)
10. Baukus, K., Bensalem, S., Lakhnech, Y., Stahl, K.: Abstracting WS1S systems to verify
parameterized networks. In: Graf, S., Schwartzbach, M. (eds.) Tools and Algorithms for the
Construction and Analysis of Systems. pp. 188–203 (2000)
11. Bensalem, S., Bozga, M., Nguyen, T., Sifakis, J.: D-Finder: A tool for compositional deadlock detection and verification. In: CAV’09 Proceedings. LNCS, vol. 5643, pp. 614–619
(2009)
12. Bloem, R., Jacobs, S., Khalimov, A., Konnov, I., Rubin, S., Veith, H., Widder, J.: Decidability
of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory, Morgan
& Claypool Publishers (2015)
13. Blondin, M., Finkel, A., Haase, C., Haddad, S.: Approaching the coverability problem continuously. In: TACAS. Lecture Notes in Computer Science, vol. 9636, pp. 480–496. Springer
(2016)
14. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: Alur, R., Peled,
D.A. (eds.) Computer Aided Verification. pp. 372–386 (2004)
15. Bozga, M., Esparza, J., Iosif, R., Sifakis, J., Welzel, C.: ostrich (Feb 2020), https://doi.org/
10.5281/zenodo.3676940
16. Bozga, M., Esparza, J., Iosif, R., Sifakis, J., Welzel, C.: Structural invariants for the verification of systems with parameterized architectures (2020)
17. Bozga, M., Iosif, R., Sifakis, J.: Checking deadlock-freedom of parametric component-based
systems. In: 25th Intl. Conf. on Tools and Algorithms for the Construction and Analysis of
Systems (TACAS). (2019)
18. Browne, M., Clarke, E., Grumberg, O.: Reasoning about networks with many identical finite
state processes. Information and Computation 81(1), 13 – 31 (1989)
19. Chen, Y., Hong, C., Lin, A.W., R¨ ummer, P.: Learning to prove safety over parameterised
concurrent systems. In: 2017 Formal Methods in Computer Aided Design, FMCAD 2017,
Vienna, Austria, October 2-6, 2017. pp. 76–83 (2017)