The existence of refinement mappings, Theoretical Computer Science, vol.82, issue.2, pp.253-284, 1991. ,
DOI : 10.1016/0304-3975(91)90224-P
Deciding Bisimilarity and Similarity for Probabilistic Processes, Journal of Computer and System Sciences, vol.60, issue.1, pp.187-231, 2000. ,
DOI : 10.1006/jcss.1999.1683
Weak bisimulation for fully probabilistic processes, CAV 1997, pp.119-130, 1997. ,
DOI : 10.1007/3-540-63166-6_14
Principles of Model Checking, 2008. ,
Comparative branching-time semantics for Markov chains, Information and Computation, vol.200, issue.2, pp.149-214, 2005. ,
DOI : 10.1016/j.ic.2005.03.001
Introduction to Generalized Stochastic Petri Nets, SFM 2007, pp.83-131, 2007. ,
DOI : 10.1007/978-3-540-72522-0_3
Axiomatizations for Probabilistic Bisimulation, ICALP 2001, pp.370-381, 2001. ,
DOI : 10.1007/3-540-48224-5_31
Handbook of Process Algebra, 2001. ,
Introduction to the ISO specification language LOTOS, Computer Networks and ISDN Systems, vol.14, issue.1, pp.25-59, 1987. ,
DOI : 10.1016/0169-7552(87)90085-7
Revisiting Interactive Markov Chains, Electronic Notes in Theoretical Computer Science, vol.68, issue.5, 2002. ,
DOI : 10.1016/S1571-0661(04)80520-6
A numerical aggregation algorithm for the enzymecatalyzed substrate conversion, CMSB 2006, pp.298-311, 2006. ,
A testing scenario for probabilistic processes, Journal of the ACM, vol.54, issue.6, 2007. ,
DOI : 10.1145/1314690.1314693
GSPNs versus SPNs: what is the actual role of immediate transitions?, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91, pp.20-31, 1991. ,
DOI : 10.1109/PNPM.1991.238785
GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets, Performance Evaluation, vol.24, issue.1-2, pp.47-68, 1995. ,
DOI : 10.1016/0166-5316(95)00008-L
Generalized stochastic Petri nets: a definition at the net level and its implications, IEEE Transactions on Software Engineering, vol.19, issue.2, pp.89-107, 1993. ,
DOI : 10.1109/32.214828
Quantitative evaluation in embedded system design, Proceedings of the conference on Design, automation and test in Europe, DATE '08, pp.88-89, 2008. ,
DOI : 10.1145/1403375.1403399
URL : https://hal.archives-ouvertes.fr/inria-00199914
The Möbius modeling environment: Recent developments, pp.328-329, 2004. ,
Testing finitary probabilistic processes, In: CONCUR, pp.274-288, 2009. ,
DOI : 10.1007/978-3-642-04081-8_19
Approximating labelled Markov processes, Information and Computation, vol.184, issue.1, pp.160-200, 2003. ,
DOI : 10.1016/S0890-5401(03)00051-8
URL : http://doi.org/10.1016/s0890-5401(03)00051-8
Weak Bisimulation is Sound and Complete for PCTL*, Inf. Comput, vol.208, issue.2, pp.203-219, 2010. ,
DOI : 10.1007/3-540-45694-5_24
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.264-273, 2008. ,
DOI : 10.1109/QEST.2008.42
On probabilistic automata in continuos time, 2010. ,
On Probabilistic Automata in Continuous Time, 2010 25th Annual IEEE Symposium on Logic in Computer Science, 2010. ,
DOI : 10.1109/LICS.2010.41
Flexible development of dependability services: an experience derived from energy automation systems, Proceedings Ninth Annual IEEE International Conference and Workshop on the Engineering of Computer-Based Systems, pp.86-93, 2002. ,
DOI : 10.1109/ECBS.2002.999826
Interactive Markov Chains, LNCS, vol.2428, p.57, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01514669
Process algebra for performance evaluation, Theoretical Computer Science, vol.274, issue.1-2, pp.43-87, 2002. ,
DOI : 10.1016/S0304-3975(00)00305-4
Automated compositional Markov chain generation for a plain-old telephone system, Science of Computer Programming, vol.36, issue.1, pp.97-127, 2000. ,
DOI : 10.1016/S0167-6423(99)00019-2
Priority and maximal progress are completely axioatisable (extended abstract), CONCUR 1998, pp.237-252, 1998. ,
DOI : 10.1007/bfb0055626
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.5167
PRISM: A Tool for Automatic Verification of Probabilistic Systems, TACAS 2006, pp.441-444, 2006. ,
DOI : 10.1007/11691372_29
Communicating Sequential Processes, 1985. ,
Specification and refinement of probabilistic processes, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.266-277, 1991. ,
DOI : 10.1109/LICS.1991.151651
Compositional Abstraction for Stochastic Systems, FORMATS 2009, pp.195-211, 2009. ,
DOI : 10.1007/BFb0035395
Structural Operational Semantics for Stochastic Process Calculi, FOSSACS 2008, pp.428-442, 2008. ,
DOI : 10.1007/978-3-540-78499-9_30
Bisimulation through probabilistic testing, Information and Computation, vol.94, issue.1, pp.1-28, 1991. ,
DOI : 10.1016/0890-5401(91)90030-6
Hierarchical correctness proofs for distributed algorithms, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing , PODC '87, pp.137-151, 1987. ,
DOI : 10.1145/41840.41852
Generalized stochastic Petri nets revisited: Random switches and priorities, pp.44-53, 1987. ,
An introduction to generalized stochastic Petri nets, Microelectronics Reliability, vol.31, issue.4, pp.699-725, 1991. ,
DOI : 10.1016/0026-2714(91)90010-5
Modelling with Generalized Stochastic Petri Nets, ACM SIGMETRICS Performance Evaluation Review, vol.26, issue.2, 1995. ,
DOI : 10.1145/288197.581193
Communication and Concurrency, 1989. ,
Comparing the expressive power of the synchronous and asynchronous $pi$ -calculi, Mathematical Structures in Computer Science, vol.13, issue.5, pp.685-719, 2003. ,
DOI : 10.1017/S0960129503004043
URL : https://hal.archives-ouvertes.fr/inria-00201104
Concurrency and automata on infinite sequences, Theoretical Computer Science, pp.167-183, 1981. ,
DOI : 10.1007/BFb0017309
Computational Probability for Systems Biology, FMSB 2008, pp.33-47, 2008. ,
DOI : 10.1007/978-3-540-68413-8_3
Modeling and Verification of Randomized Distributed Real-Time Systems, 1995. ,
Probability and Nondeterminism in Operational Models of Concurrency, CONCUR 2006, pp.64-78, 2006. ,
DOI : 10.1007/11817949_5
Probabilistic simulations for probabilistic processes, Nordic Journal of Computing, vol.2, issue.2, pp.250-273, 1995. ,
Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling, 2009. ,
Root Contention in IEEE 1394, AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999, pp.53-74 ,
DOI : 10.1007/3-540-48778-6_4
The linear time ??? Branching time spectrum II, CONCUR 1993, pp.66-81, 1993. ,
DOI : 10.1007/3-540-57208-2_6
Modelling of Biochemical Reactions by Stochastic Automata Networks, Electronic Notes in Theoretical Computer Science, vol.171, issue.2, pp.197-208, 2007. ,
DOI : 10.1016/j.entcs.2007.05.017
Decision Algorithms for Probabilistic Simulations, 2008. ,
Flow faster: Efficient decision algorithms for probabilistic simulations, Logical Methods in Computer Science, vol.4, issue.4, 2008. ,