Step coverability algorithms for communicating systems

Science of Computer Programming

Volumn 77, Issue 7-8, 2012, Pages 955-967

  Kleijn, Jetty ^a   Koutny, MacIej ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Communicating components; Determinism; Maximal concurrency; Petri nets; Step coverability tree

Indexed keywords

COMMUNICATING COMPONENTS; COVERABILITY; DETERMINISM; DISTRIBUTED DYNAMICS; DYNAMIC BEHAVIOURS; GENERAL CLASS; LOCAL STATE; MAXIMAL CONCURRENCY; SHARED BUFFER; TREE CONSTRUCTION;

ALGORITHMS; PETRI NETS; SEMANTICS;

FORESTRY;

ALGORITHMS; COMMUNICATION; COMPUTER PROGRAMING; FORESTRY;

EID: 84859736551     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2010.11.003     Document Type: Article

References (21)

1. H.-D. Burkhard On priorities of parallelism: petri nets under the maximum firing strategy A. Salwicki, Proc. of Logics of Programs Lecture Notes in Computer Science vol. 148 1983 Springer-Verlag 86 97
2. N. Busi Analysis issues in Petri nets with inhibitor arcs Theoretical Computer Science 275 2002 127 177 (Pubitemid 34249554)
3. L.P. Carloni, and A.L. Sangiovanni-Vincentelli A framework for modeling the distributed deployment of synchronous designs Formal Methods in System Design 28 2006 93 110 (Pubitemid 43814126)
4. F. Commoner, A.W. Holt, S. Even, and A. Pnueli Marked directed graphs Journal of Computer and System Sciences 5 1971 511 523
5. Ph. Darondeau, B. Genest, P.S. Thiagarajan, and S. Yang Quasi-static scheduling of communicating tasks F. van Breugel, M. Chechik, International Conference on Concurrency Theory CONCUR Lecture Notes in Computer Science vol. 5201 2008 Springer-Verlag 310 324
6. J. Desel, W. Reisig, Place/transition Petri nets, in: [17] pp. 122-173.
7. A.H. Ghamarian, M.C.W. Geilen, T. Basten, B.D. Theelen, M.R. Mousavi, and S. Stuijk Liveness and boundedness of synchronous data flow graphs Proc. of Formal Methods in Computer-Aided Design 2006 IEEE Computer Society 68 75 (Pubitemid 47159926)
8. A.H. Ghamarian, M.C.W. Geilen, S. Stuijk, T. Basten, A.J.M. Moonen, M.J.G. Bekooij, B.D. Theelen, and M.R. Mousavi Throughput analysis of synchronous data flow graphs Proc. of Application of Concurrency to System Design 2006 IEEE Computer Society 25 34
9. M. Hack, Decision problems for Petri nets and vector addition systems, Technical Memo 59, Project MAC, MIT, 1975.
10. R.M. Karp, and R.E. Miller Parallel program schemata Journal of Computer and System Sciences 3 1969 147 195
11. J. Kleijn, and M. Koutny Steps and coverability in inhibitor nets K. Lodaya, M. Mukund, R. Ramanujam, Perspectives in Concurrency Theory 2008 Universities Press Hyderabad, India 264 295
12. J. Kleijn, and M. Koutny Applying step coverability trees to communicating component-based systems F. Arbab, M. Sirjani, Proc. of Fundamentals of Software Engineering Lecture Notes in Computer Science vol. 5961 2010 Springer-Verlag 178 193
13. J. Kleijn, M. Koutny, and G. Rozenberg Process semantics for membrane systems Journal of Automata, Languages and Combinatorics 11 2006 321 340
14. E. Krepska, N. Bonzanni, K.A. Feenstra, W. Fokkink, T. Kielmann, H.E. Bal, and J. Heringa Design issues for qualitative modelling of biological cells with Petri nets J. Fisher, Proc. of Formal Methods in Systems Biology Lecture Notes in Computer Science vol. 5054 2008 48 62
15. Gh. Pun Membrane Computing. An Introduction 2002 Springer-Verlag
16. J.L. Peterson Petri Net Theory and the Modeling of Systems 1981 Prentice Hall
17. W. Reisig, and G. Rozenberg Lectures on Petri Nets I: Basic Models, Advances in Petri Nets Lecture Notes in Computer Science vol. 1491 1998 Springer-Verlag
18. E. Teruel, P. Chrzastowski-Wachtel, J.M. Colom, and M. Silva On weighted T-systems Jensen K., Proc. of Application and Theory of Petri Net Lecture Notes in Computer Science vol. 616 1992 Springer-Verlag 348 367
19. A. Valmari, The state explosion problem, in: [17] pp. 429-528.
20. H. Wimmel, Entscheidbarkeitsfragen bei Petri Netzen. Habilitation, Carl von Ossietzky Universitt Oldenburg, 2007.
21. M. Yoeli Specification and verification of asynchronous circuits using marked graphs K. Voss, H.J. Genrich, G. Rozenberg, Concurrency and Nets: Advances in Petri Nets 1987 Springer-Verlag 605 622