Comparison of the expressiveness of arc, place and transition time Petri nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4546 LNCS, Issue , 2007, Pages 63-82

  Boyer, M ^a   Roux, O H ^b,c  

^a IRIT   (France)

^b INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

^c NONE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; MATHEMATICAL MODELS; SEMANTICS;

BEHAVIORAL SEMANTICS; BOUNDED TIME PETRI NETS; TIMED TRANSITION SYSTEMS;

PETRI NETS;

EID: 38149040973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73094-1_7     Document Type: Conference Paper

References (23)

1. Abdulla, P.A., Nylén, A.: Timed petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53-70. Springer, Heidelberg (2001)
2. Aura, T., Lilius, J.: A causal semantics for time petri nets. Theoretical Computer Science 243(2), 409-447 (2000)
3. Berard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: Comparison of the expressiveness of timed automata and time Petri nets. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, Springer, Heidelberg (2005)
4. Berthomieu, B.: La méthode des classes d'états pour l'analyse des réseaux temporels, mise en œuvre, extension à la multi-sensibilisation. In: Modélisation des Systèmes Réactifs (MSR'01), Toulouse (Fr), pp. 275-290, (17-19 Octobre 2001)
5. Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time petri nets. IEEE transactions on software engineering 17(3), 259-273 (March 1991)
6. Boyer, M., Vernadat, F.: Language and bisimulation relations between subclasses of timed petri nets with strong timing semantic. Technical report, LAAS (2000)
7. Boyer, M.: Translation from timed Petri nets with interval on transitions to interval on places (with urgency). In: Workshop on Theory and Practice of Timed Systems, vol. 65 of ENTCS, Grenoble, France, April 2002. Elsevier Science (2002)
8. Boyer, M., Diaz, M.: Multiple enabledness of transitions in time Petri nets. In: Proc. of the 9th IEEE International Workshop on Petri Nets and Performance Models, Aachen, Germany, September 11-14, 2001, IEEE Computer Society, Washington (2001)
9. Boyer, M., Roux, O. H.: Comparison of the expressiveness w.r.t. timed bisimilarity of k-bounded arc, place and transition time Petri nets with weak and strong single server semantics. Technical Report RI, -15, IRCCyN (2006) http://www.irccyn.ec-nantes.fr/hebergement/Publications/2006/3437.pdf
10. Bérard, B., Cassez, F., Haddad, S., Lime, D., Roux, O.H.: When are timed automata weakly timed bisimilar to time Petri nets? In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, Springer, Heidelberg (2005)
11. Cassez, F., Roux, O.H.: Structural translation from Time Petri Nets to Timed Automata - Model-Checking Time Petri Nets via Timed Automata. The journal of Systems and Software 79(10), 1456-1468 (2006)
12. Cerone, A., Maggiolo-Schettini, A.: Timed based expressivity of time petri nets for system specification. Theoretical Computer Science 216, 1-53 (1999)
13. de Frutos Escrig, D., Ruiz, V. V., Alonso, O.M.: Decidability of properties of timed-arc Petri nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 187-206. Springer, Heidelberg (2000)
14. Hanisch, H.M.: Analysis of place/transition nets with timed-arcs and its application to batch process control. In: Ajmone Marsan, M. (ed.) Application and Theory of Petri Nets 1993. LNCS, vol. 691, pp. 282-299. Springer, Heidelberg (1993)
15. Jones, N.D., Landweber, L.H., Lien, Y.E.: Complexity of some problems in Petri nets. Theoretical Computer Science 4, 277-299 (1977)
16. Khansa, W., Denat, J.-P., Collart-Dutilleul, S.: P-time Petri nets for manufacturing systems. In: International Workshop on Discrete Event Systems, WODES'96, Edinburgh (U.K.), pp. 94-102 (August 1996)
17. Khanza, W.: Réseau de Petri P-Temporels. Contribution á l'étude des systèmes á événements discrets. PhD thesis, Université de Savoie (1992)
18. Merlin, P.M.: A study of the recoverability of computing systems. PhD thesis, Dep. of Information and Computer Science, University of California, Irvine, CA (1974)
19. Pezzè, M.: Time Petri Nets: A Primer Introduction. Tutorial presented at the Multi-Workshop on Formal Methods in Performance Evaluation and Applications, Zaragoza, Spain (September 1999)
20. Ramchandani, C.: Analysis of asynchronous concurrent systems by timed Petri nets. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, Project MAC Report MAC-TR-120 (1974)
21. Sifakis, J.: Performance Evaluation of Systems using Nets. In: Brauer, W. (ed.) Net Theory and Applications: Proc. of the advanced course on general net theory, processes and systems, LNCS, vol. 84, Springer, Heidelberg (1980)
22. Srba, J.: Timed-arc Petri nets vs. networks of timed automata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 385-402. Springer, Heidelberg (2005)
23. Walter, B.: Timed net for modeling and analysing protocols with time. In: Proceedings of the IFIP Conference on Protocol Specification Testing and Verification, North Holland (1983)