E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647--679, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Tile Model - Gadducci, Montanari (24 citations) (Correct)
....the paper is that tile logic represent a generalisation of sos specifications. This is obviously true to a certain extent, since we are able to take into account contexts (that is, partially unspecified processes) A useful device both in verification [30] and truly concurrent analysis of systems [1]. Nevertheless, a natural question to be asked is if, for a given sos specification, there exists a suitable rewriting system preserving its operational behaviour. In a first approximation, this obviously depends on which kind of system we consider. As an example, we already noted that graph ....
....system preserving its operational behaviour. In a first approximation, this obviously depends on which kind of system we consider. As an example, we already noted that graph systems generalise context systems [30] moreover, they are fully adequate for those algebras in basic deSimone format [1], i.e. where all the rules are of the form P i a i Gamma Q i for i 2 I f(P 1 ; Pn ) a Gamma g(Q 1 ; Qn ) where f; g 2 Sigma P , a i ; a 2 AP and I f1 : ng. Moreover, all the P i s, Q j s are different, except for P k = Q k with k 62 I . Actually, algebraic ....
E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647--679, 1995.
The Tile Model - Gadducci, Montanari (1996) (24 citations) (Correct)
....there exists a suitable rewriting system preserving its operational behaviour. In a first approximation, this obviously depends on which kind of system we consider. As an example, monoidal systems (which generalize context systems) are fully adequate for those algebras in basic deSimone format [BD95], i.e. where all the rules are of the form P i a i Gamma Q i for i 2 I f(P 1 ; Pn ) a Gamma g(Q 1 ; Qn ) where f; g 2 Sigma P , a i ; a 2 ActP and I f1 : ng. Moreover, all the P i s, Q j s are different, except for P k = Q k with k 62 I . It is immediate to see ....
E. Badouel, P. Darondeau, Trace Nets and Process Automata, Acta Informatica 32 (7), 1995. pp. 647-679.
Synthesis of Nets With Inhibitor Arcs - Busi, Pinna (Correct)
....a condition that must hold for an event to happen. One of the basic questions was: how it is possible to synthesize a net from the sequential observations of its behaviour (usually represented as a transition system) and which properties characterize such sequential observations (see also [2, 3, 1, 11] and [14, 10] among others, also for the synthesis of nets from non sequential observation) Research partially supported by MURST, quota 60 . 2 These arcs are called contextual arcs in [9] and read arcs in [13] In this paper we consider the problem of synthesizing an elementary net ....
E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647--679, 1995.
The Tile Model - Gadducci, Montanari (24 citations) (Correct)
....the paper is that tile logic represent a generalization of sos specifications. This is obviously true to a certain extent, since we are able to take into account contexts (that is, partially unspecified processes) A useful device both in verification [29] and truly concurrent analysis of systems [1]. Nevertheless, a natural question to be asked is if, for a given sos specification, there exists a suitable rewriting system preserving its operational behaviour. In a first approximation, this obviously depends on which kind of system we consider. As an example, we already noted that monoidal ....
....system preserving its operational behaviour. In a first approximation, this obviously depends on which kind of system we consider. As an example, we already noted that monoidal systems generalize context systems [29] moreover, they are fully adequate for those algebras in basic deSimone format [1], i.e. where all the rules are of the form P i a i Gamma Q i for i 2 I f(P 1 ; Pn ) a Gamma g(Q 1 ; Qn ) where f; g 2 Sigma P , a i ; a 2 ActP and I f1 : ng. Moreover, all the P i s, Q j s are different, except for P k = Q k with k 62 I. Actually, algebraic ....
E. Badouel and P. Darondeau. Trace nets and process automata. Acta Informatica, 32:647--679, 1995.
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