G. Winskel. Petri nets, algebras, morphisms, and compositionality. Inf. & Comput., 72, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Combining Probabilistic Automata: Categorial Characterization - Mateus, Sernadas (Correct)
....aggregation, interconnection and constraining of such automata as universal constructions. These concepts extend to probabilistic automata the established definitions of aggregation and interconnection of classical (non probabilistic) automata or transition systems, as presented for example in [Win87, WN95] We assume that the reader is familiar with the use of probabilistic automata, the notions of aggregation and interconnection of non probabilistic automata, and the basics of category theory. We also use cartesian liftings that are presented from first principles in [BW90] Note that for ....
G. Winskel. Petri nets, algebras, morphisms, and compositionality. Inform. and Comput., 72(3):197--238, 1987.
Precategories for Combining Probabilistic Automata - Mateus, Sernadas, Sernadas (1999) (2 citations) (Correct)
....aggregation, interconnection and constraining of such automata as universal constructions. These concepts extend to probabilistic automata the established definitions of aggregation and interconnection of classical (nonprobabilistic) automata or transition systems, as explored for example in [Win87, SCS94, WN95, SSC98]. We assume that the reader is familiar with the use of probabilistic automata, the notions of aggregation and interconnection of nonprobabilistic automata, and the basics of category theory. We also use Cartesian liftings that are presented from first principles in [BW90] 2 What morphism The ....
G. Winskel. Petri nets, algebras, morphisms, and compositionality. Inform. and Comput., 72(3):197--238, 1987.
Events in Security Protocols - Federico Crazzolara Glynn (2001) (18 citations) Self-citation (Winskel) (Correct)
....t. ii) If Net(p) has a run e1 , ek from the initial marking Init(p) t, then has a run e # 1 , e # k where e1 , ek = #(e # 1 ) #(e # k ) The construction used to obtain above is an example of the construction for eliminating colours from a coloured net see [14]; first colours are introduced to the persistent conditions and input events of Net(p) to distinguish the different ways in which they are made to occur, and then eliminated through splitting the conditions and events according to their colours. The result in this case is a basic net. Its runs ....
G. Winskel. Petri nets, algebras, morphisms, and compositionality. Inf. & Comput., 72, 1987.
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