Skip to main content
SpringerLink
Log in

Semi-rational Sets of DAGs

  • Conference paper
Developments in Language Theory (DLT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3572))

Included in the following conference series:

Abstract

We call a set of DAGs (directed acyclic graphs) semi-rational if it is accepted by a Petri net. It is shown that the class of semi-rational sets of DAGs coincides with the synchronization closure of Courcelles class of recognizable sets of unranked, unordered trees (or forests).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Thomas, W.: Finite-state recognizability of graph properties. In: Krob, D. (ed.) Theorie des Automates et Applicationbs, vol. 172, pp. 147–159. l’Universite de Rouen, France (1992)

    Google Scholar 

  2. Courcelle, B.: A representation of graphs by algebraic expressions and its use for graph rewriting systems. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 112–132. Springer, Heidelberg (1987)

    Google Scholar 

  3. Courcelle, B.: On context-free sets of graphs and their monadic second-order theory. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 133–146. Springer, Heidelberg (1988)

    Google Scholar 

  4. Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Inf. Control. 49, 10–51 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  5. Comon, H., Daucher, M., Gilleron, R., Tison, S., Tommasi, M.: Tree automata techniques and application. Available on the Web from 13ux02.univ-lille.fr in directoty tata (1998)

    Google Scholar 

  6. Podelski, A.: Model checking as constraint solving. In: Palsberg, J. (ed.) SAS 2000. LNCS, vol. 1824, pp. 22–37. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Brüggemann-Klein, M., Murata, D.: Wood. Regular tree and hedge languages of unranked alphabets. Theor. Comp. Science Center Report HKUST-TCSC 2001- 5, pp. 29 (2001)

    Google Scholar 

  8. Courcelle, B.: On recognizable sets and tree automata. In: Aít-Kaci, H., Nivat, M. (eds.) Resolution of Equations in Algebraic Structures, vol. 1, pp. 93–126. Academic Press, London (1989)

    Google Scholar 

  9. Starke, P.: Graph grammars for Petri net processes. EIK 19, 199–233 (1983)

    MATH  MathSciNet  Google Scholar 

  10. Grabowski, J.: On partial languages. Annales Societatis Mathematicas Polonae, Fundamenta Informaticae IV 2, 428–498 (1981)

    Google Scholar 

  11. Priese, L., Wimmel, H.: Theoretische Informatik: Petri-Netze. Springer, Heidelberg (2002)

    Google Scholar 

  12. Hack, M.: Petri net languages. Technical report, Computation Structure Group Memo 124, Project MAC, MIT (1975)

    Google Scholar 

  13. Wimmel, H.: Algebraische Semantiken für Petri-Netze (Ph.D. Thesis). Verlag Fölbach, Koblenz (2000)

    Google Scholar 

  14. Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol. 962, pp. 175–189. Springer, Heidelberg (1995)

    Google Scholar 

  15. Schuth, M.: Petri-Netz Semantik mittels dags. Technical report, Master Thesis, Universität Koblenz-Landau (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Koblenz-Landau, Germany

    Lutz Priese

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Applicazioni, Università di Salerno, via Ponte Don Melillo, 84084, Fisciano, SA, Italy

    Clelia De Felice

  2. Dipartimento di Matematica ed Applicazioni, Università di Palermo, Via Archirafi, 34, 90123, Palermo, Italy

    Antonio Restivo

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Priese, L. (2005). Semi-rational Sets of DAGs. In: De Felice, C., Restivo, A. (eds) Developments in Language Theory. DLT 2005. Lecture Notes in Computer Science, vol 3572. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11505877_34

Download citation

  • DOI: https://doi.org/10.1007/11505877_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26546-7

  • Online ISBN: 978-3-540-31682-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation