Testing the executability of scenarios in general inhibitor nets

Proceedings - 7th International Conference on Application of Concurrency to System Design, ACSD 2007

Volumn , Issue , 2007, Pages 167-176

  Lorenz, Robert ^a   Mauser, Sebastian ^a   Bergenthum, Robin ^a  

^a CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; GRAPH THEORY; MARINE BIOLOGY; PETRI NETS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; SYSTEMS ANALYSIS;

FLOW OPTIMIZATION; FLOW PROPERTIES; GENERAL (CO); INHIBITOR ARCS; INHIBITOR NETS; INTERNATIONAL CONFERENCES; PLACE/TRANSITION (P/T) PETRI NETS; POLYNOMIAL ALGORITHMS; POLYNOMIAL-TIME; SYSTEM DESIGNS;

MATHEMATICAL TRANSFORMATIONS;

EID: 51149083265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSD.2007.73     Document Type: Conference Paper

References (15)

1. J. Billington. Protocol specification using p-graphs, a technique based on coloured petri nets. In W. Reisig; G. Rozenberg [15], pages 293-330.
2. S. Donatelli and G. Franceschinis. Modelling and analysis of distributed software using gspns. In W. Reisig; G. Rozenberg [15], pages 438-476.
3. L. Ford and D. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399-404, 1956.
4. H. Gaifman and V. R. Pratt. Partial order models of concurrency and the computation of functions. In LICS, pages 72-85. IEEE Computer Society, 1987.
5. R. Janicki and M. Koutny. Invariants and paradigms of concurrency theory. In E. H. L. Aarts, J. v. Leeuwen, and M. Rem, editors, PARLE (2), volume 506 of Lecture Notes in Computer Science, pages 59-74. Springer, 1991.
6. R. Janicki and M. Koutny. Semantics of inhibitor nets. Inf. Comput., 123(1): 1-16, 1995.
7. G. Juhás, R. Lorenz, and J. Desel. Can i execute my scenario in your net?. In G. Ciardo and P. Darondeau, editors, ICATPN, volume 3536 of Lecture Notes in Computer Science, pages 289-308. Springer, 2005.
8. G. Juhás, R. Lorenz, and S. Mauser. Complete process semantics for inhibitor nets. In Proceedings of ICATPN 2007, 2007.
9. A. Kiehn. On the interrelation between synchronized and non-synchronized behaviour of petri nets. Elektronische Informationsverarbeitung und Kybernetik, 24(1/2):3-18, 1988.
10. H. C. M. Kleijn and M. Koutny. Process semantics of general inhibitor nets. Inf. Comput., 190(1): 18-69, 2004.
11. R. Lorenz, S.Mauser, and R. Bergenthum. Testing the executability of scenarios in general inhibitor nets. Technical report, 2007. http://www.informatik.kueichstaett.de/lorenz/techreports/verification.pdf.
12. 3) algorithm for finding maximum flows in networks. Information Processing Letters, 7(6):277-278, 1978.
13. J.Peterson. Petri Net Theory and the Modeling of Systems. Prentice-Hall, 1981.
14. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets., volume 625 of Lecture Notes in Computer Science. Springer, 1992.
15. W. Reisig; G. Rozenberg, editor. Lectures on Petri Nets II: Applications, Advances in Petri Nets, volume 1492 of Lecture Notes in Computer Science. Springer, 1998.