Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
129 | Alain Finkel |
The Minimal Coverability Graph for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications and Theory of Petri Nets ![In: Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 210-243, 1991, Springer, 3-540-56689-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Karp-Miller graph, minimal coverability graph, effective computation of the minimal coverability graph, verification of protocols, Petri nets, decidability |
105 | Gil Ratsaby, Baruch Sterin, Shmuel Ur |
Improvements in Coverability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FME ![In: FME 2002: Formal Methods - Getting IT Right, International Symposium of Formal Methods Europe, Copenhagen, Denmark, July 22-24, 2002, Proceedings, pp. 41-56, 2002, Springer, 3-540-43928-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
100 | Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén |
SAT-Solving the Coverability Problem for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 24(1), pp. 25-43, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Petri nets, unfoldings, coverability, infinite state systems, partial-order methods |
89 | Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin |
On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 5th International Symposium, ATVA 2007, Tokyo, Japan, October 22-25, 2007, Proceedings, pp. 98-113, 2007, Springer, 978-3-540-75595-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
89 | Gil Ratsaby, Shmuel Ur, Yaron Wolfsthal |
Coverability Analysis Using Symbolic Model Checking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHARME ![In: Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4-7, 2001, Proceedings, pp. 155-160, 2001, Springer, 3-540-42541-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
82 | Fernando Rosa-Velardo, David de Frutos-Escrig |
Decidability Results for Restricted Models of Petri Nets with Name Creation and Replication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets, 30th International Conference, PETRI NETS 2009, Paris, France, June 22-26, 2009. Proceedings, pp. 63-82, 2009, Springer, 978-3-642-02423-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
78 | JinGang Xie, QingPing Tan, GuoRong Cao |
Modeling and Analyzing Web Service Behavior with Regular Flow Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WISM ![In: Web Information Systems and Mining, International Conference, WISM 2009, Shanghai, China, November 7-8, 2009. Proceedings, pp. 309-319, 2009, Springer, 978-3-642-05249-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
regular flow net, symbolic coverability tree, Web service behavior |
56 | Parosh Aziz Abdulla, Richard Mayr |
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings, pp. 348-363, 2009, Springer, 978-3-642-00595-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
56 | Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin |
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings, pp. 287-298, 2004, Springer, 3-540-24058-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
56 | Michael Leuschel, Helko Lehmann |
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computational Logic ![In: Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, pp. 101-115, 2000, Springer, 3-540-67797-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
49 | Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso |
Replicated Ubiquitous Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (4) ![In: Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part IV, pp. 158-168, 2006, Springer, 3-540-34077-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Guilhem Gamard, Gwénaël Richomme |
Coverability and multi-scale coverability on infinite pictures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 104, pp. 258-277, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
45 | Guilhem Gamard, Gwénaël Richomme |
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1506.08375, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
45 | Alfred Bröckers, Volker Gruhn |
Computer-Aided Verification of Software Process Model Properties ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAiSE ![In: Advanced Information Systems Engineering, CAiSE'93, Paris, France, June 8-11, 1993, Proceedings, pp. 521-546, 1993, Springer, 3-540-56777-1. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
software process model verification, FUNSOFT nets, static and dynamic software process model properties, coverability trees, MELMAC |
39 | Pierre Ganty, Jean-François Raskin, Laurent Van Begin |
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings, pp. 49-64, 2006, Springer, 3-540-31139-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Giorgio Delzanno, Laurent Van Begin |
A Biologically Inspired Model with Fusion and Clonation of Membranes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings, pp. 64-82, 2008, Springer, 978-3-540-85193-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Ranko Lazic 0001, Thomas Christopher Newcomb, Joël Ouaknine, A. W. Roscoe 0001, James Worrell 0001 |
Nets with Tokens Which Carry Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICATPN ![In: Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings, pp. 301-320, 2007, Springer, 978-3-540-73093-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Fernando Rosa-Velardo |
Petri Nets for the Verification of Ubiquitous Systems with Transient Secure Association. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UIC ![In: Ubiquitous Intelligence and Computing, 4th International Conference, UIC 2007, Hong Kong, China, July 11-13, 2007, Proceedings, pp. 1148-1158, 2007, Springer, 978-3-540-73548-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Rohit Chadha, Mahesh Viswanathan 0001 |
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2007 - Concurrency Theory, 18th International Conference, CONCUR 2007, Lisbon, Portugal, September 3-8, 2007, Proceedings, pp. 136-150, 2007, Springer, 978-3-540-74406-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Jung-Heum Park, Hee-Chul Kim, Hyeong-Seok Lim |
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 17(3), pp. 227-240, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
fault-Hamiltonicity, strong Hamiltonicity, recursive circulants, restricted HL-graphs, Fault tolerance, graph theory, embedding, network topology |
33 | Hiroshi Kawakami, Ryosuke Akinaga, Hidetsugu Suto, Osamu Katai |
Translating Novelty of Business Model into Terms of Modal Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australian Conference on Artificial Intelligence ![In: AI 2003: Advances in Artificial Intelligence, 16th Australian Conference on Artificial Intelligence, Perth, Australia, December 3-5, 2003, Proceedings, pp. 821-832, 2003, Springer, 3-540-20646-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Petri Nets, Modal Logic, Business Process Model, Modality, Novelty |
33 | Mitsuharu Yamamoto, Jean-Marie Cottin, Masami Hagiya |
Decidability of Safety Properties of Timed Multiset Rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTRTFT ![In: Formal Techniques in Real-Time and Fault-Tolerant Systems, 7th International Symposium, FTRTFT 2002, Co-sponsored by IFIP WG 2.2, Oldenburg, Germany, September 9-12, 2002, Proceedings, pp. 165-184, 2002, Springer, 3-540-44165-4. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
real-time systems, timed automata, decidability, timed Petri nets |
23 | Philip Amortila, Dylan J. Foster, Akshay Krishnamurthy |
Scalable Online Exploration via Coverability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.06571, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
23 | Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.01581, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in 2-VASS with One Unary Counter is in NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2301.13543, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | A. R. Balasubramanian |
Parameterized Verification of Coverability in Infinite State Broadcast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.13065, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, pp. 131:1-131:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-278-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in 2-VASS with One Unary Counter is in NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2023, Paris, France, April 22-27, 2023, Proceedings, pp. 196-217, 2023, Springer, 978-3-031-30828-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Endre Erós, Kristofer Bengtsson, Knut Åkesson |
Structural Coverability for Intelligent Automation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CASE ![In: 19th IEEE International Conference on Automation Science and Engineering, CASE 2023, Auckland, New Zealand, August 26-30, 2023, pp. 1-6, 2023, IEEE, 979-8-3503-2069-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | Chris Köcher, Georg Zetzsche |
Regular Separators for VASS Coverability Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India, pp. 15:1-15:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-304-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
23 | |
Model Generation with Provable Coverability for Offline Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.00316, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | A. R. Balasubramanian |
Complexity of Coverability in Depth-Bounded Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland., pp. 17:1-17:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-246-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability, Termination, and Finiteness in Recursive Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 183(1-2), pp. 33-66, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Matthias Englert, Piotr Hofman, Slawomir Lasota 0001, Ranko Lazic 0001, Jérôme Leroux, Juliusz Straszynski |
A lower bound for the coverability problem in acyclic pushdown VAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 167, pp. 106079, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Jung-Heum Park |
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 77(7), pp. 6871-6888, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability, Termination, and Finiteness in Recursive Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.06804, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
23 | Ranko Lazic 0001, Sylvain Schmitz |
The ideal view on Rackoff's coverability technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 277, pp. 104582, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | A. R. Balasubramanian |
Parameterized verification of coverability in infinite state broadcast networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 278, pp. 104592, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Jiawen Kang, Yunjun Bai, Li Jiao |
Abstraction-Based Incremental Inductive Coverability for Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 42nd International Conference, PETRI NETS 2021, Virtual Event, June 23-25, 2021, Proceedings, pp. 379-398, 2021, Springer, 978-3-030-76982-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | A. R. Balasubramanian |
Complexity of Coverability in Bounded Path Broadcast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference., pp. 35:1-35:16, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-215-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Minimal Coverability Tree Construction Made Complete and Efficient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, pp. 237-256, 2020, Springer, 978-3-030-45230-8. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Shaull Almagor, Nathann Cohen, Guillermo A. Pérez 0001, Mahsa Shirmohammadi, James Worrell 0001 |
Coverability in 1-VASS with Disequality Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 31st International Conference on Concurrency Theory, CONCUR 2020, September 1-4, 2020, Vienna, Austria (Virtual Conference)., pp. 38:1-38:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-160-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Shaull Almagor, Nathann Cohen, Guillermo A. Pérez 0001, Mahsa Shirmohammadi, James Worrell 0001 |
Coverability in 1-VASS with Disequality Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.06576, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Sylvain Schmitz, Georg Zetzsche |
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.07069, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
23 | Mirko Petrusevski, Riste Skrekovski |
Coverability of graph by three odd subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 92(3), pp. 304-321, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability and Termination in Recursive Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23-28, 2019, Proceedings, pp. 429-448, 2019, Springer, 978-3-030-21570-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Jan Martijn E. M. van der Werf, Lucas Steehouwer |
CoRA: An Online Intelligent Tutoring System to Practice Coverability Graph Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, Aachen, Germany, June 23-28, 2019, Proceedings, pp. 91-100, 2019, Springer, 978-3-030-21570-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Sylvain Schmitz, Georg Zetzsche |
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 193-201, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Pierre-Alain Reynier, Frédéric Servais |
On the Computation of the Minimal Coverability Set of Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 13th International Conference, RP 2019, Brussels, Belgium, September 11-13, 2019, Proceedings, pp. 164-177, 2019, Springer, 978-3-030-30805-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Geffroy, Jérôme Leroux, Grégoire Sutre |
Occam's Razor applied to the Petri net coverability problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 750, pp. 38-52, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Krishnendu Chatterjee, Nir Piterman |
Coverability: Realizability Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.03454, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
23 | A. R. Balasubramanian |
Parameterized Verification of Coverability in Well-Structured Broadcast Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GandALF ![In: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbrücken, Germany, 26-28th September 2018., pp. 133-146, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Engel Lefaucheux, Alessandro Giua, Carla Seatzu |
Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings, pp. 164-183, 2018, Springer, 978-3-319-91267-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Dimitri Watel, Marc-Antoine Weisser, Dominique Barth |
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets and Concurrency - 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25-30, 2017, Proceedings, pp. 330-349, 2017, Springer, 978-3-319-57860-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Geffroy, Jérôme Leroux, Grégoire Sutre |
Backward coverability with pruning for lossy channel systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIN ![In: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Santa Barbara, CA, USA, July 10-14, 2017, pp. 132-141, 2017, ACM, 978-1-4503-5077-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Chunmiao Li, Xiaojuan Cai |
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings, pp. 435-446, 2017, 978-3-319-53732-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Lenka Turonová, Lukás Holík |
Towards Smaller Invariants for Proving Coverability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCAST (2) ![In: Computer Aided Systems Theory - EUROCAST 2017 - 16th International Conference, Las Palmas de Gran Canaria, Spain, February 19-24, 2017, Revised Selected Papers, Part II, pp. 109-116, 2017, Springer, 978-3-319-74726-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Nicolas David 0002, Claude Jard, Didier Lime, Olivier H. Roux |
Coverability Synthesis in Parametric Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany, pp. 14:1-14:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-048-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
23 | Artturi Piipponen, Antti Valmari |
Constructing Minimal Coverability Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 143(3-4), pp. 393-414, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Stefan D. Bruda, Mary Sarah Ruth Wilkin |
Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 26(3), pp. 1650012:1-1650012:14, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Geffroy, Jérôme Leroux, Grégoire Sutre |
Occam's Razor Applied to the Petri Net Coverability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.05956, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
23 | Tomohiko Takagi, Keisuke Noda |
Partially developed coverability graphs for modeling test case execution histories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIS ![In: 15th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2016, Okayama, Japan, June 26-29, 2016, pp. 1-2, 2016, IEEE Computer Society, 978-1-5090-0806-3. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Ranko Lazic 0001, Sylvain Schmitz |
The Complexity of Coverability in ν-Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016, pp. 467-476, 2016, ACM, 978-1-4503-4391-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Piotr Hofman, Slawomir Lasota 0001, Ranko Lazic 0001, Jérôme Leroux, Sylvain Schmitz, Patrick Totzke |
Coverability Trees for Petri Nets with Unordered Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computation Structures - 19th International Conference, FOSSACS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 445-461, 2016, Springer, 978-3-662-49629-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
Approaching the Coverability Problem Continuously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, pp. 480-496, 2016, Springer, 978-3-662-49673-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Thomas Geffroy, Jérôme Leroux, Grégoire Sutre |
Occam's Razor Applied to the Petri Net Coverability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, Proceedings, pp. 77-89, 2016, Springer, 978-3-319-45993-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Matteo Camilli, Carlo Bellettini, Lorenzo Capra, Mattia Monga |
Coverability Analysis of Time Basic Petri Nets with Non-Urgent Behavior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SYNASC ![In: 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2016, Timisoara, Romania, September 24-27, 2016, pp. 165-172, 2016, IEEE, 978-1-5090-5707-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
23 | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
Approaching the Coverability Problem Continuously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1510.05724, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Jérôme Leroux, Grégoire Sutre, Patrick Totzke |
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1503.04018, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
23 | Jérôme Leroux, Grégoire Sutre, Patrick Totzke |
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, pp. 324-336, 2015, Springer, 978-3-662-47665-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Guilhem Gamard, Gwénaël Richomme |
Coverability in Two Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, pp. 402-413, 2015, Springer, 978-3-319-15578-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Ranko Lazic 0001, Sylvain Schmitz |
The Ideal View on Rackoff's Coverability Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings, pp. 76-88, 2015, Springer, 978-3-319-24536-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Jan Stückrath |
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGT ![In: Graph Transformation - 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L'Aquila, Italy, July 21-23, 2015. Proceedings, pp. 266-274, 2015, Springer, 978-3-319-21144-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
23 | Antti Valmari, Henri Hansen |
Old and New Algorithms for Minimal Coverability Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 131(1), pp. 1-25, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Leslaw Gniewek |
Coverability Graph of Fuzzy Interpreted Petri Net. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Syst. ![In: IEEE Trans. Syst. Man Cybern. Syst. 44(9), pp. 1272-1277, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Tobias Heindel, Vincent Danos, Ricardo Honorato-Zimmer, Sandro Stucki |
Mean Quantitative Coverability in Stochastic Graph Transformation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. ![In: Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 68, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Matteo Camilli |
Constructing Coverability Graphs for Time Basic Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1409.6253, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
23 | Tim Strazny |
An algorithmic framework for checking coverability in well-structured transition systems. (PDF / PS) ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
23 | Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp J. Meyer, Filip Niksic |
An SMT-Based Approach to Coverability Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pp. 603-619, 2014, Springer, 978-3-319-08866-2. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Vinicius F. Carida, Orides Morandin, Paulo R. Cerioni, Carlos C. M. Tuma |
Prediction Model Using Coverability Tree from a Modeling in Petri Nets Applied in AGVs Dispatching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BRACIS ![In: 2014 Brazilian Conference on Intelligent Systems, BRACIS 2014, Sao Paulo, Brazil, October 18-22, 2014, pp. 140-145, 2014, IEEE Computer Society, 978-1-4799-5618-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
23 | Nicolas Gastineau |
Partitionnement, recouvrement et colorabilité dans les graphes. (Partitionability, coverability and colorability in graphs). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
23 | Pierre-Alain Reynier, Frédéric Servais |
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 122(1-2), pp. 1-30, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | M. Praveen |
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 713-753, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Giorgio Delzanno, Fernando Rosa-Velardo |
On the coverability and reachability languages of monotonic extensions of Petri nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 467, pp. 12-29, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac |
Incremental, Inductive Coverability ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1301.7321, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
23 | Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac |
Incremental, Inductive Coverability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, pp. 158-173, 2013, Springer, 978-3-642-39798-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | Artturi Piipponen, Antti Valmari |
Constructing Minimal Coverability Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems - 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings, pp. 183-195, 2013, Springer, 978-3-642-41035-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
23 | A. V. Klimov |
A simple algorithm for solving the coverability problem for monotonic counter systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Control. Comput. Sci. ![In: Autom. Control. Comput. Sci. 46(7), pp. 364-370, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Jetty Kleijn, Maciej Koutny |
Step coverability algorithms for communicating systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. Comput. Program. ![In: Sci. Comput. Program. 77(7-8), pp. 955-967, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Kai-Hui Chang, Chia-Wei Chang, Jie-Hong Roland Jiang, Chien-Nan Jimmy Liu |
Improving design verifiability by early RTL coverability analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMOCODE ![In: Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMCODE 2012, Arlington, VA, USA, July 16-17, 2012, pp. 25-32, 2012, IEEE, 978-1-4673-1314-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Antti Valmari, Henri Hansen |
Old and New Algorithms for Minimal Coverability Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Application and Theory of Petri Nets - 33rd International Conference, PETRI NETS 2012, Hamburg, Germany, June 25-29, 2012. Proceedings, pp. 208-227, 2012, Springer, 978-3-642-31130-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Tim Strazny, Roland Meyer 0001 |
An Algorithmic Framework for Coverability in Well-Structured Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSD ![In: 12th International Conference on Application of Concurrency to System Design, ACSD 2012, Hamburg, Germany, June 27-29, 2012, pp. 173-182, 2012, IEEE Computer Society, 978-0-7695-4709-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Tomohiko Takagi, Zengo Furukawa |
Test Case Generation Technique Based on Extended Coverability Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2012, Kyoto, Japan, August 8-10, 2012, pp. 301-306, 2012, IEEE Computer Society, 978-1-4673-2120-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Alexander Kaiser 0001, Daniel Kroening, Thomas Wahl |
Efficient Coverability Analysis by Proof Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings, pp. 500-515, 2012, Springer, 978-3-642-32939-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Nathalie Bertrand 0001, Giorgio Delzanno, Barbara König 0001, Arnaud Sangnier, Jan Stückrath |
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , RTA 2012, May 28 - June 2, 2012, Nagoya, Japan, pp. 101-116, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-38-5. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Fernando Rosa-Velardo, María Martos-Salgado, David de Frutos-Escrig |
Accelerations for the Coverability Set of Petri Nets with Names. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 113(3-4), pp. 313-341, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1104.0617, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
23 | Andrei V. Klimov |
Solving Coverability Problem for Monotonic Counter Systems by Supercompilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics - 8th International Andrei Ershov Memorial Conference, PSI 2011, Novosibirsk, Russia, June 27-July 1, 2011, Revised Selected Papers, pp. 193-209, 2011, Springer, 978-3-642-29708-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Pierre-Alain Reynier, Frédéric Servais |
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Petri Nets ![In: Applications and Theory of Petri Nets - 32nd International Conference, PETRI NETS 2011, Newcastle, UK, June 20-24, 2011. Proceedings, pp. 69-88, 2011, Springer, 978-3-642-21833-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
23 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, LICS 2011, June 21-24, 2011, Toronto, Ontario, Canada, pp. 399-408, 2011, IEEE Computer Society, 978-0-7695-4412-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|