Skip to main content
SpringerLink
Log in

On the Parameterized Complexity of d-Restricted Boolean Net Synthesis

  • Conference paper
  • First Online:
Theory and Applications of Models of Computation (TAMC 2020)

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

Abstract

In this paper, we investigate the parameterized complexity of d-restricted \(\tau \)-synthesis (dR\(\tau \)S) parameterized by d for a range of Boolean types of nets \(\tau \). We show that dR\(\tau \)S is W[1]-hard for 64 of 128 possible Boolean types that allow places and transitions to be independent.

Supported by DFG through grant Be 1267/16-1 ASYST.

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 EPUB and 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

References

  1. Badouel, E., Bernardinello, L., Darondeau, P.: The synthesis problem for elementary net systems is NP-complete. Theor. Comput. Sci. 186(1–2), 107–134 (1997). https://doi.org/10.1016/S0304-3975(96)00219-8

    Article  MathSciNet  MATH  Google Scholar 

  2. Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. TTCSAES. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47967-4

    Book  MATH  Google Scholar 

  3. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  4. Schmitt, V.: Flip-flop nets. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 515–528. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-60922-9_42

    Chapter  Google Scholar 

  5. Tredup, R.: The complexity of synthesizing NOP-equipped Boolean nets from G-bounded inputs (technical report), submitted for topnoc 2020 (2019)

    Google Scholar 

  6. Tredup, R., Rosenke, C.: The complexity of synthesis for 43 Boolean Petri net types. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 615–634. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-14812-6_38

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Theoretische Informatik, Universität Rostock, Albert-Einstein-Straße 22, 18059, Rostock, Germany

    Ronny Tredup

  2. Department of Computing Science, Carl von Ossietzky Universität Oldenburg, 26111, Oldenburg, Germany

    Evgeny Erofeev

Authors
  1. Ronny Tredup
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evgeny Erofeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ronny Tredup .

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, USA

    Jianer Chen

  2. School of Computer Science and Engineering, Central South University, Changsha, China

    Qilong Feng

  3. Department of Computer Science and Engineering, State University of New York at Buffalo, Buffalo, NY, USA

    Jinhui Xu

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tredup, R., Erofeev, E. (2020). On the Parameterized Complexity of d-Restricted Boolean Net Synthesis. In: Chen, J., Feng, Q., Xu, J. (eds) Theory and Applications of Models of Computation. TAMC 2020. Lecture Notes in Computer Science(), vol 12337. Springer, Cham. https://doi.org/10.1007/978-3-030-59267-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59267-7_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59266-0

  • Online ISBN: 978-3-030-59267-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation