M. Broy. Informatik -- Eine grundlegende Einfuhrung, Teil 1: Problemnahe Programmierung, volume 1. Springer-Verlag, Berlin, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Formally Founded Description Technique for Business Processes - Thurner (1997) (6 citations) (Correct)
....their composition. Compositionality is necessary for formalizing refinement. We assign a function with adequate input output signature to each process type, which formalizes the process type s computation scheme. This usage of function composition is related to computation forms, discussed e.g. in [4]. Some existing approaches to process modeling define a semantics based on event traces (for example [12] The technique of event traces may be applied efficiently for modeling process networks where the execution of processes is partially ordered. In our notion of processes, however, we also ....
M. Broy. Informatik -- Eine grundlegende Einfuhrung, Teil 1: Problemnahe Programmierung, volume 1. SpringerVerlag, Berlin, 1992.
A Formally Founded Description Technique for Business Processes - Thurner (1997) (6 citations) (Correct)
....processes is based on functions and their composition. Compositionality is necessary for formalizing refinement, or, if seen from another angle, the composition of single processes to a process network. This usage of function composition is related to computation forms which are discussed e.g. in [Bro92] In the definition of semantics, we assign a function with adequate input output signature to each process type. This function formalizes the computation scheme associated with the process type. Some existing approaches to process modeling define a semantics based on event traces (for example ....
M. Broy. Informatik -- Eine grundlegende Einfuhrung, Teil 1: Problemnahe Programmierung, volume 1. Springer-Verlag, Berlin, 1992.
Stream Semantics for Mini-Statecharts - Nazareth, Regensburger, Scholz (Correct)
....Syntax In this section we propose a textual syntax for Mini Statecharts. We give an abstract, inductively defined syntax for the set of all Mini Statecharts S. Let M denote a (potentially infinite) set of signal names, States a (potentially infinite) set of state names and B(M) the boolean terms [Bro93] over M . fin (X) denotes the set of finite subsets of some set X . Now we can formally describe our abstract syntax. 2.1 Sequential Automata Sequential automata are the only basic elements of Mini Statecharts. The construct ( Sigma; oe d ; oe; ffi ) is an element of S iff the following ....
M. Broy. Informatik --- Eine grundlegende Einfuhrung (Teil 2). Springer, Berlin/Heidelberg, 1993.
A Formally Founded Description Technique for Business Processes - Thurner (1997) (6 citations) (Correct)
No context found.
M. Broy. Informatik -- Eine grundlegende Einfuhrung, Teil 1: Problemnahe Programmierung, volume 1. Springer-Verlag, Berlin, 1992.
A Formally Founded Description Technique for Business.. - Veronika Thurner.. (1997) (6 citations) (Correct)
No context found.
M. Broy. Informatik -- Eine grundlegende Einfuhrung, Teil 1: Problemnahe Programmierung, volume 1. SpringerVerlag, Berlin, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC