Language-based comparison of Petri nets with black tokens, pure names and ordered data

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

Volumn 6031 LNCS, Issue , 2010, Pages 524-535

  Rosa Velardo, Fernando ^a   Delzanno, Giorgio ^b  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSURE PROPERTY; COVERABILITY; EXPRESSIVE POWER; IN-BETWEEN; LANGUAGE THEORY; ORDERED DATA; ORDERED DOMAINS; WELL-STRUCTURED TRANSITION SYSTEMS;

GRAPH THEORY; LINGUISTICS; PETRI NETS; QUERY LANGUAGES; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 77953755181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13089-2_44     Document Type: Conference Paper

References (14)

1. Abdulla, P., Delzanno, G.: On the coverability problem for constrained multiset rewriting. In: AVIS, an ETAPS workshop (2006)
2. Abdulla, P.A., Delzanno, G., Begin, L.V.: Comparing the expressive power of wellstructured transition systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.4646, pp. 99-114. Springer, Heidelberg (2007)
3. Abdulla, P.A., Delzanno, G., Begin, L.V.: A language-based comparison of extensions of petri nets with and without whole-place operations. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds.) LATA 2009. LNCS, vol.5457, pp. 71-82. Springer, Heidelberg (2009)
4. Ćeće, G., Finkel, A., Iyer, S.P.: Unreliable channels are easier to verify than perfect channels. Inf. Comput. 124(1), 20-31 (1996)
5. Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2), 1-29 (2004)
6. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63-92 (2001)
7. Geeraerts, G., Raskin, J.F., Begin, L.V.: Well-structured languages. Acta Inf. 44(3- 4), 249-288 (2007)
8. Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. Elsevier Science Inc., New York (1975)
9. Gordon, A.D.: Notes on nominal calculi for security and mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.2171, pp. 262-330. Springer, Heidelberg (2001)
10. Kummer, O.: Undecidability in object-oriented petri nets. Petri Net Newsletter 59, 18-23 (2000)
11. Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Inform. 88(3), 251-274 (2008)
12. Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall, Englewood Cliffs (1981)
13. Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in petri net systems. Fundam. Inform. 88(3), 329-356 (2008)
14. Rosa-Velardo, F., de Frutos-Escrig, D., Alonso, O.M.: On the expressiveness of mobile synchronizing petri nets. Electr. Notes Theor. Comput. Sci. 180(1), 77-94 (2007) (Pubitemid 46856312)