×

Syntactical colored Petri nets reductions. (English) Zbl 1170.68538

Peled, Doron A. (ed.) et al., Automated technology for verification and analysis. Third international symposium, ATVA 2005, Taipei, Taiwan, October 4–7, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29209-8/pbk). Lecture Notes in Computer Science 3707, 202-216 (2005).
Summary: In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread) and global algebraic ones (e.g. related to the threads synchronization). We show that these conditions are performed in a syntactical way, when a syntax of the color mappings is given. We show also how our method outperforms previous ones on a recent case study with regard both to the reduction ratio and the automatization of their application.
For the entire collection see [Zbl 1089.68013].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Software:

Quasar
PDFBibTeX XMLCite
Full Text: DOI