Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Verification of Logs - Revealing Faulty Processes of a Medical Laboratory Read chapter Read first chapter

2015 | OriginalPaper | Chapter

Kleene Theorems for Synchronous Products with Matching

Authors : Ramchandra Phawade, Kamal Lodaya

Published in: Transactions on Petri Nets and Other Models of Concurrency X

Publisher: Springer Berlin Heidelberg

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In earlier work [LMP11], we showed that a graph-theoretic condition called “structural cyclicity” enables us to extract syntax from a conflict-equivalent product system of automata. In this paper we have a “pairing” property in our syntax which allows us to connect to a broader class of synchronous product systems [Arn94] with a “matching” property, where the conflict-equivalence is not statically fixed. These systems have been related to labelled free choice nets.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter SMT-Based Abstract Parametric Temporal Planning
next chapter Symbolic Model Checking of Security Protocols for Ad hoc Networks on any Topologies
Footnotes
1
A preliminary version of this paper appeared at the 8th PNSE workshop in Tunis [PL14]. We thank the organizers for all the help provided for the presentation.
 
Literature
[Ant96]
Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theor. Comput. Sci. 155(2), 291–319 (1996)MathSciNetCrossRefMATH
[Arn94]
Arnold, A.: Finite Transition Systems. Prentice-Hall, UK (1994)
[Brz64]
[DE95]
Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)CrossRefMATH
[GR92]
Garg, V.K., Ragunath, M.T.: Concurrent regular expressions and their relationship to Petri nets. Theor. Comput. Sci. 96(2), 285–304 (1992)MathSciNetCrossRefMATH
[Gra81]
[Hac72]
Hack, M.H.T.: Analysis of production schemata by Petri nets. Project Mac report TR-94. MIT (1972)
[LMP11]
Lodaya, K., Mukund, M., Phawade, R.: Kleene theorems for product systems. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 235–247. Springer, Heidelberg (2011) CrossRef
[LRR03]
Lodaya, K., Ranganayakulu, D., Rangarajan, K.: Hierarchical structure of 1-safe petri nets. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 173–187. Springer, Heidelberg (2003) CrossRef
[LS05]
[LS10]
[LW00]
[Mir66]
Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Eng. Cybern. 5, 110–116 (1966)
[MR02]
Mohalik, S., Ramanujam, R.: Distributed automata in an assumption-commitment framework. Sādhanā 27(Part 2), 209–250 (2002)MathSciNetMATH
[Muk11]
Mukund, M.: Automata on distributed alphabets. In: D’Souza, D., Shankar, P. (eds.) Modern Applications of Automata Theory, pp. 257–288. World Scientific, Singapore (2011)
[MY60]
McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Trans. IRS EC–9, 39–47 (1960)MATH
[Pha14a]
Phawade, R.: Direct product representation of labelled free choice nets. Int. J. Comput. Appl. 99(16), 1–8 (2014)
[Pha14b]
Phawade, R.: Labelled Free Choice Nets, finite Product Automata, and Expressions. Ph.D. thesis, Homi Bhabha National Institute (2014, submitted)
[PL14]
Phawade, R., Lodaya, K.: Kleene theorems for labelled free choice nets. In: Proceedings of the 8th PNSE. CEUR-WS, Tunis, vol. 1160, pp. 75–89 (2014)
[SH96]
Straub, P.A., Carlos Hurtado, L.: Business process behaviour is (almost) free-choice. In: Proceedings of CESA, Lille, pp. 9–12. IEEE (1996)
[TY14]
[Zie87]
Metadata
Title
Kleene Theorems for Synchronous Products with Matching
Authors
Ramchandra Phawade
Kamal Lodaya
Copyright Year
2015
Publisher
Springer Berlin Heidelberg
Book
Transactions on Petri Nets and Other Models of Concurrency X

Print ISBN: 978-3-662-48649-8

Electronic ISBN: 978-3-662-48650-4

Copyright Year: 2015

DOI
https://doi.org/10.1007/978-3-662-48650-4_5

Premium Partner

    Image Credits