default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-François Raskin
- > Home > Persons > Jean-François Raskin
Publications
- 2010
[j23]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set of Petri Nets. Int. J. Found. Comput. Sci. 21(2): 135-165 (2010)- 2009
- [j20]Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Le problème de couverture pour les réseaux de Petri. Résultats classiques et développements récents. Tech. Sci. Informatiques 28(9): 1107-1142 (2009) - 2008
- [j18]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. Fundam. Informaticae 88(3): 275-305 (2008) - 2007
- [j15]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Well-structured languages. Acta Informatica 44(3-4): 249-288 (2007) - [c39]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets. ICATPN 2007: 124-143 - [c38]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the Efficient Computation of the Minimal Coverability Set for Petri Nets. ATVA 2007: 98-113 - 2006
- [j10]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72(1): 180-203 (2006) - [j9]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language expressive power of extended Petri nets. Theor. Comput. Sci. 356(3): 374-386 (2006) - [c29]Pierre Ganty, Jean-François Raskin, Laurent Van Begin:
A Complete Abstract Interpretation Framework for Coverability Properties of WSTS. VMCAI 2006: 49-64 - 2005
- [c28]Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
Expand, Enlarge and Check... Made Efficient. CAV 2005: 394-407 - 2004
- [j5]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Covering sharing trees: a compact data structure for parameterized verification. Int. J. Softw. Tools Technol. Transf. 5(2-3): 268-297 (2004) - [c21]Gilles Geeraerts, Jean-François Raskin
, Laurent Van Begin:
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS. FSTTCS 2004: 287-298 - [c19]Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
Games for Counting Abstractions. AVoCS 2004: 69-85 - [c18]Alain Finkel, Gilles Geeraerts, Jean-François Raskin, Laurent Van Begin:
On the omega-language Expressive Power of Extended Petri Nets. EXPRESS 2004: 87-101 - 2003
- [c15]Jean-François Raskin, Laurent Van Begin:
Petri Nets with Non-blocking Arcs are Difficult to Analyze. INFINITY 2003: 35-55 - 2002
- [c12]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Towards the Automated Verification of Multithreaded Java Programs. TACAS 2002: 173-187 - [c11]Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. INFINITY 2002: 85-106 - 2001
- [c10]Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin:
Attacking Symbolic State Explosion. CAV 2001: 298-310
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
