Felder M., A. Gargantini, and A. Morzenti. "A Theory of Implementation and Refinement in Timed Petri Nets". Theoretical Computer Science, July 1998, vol. 202, (no. 1-2): 127-61. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Formal Development and Validation Methodology for System Design - Serugendo (1999) (Correct)
....theory is derived, noted . On the basis of the two above predicates and arithmetic operators, formulae can be expressed over the net. If a formula can be derived from the theory of , KE , then every execution of the net satisfies the property . The implementation relation, of Felder et al. [7], of a net by a net , is based on the preservation of observable properties. A net implements a net if the observable properties of are also observable properties of after translating them into . The only observable events in a net are transition firings. Therefore, an observable ....
M. Felder, A. Gargantini, and A. Morzenti. A theory of implementation and refinement in timed Petri nets. Theoretical Computer Science, 202(1--2):127--16, 1998.
Parallel Refinement Mechanisms for Real-Time Systems - Kolano, Kemmerer, Mandrioli (2000) (Correct)
....relations have been advocated [DiM 99] The issue of refinement becomes even more critical when dealing with real time systems where time analysis is a crucial factor. In this case, the literature exhibits only a few, fairly limited proposals. CKM 95] is the origin of the present proposal. FGM 98] addresses the issue within the context of timed Petri nets and the TRIO language. In this approach, a system is modeled as a timed Petri net and its properties are described as TRIO formulas. Then, mechanisms are given that refine the original net into a more detailed one that preserves the ....
Felder M., A. Gargantini, and A. Morzenti. "A Theory of Implementation and Refinement in Timed Petri Nets". Theoretical Computer Science, July 1998, vol. 202, (no. 1-2): 127-61.
Parallel Refinement Mechanisms for Real-Time Systems - Kolano, Kemmerer, Mandrioli (2000) (Correct)
....of inter level relations have been advocated [5] The issue of refinement becomes even more critical when dealing with real time systems where time analysis is a crucial factor. In this case, the literature exhibits only a few, fairly limited proposals. 3] is the origin of the present proposal. [6] addresses the issue within the context of timed Petri nets and the TRIO language. In this approach, a system is modeled as a timed Petri net and its properties are described as TRIO formulas. Then, mechanisms are given that refine the original net into a more detailed one that preserves the ....
Felder M., A. Gargantini, and A. Morzenti. "A Theory of Implementation and Refinement in Timed Petri Nets". Theoretical Computer Science, July 1998, vol. 202, (no. 1-2): 127-61.
A Formal Development and Validation Methodology for System Design - Serugendo (1999) (Correct)
....is derived, noted N . On the basis of the two above predicates and arithmetic operators, formulae can be expressed over the net. If a formula OE can be derived from the theory of N , N OE, then every execution of the net satisfies the property OE. The implementation relation, of Felder et al. [7], of a net S by a net I , is based on the preservation of observable properties. A net I implements a net S if the observable properties of S are also observable properties of I after translating them into I . The only observable events in a net are transition firings. Therefore, an observable ....
M. Felder, A. Gargantini, and A. Morzenti. A theory of implementation and refinement in timed Petri nets. Theoretical Computer Science, 202(1--2):127--16, 1998.
A theory of implementation and refinement in timed Petri.. - Felder, Gargantini.. (1998) (5 citations) Self-citation (Felder Gargantini Morzenti) (Correct)
....argument of Dist. A sample thereof is given in Table 1, together with short intuitive explanations, whenever needed. TRIO has been given a model theoretical semantics in [16] in a fairly standard way. In [12] we defined a sound and (relatively) complete axiomatic system which is reported in [8], together with some useful metatheorems. In this axiomatic system the metatheorems usually found in ordinary predicate calculus can be proved: we mention, among others, the Deduction Theorem, the Generalization theorem, and the #Elsewhere we defined more complex versions of the language that ....
....( fireth (r, i) d) can be immediately derived. Fig. 1. A simple net F. transition, in a form that depends on the net topology (i.e. on the places of z v and v z , and on the transitions in their respective presets and postsets) The general form of the topology dependent axioms is reported in [8]: we illustrate here the axioms B (v ) B (v ) I (v ) and O (v ) specifying such properties for transition v in the simple net fragment F of Fig. 1, to give the reader an intuitive understanding of how they can be expressed as TRIO axioms. B(v) fireth (v, i )P#d(d m # ##j (tokenP (r, j, p, v, ....
[Article contains additional citation context not shown here]
M. Felder, A. Gargantini, A. Morzenti, A theory of implementation and refinement in timed petri nets, Tech. Report 95-044, Politecnico di Milano, Dipartimento di Elettronica e Informazione, Sept. 1995 (also available via anonymous ftp on the site ftp-se.elet.polimi.it as file /dist/Papers/FormalMethods/ DualLanguage/TechRep95-044.ps.z).
Parallel Refinement Mechanisms for Real-Time Systems - Kolano, Kemmerer, Mandrioli (2000) (Correct)
No context found.
Felder M., A. Gargantini, and A. Morzenti. "A Theory of Implementation and Refinement in Timed Petri Nets". Theoretical Computer Science, July 1998, vol. 202, (no. 1-2): 127-61.
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