Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Selected papers from the International Conference on Computer Science, Software Engineering, Information Technology, e-Business, and Applications, 2003
Article type: Research Article
Authors: Uzal, R.a; * | Riesco, D.a | Montejano, G.a | Vilallonga, G.a | Debnath, Narayan C.b
Affiliations: [a] Universidad Nacional de San Luis, Departamento de Informática, Ejército de los Andes 950, 5700 – San Luis, Argentina | [b] Department of Computer Science, Winona State University, Winona, MN 55987, USA
Correspondence: [*] Corresponding author: E-mail: ruzal@unsl.edu.ar.
Abstract: PN (PN) are tools for the analysis and design of concurrent systems. There is a formal theory, which supports PN. An extension of PN is Petri Nets with Clocks (PNwC). PNwC are useful to model systems with temporal requirements via specification of clocks, using temporal invariants for the places and temporal conditions in the transitions. Using invariants in places allows the specifications of hard deadlines constrains (upper bound constrains): when a deadline is reached the progress of time is blocked by the invariant and the action becomes urgent. An algorithm for the analysis of a PNwC has been proposed in [1]. The algorithm is oriented to the verification and correction of errors in the modelling of the time variable. The algorithm generates information about temporal unreachable states and process deadlocks with temporal blocks. Also, it corrects places invariants and transitions conditions. We present here a formalism for PNwC based on Timed Graphs. The analysis algorithm is presented here using the formalism. We show here how Petri Net theory can be joined with Timed Graph theory to construct a formalism, which supports a tool for the analysis of models of concurrent process with real time specification.
Keywords: PN, timed graphs, timed PN, CASE tools, real time systems
DOI: 10.3233/JCM-2005-5S114
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 5, no. s1, pp. S185-S199, 2005
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl