Skip to main content
Top

2018 | OriginalPaper | Chapter

Modeling Operational Semantics with Interval Orders Represented by Sequences of Antichains

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

search-config
loading …

Abstract

A representation of interval orders by sequences of antichains is discussed and its relationship to the Fishburn’s representation by sequences of beginnings and endings is analyzed in detail. Using sequences of antichains to model operational semantics of elementary inhibitor nets is also discussed.

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!

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!

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!

Footnotes
1
‘Operational semantics’ is not a generally agreed concept, in this paper this will be just a collection of all system runs (i.e. executions, observations) [3, 11, 15, 19]. A different meaning is used in for example [4].
 
2
For uncountable X it is additionally required that the equivalence relation \(\sim _<\) defined as \(a \sim _<~\!b \iff \forall c\in X. (c<a \Leftrightarrow c<b) \wedge (a<c \Leftrightarrow b<c)\) has countably many equivalence classes [6]. But in this paper we need only a simpler version for countable X, cf. [11].
 
3
Inhibitor arcs allow a transition to check for an absence of a token. In principle they allow ‘test for zero’, an operator the standard Petri nets do not have. They were introduced in [1].
 
Literature
1.
go back to reference Agerwala, T., Flynn, M.: Comments on capabilities, limitations and “correctness” of Petri nets. Comput. Architect. News 4(2), 81–86 (1973)CrossRef Agerwala, T., Flynn, M.: Comments on capabilities, limitations and “correctness” of Petri nets. Comput. Architect. News 4(2), 81–86 (1973)CrossRef
2.
go back to reference Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26, 832–843 (1983)CrossRef Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26, 832–843 (1983)CrossRef
3.
go back to reference Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theor. Comput. Sci. 323, 129–189 (2004)MathSciNetCrossRef Baldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. Theor. Comput. Sci. 323, 129–189 (2004)MathSciNetCrossRef
5.
go back to reference Cormen, T.H., Leiserson, C.E., Rivest, D.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)MATH Cormen, T.H., Leiserson, C.E., Rivest, D.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)MATH
6.
go back to reference Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)MathSciNetCrossRef Fishburn, P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psychol. 7, 144–149 (1970)MathSciNetCrossRef
7.
go back to reference Fishburn, P.C.: Interval Orders and Interval Graphs. Wiley, New York (1985)MATH Fishburn, P.C.: Interval Orders and Interval Graphs. Wiley, New York (1985)MATH
9.
go back to reference Hopcroft, J.E., Motwani, R., Ullman, J.D.: Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2001)MATH Hopcroft, J.E., Motwani, R., Ullman, J.D.: Automata Theory, Languages, and Computation. Addison-Wesley, Boston (2001)MATH
13.
go back to reference Janicki, R., Yin, X.: Modeling concurrency with interval orders. Inf. Comput. 253, 78–108 (2017)CrossRef Janicki, R., Yin, X.: Modeling concurrency with interval orders. Inf. Comput. 253, 78–108 (2017)CrossRef
16.
go back to reference Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural notions for elementary net systems. Distrib. Comput. 4, 45–57 (1990)MathSciNetCrossRef Nielsen, M., Rozenberg, G., Thiagarajan, P.S.: Behavioural notions for elementary net systems. Distrib. Comput. 4, 45–57 (1990)MathSciNetCrossRef
20.
go back to reference Wiener, N.: A contribution to the theory of relative position. In: Proceedings of the Cambridge Philosophical Society, vol. 17, pp. 441–449 (1914) Wiener, N.: A contribution to the theory of relative position. In: Proceedings of the Cambridge Philosophical Society, vol. 17, pp. 441–449 (1914)
21.
go back to reference Zuberek, W.M.: Timed Petri nets and preliminary performance evaluation. In: Proceedings of the 7th Annual Symposium on Computer Architecture, La Baule, France, pp. 89–96 (1980) Zuberek, W.M.: Timed Petri nets and preliminary performance evaluation. In: Proceedings of the 7th Annual Symposium on Computer Architecture, La Baule, France, pp. 89–96 (1980)
Metadata
Title
Modeling Operational Semantics with Interval Orders Represented by Sequences of Antichains
Author
Ryszard Janicki
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-91268-4_13

Premium Partner