Kleene Theorems for Product Systems

  • Kamal Lodaya
  • Madhavan Mukund
  • Ramchandra Phawade
Conference paper

DOI: 10.1007/978-3-642-22600-7_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Lodaya K., Mukund M., Phawade R. (2011) Kleene Theorems for Product Systems. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

Abstract

We prove Kleene theorems for two subclasses of labelled product systems which are inspired from well-studied subclasses of 1-bounded Petri nets. For product T-systems we define a corresponding class of expressions. The algorithms from systems to expressions and in the reverse direction are both polynomial time. For product free choice systems with a restriction of structural cyclicity, that is, the initial global state is a feedback vertex set, going from systems to expressions is still polynomial time; in the reverse direction it is polynomial time with access to an NP oracle for finding deadlocks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Kamal Lodaya
    • 1
  • Madhavan Mukund
    • 2
  • Ramchandra Phawade
    • 1
  1. 1.The Institute of Mathematical SciencesChennaiIndia
  2. 2.Chennai Mathematical InstituteSiruseriIndia

Personalised recommendations