S. Abbes, The (True) Concurrent Markov Property and Some Applications to Markov Nets, Applications and Theory of Petri Nets, pp.70-89, 2005.
DOI : 10.1007/11494744_6

URL : https://hal.archives-ouvertes.fr/hal-00350506

T. Abdellatif, S. Bensalem, J. Combaz, L. De-silva, and F. , Ingrand Rigorous design of robot software: A formal component-based approach In Robotics and Autonomous Systems, pp.1563-1578

M. Albanese, A Constrained Probabilistic Petri Net Framework for Human Activity Detection in Video, IEEE Transactions on Multimedia, vol.10, issue.6, pp.982-996, 2008.
DOI : 10.1109/TMM.2008.2001369

L. D. Alfaro and T. A. Henzinger, Interface Theories for Component-Based Design, EMSOFT, pp.148-165, 2001.
DOI : 10.1007/3-540-45449-7_11

M. E. Andrés, C. Palamidessi, P. Van-rossum, and A. Sokolova, Information hiding in probabilistic concurrent systems, TCS, issue.28, pp.4123072-3089, 2011.

S. Abbes, A. Benveniste, and /. Concurrency, sigma-Algebras, and Probabilistic Fairness, Foundations of Software Science and Computational Structures, pp.380-394, 2008.
DOI : 10.1007/978-3-642-00596-1_27

URL : https://hal.archives-ouvertes.fr/hal-00267518

S. Bensalem, M. Bozga, B. Delahaye, C. Jégourel, A. Legay et al., Statistical Model Checking QoS Properties of Systems with SBIP, In Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, LNCS, vol.7609, pp.327-341, 2012.

A. Basu, S. Bensalem, M. Bozga, J. Combaz, M. Jaber et al., Rigorous Component-Based System Design Using the BIP Framework, IEEE Software, pp.41-48, 2011.
DOI : 10.1109/MS.2011.27

URL : https://hal.archives-ouvertes.fr/hal-00722395

C. Baier and J. Katoen, Principles of Model Checking, 2008.

M. Beccuti, G. Franceschinis, and S. Haddad, Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms, Applications and Theory of Petri Nets, pp.43-62, 2007.
DOI : 10.1007/978-3-540-73094-1_6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.8365

S. Bliudze and J. Sifakis, The Algebra of Connectors—Structuring Interaction in BIP, IEEE Transactions on Computers, vol.57, issue.10, pp.1315-1330, 2008.
DOI : 10.1109/TC.2008.26

L. Cheung, N. A. Lynch, R. Segala, and F. W. Vaandrager, Switched PIOA: Parallel composition via distributed scheduling, Theoretical Computer Science, vol.365, issue.1-2, pp.83-108, 2006.
DOI : 10.1016/j.tcs.2006.07.033

URL : http://doi.org/10.1016/j.tcs.2006.07.033

P. R. D-'argenio, J. Katoen, and E. Brinksma, An algebraic approach to the specification of stochastic systems, Conference on Programming Concepts and Methods, pp.126-147, 1998.

L. De-alfaro, The verification of probabilistic systems under memoryless partial-information policies is hard, PROBMIV, pp.19-32, 1999.

C. Eisentraut, H. Hermanns, and L. Zhang, Concurrency and Composition in a Stochastic World, CONCUR, volume LNCS 6269, pp.21-39, 2010.
DOI : 10.1007/978-3-642-15375-4_3

URL : https://hal.archives-ouvertes.fr/hal-00650728

J. Esparza, Reduction and Synthesis of Live and Bounded Free Choice Petri Nets, Information and Computation, pp.50-87, 1994.
DOI : 10.1006/inco.1994.1080

S. Georgievska, S. Andova, S. Giro, and P. R. , Probabilistic may/must testing: retaining probabilities by restricted schedulers. Formal Asp On the expressive power of schedulers in distributed probabilistic systems, Comput. In ENTCS, vol.24, issue.2533, pp.727-74845, 2009.

C. A. Hoare, Communicating Sequential Processes, communication of the ACM, pp.666-677, 1978.

J. Katoen, GSPNs Revisited: Simple Semantics and New Analysis Algorithms, 2012 12th International Conference on Application of Concurrency to System Design, pp.6-11, 2012.
DOI : 10.1109/ACSD.2012.30

URL : http://doc.utwente.nl/82496/1/acsd_gspn.pdf

D. Joost-pieter-katoen and . Peled, Taming Confusion for Modeling and Implementing Probabilistic Concurrent Systems, ESOP, pp.411-430, 2013.

G. Katz, D. Peled, and S. Schewe, Synthesis of Distributed Control through Knowledge Accumulation, CAV, pp.510-525, 2011.
DOI : 10.1023/A:1015625600613

M. Kudlek, Probability in Petri nets, Fund. Informatica, pp.121-130, 2005.

N. A. Lynch, R. Segala, and F. W. Vaandrager, Observing Branching Structure through Probabilistic Contexts, SIAM Journal on Computing, vol.37, issue.4, pp.977-1013, 2007.
DOI : 10.1137/S0097539704446487

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.2220

N. Lynch and M. R. Tuttle, An Introduction to Input/Output Automata In CWI-quarterly, 1989.

M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modelling with Generalized Stochastic Petri Nets, ACM SIGMETRICS Performance Evaluation Review, vol.26, issue.2, 1995.
DOI : 10.1145/288197.581193

A. Mazurkiewicz, Introduction to Trace Theory, The Book of Traces. World Scientific, 1995.
DOI : 10.1142/9789814261456_0001

R. Milner and A. , Complete Axiomatisation for Observational Congruence of Finite-State Behaviors, IandC, pp.227-247, 1989.

J. A. Pérez, R. Corchuelo, and M. Toro, An order-based algorithm for multiparty synchronization. Concurrency - Practice and Experience, pp.1173-1206, 2004.

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesize, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.746-757, 1990.
DOI : 10.1109/FSCS.1990.89597

M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 2005.
DOI : 10.1002/9780470316887

R. Segala and N. A. Lynch, Probabilistic simulations for probabilistic processes, Nord. J. Comput, vol.2, issue.2, pp.250-273, 1995.
DOI : 10.1007/bfb0015027

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6430

G. Taubenfeld, Synchronization Algorithms for Concurrent Programming, 2006.

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

D. Varacca and M. Nielsen, Probabilistic Petri nets and Mazurkiewicz equivalence Unpublished manuscript, 2003.

S. H. Wu, S. A. Smolka, and E. W. Stark, Composition and Behaviors of Probabilistic I/O Automata, In CONCUR LNCS, vol.836, pp.513-528, 1994.
DOI : 10.1007/978-3-540-48654-1_37