| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 129 | Alain Finkel |
The Minimal Coverability Graph for Petri Nets.  |
Applications and Theory of Petri Nets  |
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. |
FME |
2002 |
DBLP DOI BibTeX RDF |
|
| 100 | Parosh Aziz Abdulla, S. Purushothaman Iyer, Aletta Nylén |
SAT-Solving the Coverability Problem for Petri Nets. |
Formal Methods Syst. Des. |
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. |
ATVA |
2007 |
DBLP DOI BibTeX RDF |
|
| 89 | Gil Ratsaby, Shmuel Ur, Yaron Wolfsthal |
Coverability Analysis Using Symbolic Model Checking. |
CHARME |
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. |
Petri Nets |
2009 |
DBLP DOI BibTeX RDF |
|
| 78 | JinGang Xie, QingPing Tan, GuoRong Cao |
Modeling and Analyzing Web Service Behavior with Regular Flow Nets. |
WISM |
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. |
FoSSaCS |
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. |
FSTTCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 56 | Michael Leuschel, Helko Lehmann |
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction. |
Computational Logic |
2000 |
DBLP DOI BibTeX RDF |
|
| 49 | Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín Alonso |
Replicated Ubiquitous Nets. |
ICCSA (4) |
2006 |
DBLP DOI BibTeX RDF |
|
| 45 | Guilhem Gamard, Gwénaël Richomme |
Coverability and multi-scale coverability on infinite pictures. |
J. Comput. Syst. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
| 45 | Guilhem Gamard, Gwénaël Richomme |
Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
| 45 | Alfred Bröckers, Volker Gruhn |
Computer-Aided Verification of Software Process Model Properties |
CAiSE |
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. |
VMCAI |
2006 |
DBLP DOI BibTeX RDF |
|
| 33 | Giorgio Delzanno, Laurent Van Begin |
A Biologically Inspired Model with Fusion and Clonation of Membranes. |
UC |
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. |
ICATPN |
2007 |
DBLP DOI BibTeX RDF |
|
| 33 | Fernando Rosa-Velardo |
Petri Nets for the Verification of Ubiquitous Systems with Transient Secure Association. |
UIC |
2007 |
DBLP DOI BibTeX RDF |
|
| 33 | Rohit Chadha, Mahesh Viswanathan 0001 |
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. |
CONCUR |
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. |
IEEE Trans. Parallel Distributed Syst. |
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. |
Australian Conference on Artificial Intelligence |
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. |
FTRTFT |
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. |
CoRR |
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. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in 2-VASS with One Unary Counter is in NP. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | A. R. Balasubramanian |
Parameterized Verification of Coverability in Infinite State Broadcast Networks. |
CoRR |
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. |
ICALP |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki |
Coverability in 2-VASS with One Unary Counter is in NP. |
FoSSaCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Endre Erós, Kristofer Bengtsson, Knut Åkesson |
Structural Coverability for Intelligent Automation Systems. |
CASE |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | Chris Köcher, Georg Zetzsche |
Regular Separators for VASS Coverability Languages. |
FSTTCS |
2023 |
DBLP DOI BibTeX RDF |
|
| 23 | |
Model Generation with Provable Coverability for Offline Reinforcement Learning. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | A. R. Balasubramanian |
Complexity of Coverability in Depth-Bounded Processes. |
CONCUR |
2022 |
DBLP DOI BibTeX RDF |
|
| 23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability, Termination, and Finiteness in Recursive Petri Nets. |
Fundam. Informaticae |
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. |
Inf. Process. Lett. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Jung-Heum Park |
A sufficient condition for the unpaired k-disjoint path coverability of interval graphs. |
J. Supercomput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability, Termination, and Finiteness in Recursive Petri Nets. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
| 23 | Ranko Lazic 0001, Sylvain Schmitz |
The ideal view on Rackoff's coverability technique. |
Inf. Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | A. R. Balasubramanian |
Parameterized verification of coverability in infinite state broadcast networks. |
Inf. Comput. |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Jiawen Kang, Yunjun Bai, Li Jiao |
Abstraction-Based Incremental Inductive Coverability for Petri Nets. |
Petri Nets |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | A. R. Balasubramanian |
Complexity of Coverability in Bounded Path Broadcast Networks. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Minimal Coverability Tree Construction Made Complete and Efficient. |
FoSSaCS |
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. |
CONCUR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 23 | Sylvain Schmitz, Georg Zetzsche |
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
| 23 | Mirko Petrusevski, Riste Skrekovski |
Coverability of graph by three odd subgraphs. |
J. Graph Theory |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Alain Finkel, Serge Haddad, Igor Khmelnitsky |
Coverability and Termination in Recursive Petri Nets. |
Petri Nets |
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. |
Petri Nets |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Sylvain Schmitz, Georg Zetzsche |
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. |
RP |
2019 |
DBLP DOI BibTeX RDF |
|
| 23 | Pierre-Alain Reynier, Frédéric Servais |
On the Computation of the Minimal Coverability Set of Petri Nets. |
RP |
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. |
Theor. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | Krishnendu Chatterjee, Nir Piterman |
Coverability: Realizability Lower Bounds. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
| 23 | A. R. Balasubramanian |
Parameterized Verification of Coverability in Well-Structured Broadcast Networks. |
GandALF |
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. |
Petri Nets |
2018 |
DBLP DOI BibTeX RDF |
|
| 23 | Dimitri Watel, Marc-Antoine Weisser, Dominique Barth |
Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets. |
Petri Nets |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Thomas Geffroy, Jérôme Leroux, Grégoire Sutre |
Backward coverability with pruning for lossy channel systems. |
SPIN |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Chunmiao Li, Xiaojuan Cai |
Hardness Results for Coverability Problem of Well-Structured Pushdown Systems. |
LATA |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Lenka Turonová, Lukás Holík |
Towards Smaller Invariants for Proving Coverability. |
EUROCAST (2) |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Nicolas David 0002, Claude Jard, Didier Lime, Olivier H. Roux |
Coverability Synthesis in Parametric Petri Nets. |
CONCUR |
2017 |
DBLP DOI BibTeX RDF |
|
| 23 | Artturi Piipponen, Antti Valmari |
Constructing Minimal Coverability Sets. |
Fundam. Informaticae |
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. |
Parallel Process. Lett. |
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. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
| 23 | Tomohiko Takagi, Keisuke Noda |
Partially developed coverability graphs for modeling test case execution histories. |
ICIS |
2016 |
DBLP DOI BibTeX RDF |
|
| 23 | Ranko Lazic 0001, Sylvain Schmitz |
The Complexity of Coverability in ν-Petri Nets. |
LICS |
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. |
FoSSaCS |
2016 |
DBLP DOI BibTeX RDF |
|
| 23 | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
Approaching the Coverability Problem Continuously. |
TACAS |
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. |
RP |
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. |
SYNASC |
2016 |
DBLP DOI BibTeX RDF |
|
| 23 | Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad |
Approaching the Coverability Problem Continuously. |
CoRR |
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. |
CoRR |
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. |
ICALP (2) |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Guilhem Gamard, Gwénaël Richomme |
Coverability in Two Dimensions. |
LATA |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Ranko Lazic 0001, Sylvain Schmitz |
The Ideal View on Rackoff's Coverability Technique. |
RP |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Jan Stückrath |
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems. |
ICGT |
2015 |
DBLP DOI BibTeX RDF |
|
| 23 | Antti Valmari, Henri Hansen |
Old and New Algorithms for Minimal Coverability Sets. |
Fundam. Informaticae |
2014 |
DBLP DOI BibTeX RDF |
|
| 23 | Leslaw Gniewek |
Coverability Graph of Fuzzy Interpreted Petri Net. |
IEEE Trans. Syst. Man Cybern. Syst. |
2014 |
DBLP DOI BibTeX RDF |
|
| 23 | Tobias Heindel, Vincent Danos, Ricardo Honorato-Zimmer, Sandro Stucki |
Mean Quantitative Coverability in Stochastic Graph Transformation Systems. |
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. |
2014 |
DBLP DOI BibTeX RDF |
|
| 23 | Matteo Camilli |
Constructing Coverability Graphs for Time Basic Petri Nets. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
| 23 | Tim Strazny |
An algorithmic framework for checking coverability in well-structured transition systems. (PDF / PS) |
|
2014 |
RDF |
|
| 23 | Javier Esparza, Ruslán Ledesma-Garza, Rupak Majumdar, Philipp J. Meyer, Filip Niksic |
An SMT-Based Approach to Coverability Analysis. |
CAV |
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. |
BRACIS |
2014 |
DBLP DOI BibTeX RDF |
|
| 23 | Nicolas Gastineau |
Partitionnement, recouvrement et colorabilité dans les graphes. (Partitionability, coverability and colorability in graphs). |
|
2014 |
RDF |
|
| 23 | Pierre-Alain Reynier, Frédéric Servais |
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning. |
Fundam. Informaticae |
2013 |
DBLP DOI BibTeX RDF |
|
| 23 | M. Praveen |
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. |
Algorithmica |
2013 |
DBLP DOI BibTeX RDF |
|
| 23 | Giorgio Delzanno, Fernando Rosa-Velardo |
On the coverability and reachability languages of monotonic extensions of Petri nets. |
Theor. Comput. Sci. |
2013 |
DBLP DOI BibTeX RDF |
|
| 23 | Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac |
Incremental, Inductive Coverability |
CoRR |
2013 |
DBLP BibTeX RDF |
|
| 23 | Johannes Kloos, Rupak Majumdar, Filip Niksic, Ruzica Piskac |
Incremental, Inductive Coverability. |
CAV |
2013 |
DBLP DOI BibTeX RDF |
|
| 23 | Artturi Piipponen, Antti Valmari |
Constructing Minimal Coverability Sets. |
RP |
2013 |
DBLP DOI BibTeX RDF |
|
| 23 | A. V. Klimov |
A simple algorithm for solving the coverability problem for monotonic counter systems. |
Autom. Control. Comput. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 23 | Jetty Kleijn, Maciej Koutny |
Step coverability algorithms for communicating systems. |
Sci. Comput. Program. |
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. |
MEMOCODE |
2012 |
DBLP DOI BibTeX RDF |
|
| 23 | Antti Valmari, Henri Hansen |
Old and New Algorithms for Minimal Coverability Sets. |
Petri Nets |
2012 |
DBLP DOI BibTeX RDF |
|
| 23 | Tim Strazny, Roland Meyer 0001 |
An Algorithmic Framework for Coverability in Well-Structured Systems. |
ACSD |
2012 |
DBLP DOI BibTeX RDF |
|
| 23 | Tomohiko Takagi, Zengo Furukawa |
Test Case Generation Technique Based on Extended Coverability Trees. |
SNPD |
2012 |
DBLP DOI BibTeX RDF |
|
| 23 | Alexander Kaiser 0001, Daniel Kroening, Thomas Wahl |
Efficient Coverability Analysis by Proof Minimization. |
CONCUR |
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. |
RTA |
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. |
Fundam. Informaticae |
2011 |
DBLP DOI BibTeX RDF |
|
| 23 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 23 | Andrei V. Klimov |
Solving Coverability Problem for Monotonic Counter Systems by Supercompilation. |
Ershov Memorial Conference |
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. |
Petri Nets |
2011 |
DBLP DOI BibTeX RDF |
|
| 23 | Parosh Aziz Abdulla, Richard Mayr |
Computing Optimal Coverability Costs in Priced Timed Petri Nets. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license