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: Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2017
Guest editors: Wil van der Aalst, Eike Best and Wojciech Penczek
Article type: Research Article
Authors: Dalsgaard, Andreas E.a | Enevoldsen, Sørena | Fogh, Petera | Jensen, Lasse S.a | Jensen, Peter G.a | Jepsen, Tobias S.a | Kaufmann, Isabellaa | Larsen, Kim G.a | Nielsen, Søren M.a | Olesen, Mads Chr.a | Pastva, Samuelb | Srba, Jiříc; †
Affiliations: [a] Department of Computer Science, Aalborg University, Denmark | [b] Faculty of Informatics, Masaryk University, Czech Republic | [c] Department of Computer Science, Aalborg University, Denmark. [email protected]
Correspondence: [†] Address for correspondence: Department of Computer Science, Aalborg University, Selma Lagerløfs Vej 300, 9220 Aalborg, Denmark
Note: [*] An extended version of [1].
Abstract: Equivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependency graphs with so-called negation edges in order to increase their applicability. The graphs (as well as the verification problems) suffer from the state space explosion problem. To combat this issue, we design an on-the-fly algorithm for efficiently computing fixed points on extended dependency graphs. Our algorithm supplements previous approaches with the possibility to back-propagate, in certain scenarios, the domain value 0, in addition to the standard back-propagation of the value 1. Finally, we design a distributed version of the algorithm, implement it in our open-source tool TAPAAL, and demonstrate the efficiency of our general approach on the benchmark of Petri net models and CTL queries from the annual Model Checking Contest.
DOI: 10.3233/FI-2018-1707
Journal: Fundamenta Informaticae, vol. 161, no. 4, pp. 351-381, 2018
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
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
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]