D. Brand and P. Zafiropulo, On Communicating Finite-State Machines, Journal of the ACM, vol.30, issue.2, pp.323-342, 1983.
DOI : 10.1145/322374.322380

J. Buck, Scheduling dynamic dataflow graphs with bounded memory using the token flow model, IEEE International Conference on Acoustics Speech and Signal Processing, 1993.
DOI : 10.1109/ICASSP.1993.319147

J. Carmona, J. Cortadella, V. Khomenko, and A. Yakovlev, Synthesis of Asynchronous Hardware from Petri Nets, Lectures on Concurrency and Petri Nets, pp.345-401, 2003.
DOI : 10.1007/978-3-540-27755-2_9

J. Cortadella, A. Kondratyev, L. Lavagno, C. Passerone, and Y. Watanabe, Quasi-static scheduling of independent tasks for reactive systems, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.24, issue.10, pp.1492-1514, 2005.
DOI : 10.1109/TCAD.2005.852038

. Ph, B. Darondeau, P. S. Genest, S. Thiagarajan, and . Yang, Quasi-Static Scheduling of Communicating Tasks, CONCUR 2008, pp.310-324

D. De-frutos-escrig, Decidability of home states in place transition systems, Report of Dpto, 1986.

B. Genest, D. Kuske, and A. Muscholl, On Communicating Automata with Bounded Channels, Fundamenta Informaticae, vol.80, issue.2, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00306256

C. Jard and T. Jeron, Testing for Unboundedness of FIFO Channels, Theoretical Computer Science, vol.113, pp.93-117, 1993.

G. Kahn, The Semantics of Simple Language for Parallel Programming, Proc. Int. Federation Information Processing (IFIP) Congress, pp.471-475, 1974.

R. Karp and R. Miller, Parallel program schemata, Journal of Computer and System Sciences, vol.3, issue.2, pp.147-195, 1969.
DOI : 10.1016/S0022-0000(69)80011-5
URL : http://doi.org/10.1016/s0022-0000(69)80011-5

A. Kondratyev, L. Lavagno, C. Passerone, and Y. Watanabe, Quasi-static scheduling of concurrent specifications, The Embedded Systems Handbook, 2005.

M. Sgroi, L. Lavagno, Y. Watanabe, and A. Sangiovanni-vincentelli, Quasi-Static Scheduling of Embedded Software Using Equal Conflict Nets, ICATPN 1999, pp.208-227
DOI : 10.1007/3-540-48745-X_13

S. Leue, R. Mayr, and W. Wei, A Scalable Incomplete Test for the Boundedness of UML RT Models, TACAS 2004, pp.327-341
DOI : 10.1007/978-3-540-24730-2_26

R. Lipton, The Reachability Problem Requires Exponential Space, Research Report, vol.76, 1976.

C. Liu, A. Kondratyev, Y. Watanabe, J. Desel, and A. L. Sangiovanni-vincentelli, Schedulability Analysis of Petri Nets Based on Structural Properties, Fundamenta Informaticae, vol.86, issue.3, pp.325-341, 2008.

T. Parks, Bounded Scheduling of Process Networks, 1995.

C. Rackoff, The covering and boundedness problems for vector addition systems, Theoretical Computer Science, vol.6, issue.2, pp.223-231, 1978.
DOI : 10.1016/0304-3975(78)90036-1