Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
coverability
Description:
A reachability property of transition systems, such as Petri nets, describing whether a state can reach a marking that covers a target.
Primary topic:
Petri Nets in System Modeling (50%)
Related topics:
Petri Nets in System Modeling (50%),
Formal Methods in Verification (18%),
semigroups and automata theory (8%)
OpenAlex ID:
keywords/coverability
Reset nets between decidability and undecidability
1998
·
C. Dufourd
, A. Finkel
, et al.
·
Lecture notes in computer science
·
317
(Meta) Kernelization
2016
·
Hans L. Bodlaender
, Fedor V. Fomin
, et al.
·
Journal of the ACM
·
204
Some decision problems related to the reachability problem for Petri nets
1976
·
Toshiro Araki
, Tadao Kasami
·
Theoretical Computer Science
·
129
Nets with Tokens Which Carry Data
2007
·
Ranko Lazić
, Tom Newcomb
, et al.
·
Springer eBooks
·
123
Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
2010
·
Philippe Schnoebelen
·
Lecture notes in computer science
·
121
Time, Petri nets, and robotics
1991
·
P. Freedman
·
IEEE Transactions on Robotics and Automation
·
112
Decidability and complexity of Petri nets with unordered data
2011
·
Fernando Rosa-Velardo
, David de Frutos-Escrig
·
Theoretical Computer Science
·
98
PDF
Reduction and covering of infinite reachability trees
1990
·
Alain Finkel
·
Information and Computation
·
97
PDF
Decidability of Properties of Timed-Arc Petri Nets
2000
·
David de Frutos Escrig
, Valentín Valero Ruiz
, et al.
·
Lecture notes in computer science
·
79
PDF
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
2015
·
Michael Blondin
, Alain Finkel
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
71
PDF
The Role of Coverage in Online Reinforcement Learning
2022
·
Xie, Tengyang
, Foster, Dylan J.
, et al.
·
arXiv (Cornell University)
·
68
PDF
A well-structured framework for analysing petri net extensions
2004
·
Alain Finkel
, Pierre McKenzie
, et al.
·
Information and Computation
·
68
Complexity Analysis of Continuous Petri Nets
2015
·
Estíbaliz Fraca
, Serge Haddad
·
Fundamenta Informaticae
·
67
A proof of the Rank Theorem for extended free choice nets
1992
·
Jörg Desel
·
Lecture notes in computer science
·
52
Polynomial automata: Zeroness and applications
2017
·
Michael Benedikt
, Timothy Duff
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
48
PDF
On the Efficient Computation of the Minimal Coverability Set of Petri Nets
2007
·
Gilles Geeraerts
, Jean-François Raskin
, et al.
·
International Journal of Foundations of Computer Science
·
47
An O(n1.5) algorithm to decide boundedness for conflict-free vector replacement systems
1987
·
Rodney R. Howell
, Louis E. Rosier
, et al.
·
Information Processing Letters
·
46
Incremental, Inductive Coverability
2013
·
Johannes Kloos
, Rupak Majumdar
, et al.
·
Lecture notes in computer science
·
45
PDF
The Logical View on Continuous Petri Nets
2017
·
Michael Blondin
, Alain Finkel
, et al.
·
ACM Transactions on Computational Logic
·
44
PDF
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
2016
·
Sławomir Lasota
·
Lecture notes in computer science
·
43
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS
2005
·
Pierre Ganty
, Jean-François Raskin
, et al.
·
Lecture notes in computer science
·
42
Structure and behavior preservation by Petri-net-based refinements in system design
2004
·
Hejiao Huang
, To-yat Cheung
, et al.
·
Theoretical Computer Science
·
38
PDF
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
2007
·
Parosh Abdulla
, Pritha Mahata
, et al.
·
Logical Methods in Computer Science
·
37
PDF
Reachability in Two-dimensional Vector Addition Systems With States Is Pspace-complete
·
Michael Blondin
, Alain Finkel
, et al.
·
36
A classification of the expressive power of well-structured transition systems
2010
·
Parosh Aziz Abdulla
, Giorgio Delzanno
, et al.
·
Information and Computation
·
34
PDF
Show more works
View as search
Works count:
250
Citation count:
3,382
Year
Topic
Type