Forward analysis and model checking for trace bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]....
Saved in:
Published in | Theoretical computer science Vol. 637; pp. 1 - 29 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
18.07.2016
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]. Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.
•The trace boundedness is decidable for complete deterministic WSTS.•The downward-closure of the reachability set is computable for trace bounded complete deterministic WSTS.•Action-based LTL model-checking is decidable for trace bounded complete deterministic WSTS.•State-based LTL model-checking is undecidable for trace bounded complete deterministic WSTS. |
---|---|
AbstractList | We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]. Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.
•The trace boundedness is decidable for complete deterministic WSTS.•The downward-closure of the reachability set is computable for trace bounded complete deterministic WSTS.•Action-based LTL model-checking is decidable for trace bounded complete deterministic WSTS.•State-based LTL model-checking is undecidable for trace bounded complete deterministic WSTS. We investigate a subclass of well-structured transition systems (WSTS), the trace bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide allω-regular properties on the set of infinite traces of the system. We investigate a subclass of well-structured transition systems (WSTS), the trace bounded-in the sense of Ginsburg and Spanier (1964), [1]-complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]. Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all omega -regular properties on the set of infinite traces of the system. |
Author | Chambart, Pierre Finkel, Alain Schmitz, Sylvain |
Author_xml | – sequence: 1 givenname: Pierre surname: Chambart fullname: Chambart, Pierre organization: OCamlPro, France – sequence: 2 givenname: Alain orcidid: 0000-0003-2482-6141 surname: Finkel fullname: Finkel, Alain email: Alain.Finkel@lsv.ens-cachan.fr organization: LSV, ENS Cachan & CNRS & INRIA, Université Paris-Saclay, France – sequence: 3 givenname: Sylvain surname: Schmitz fullname: Schmitz, Sylvain organization: LSV, ENS Cachan & CNRS & INRIA, Université Paris-Saclay, France |
BackLink | https://hal.science/hal-01329871$$DView record in HAL |
BookMark | eNp9kM1OAjEUhRuDiYg-gLtZ6mLGttOZtroiRMSExAUYl02nP1IcptgOGN7eEoxL7-ae3JxzkvtdgkHnOwPADYIFgqi-Xxe9igVOsoCkgBiegSFilOcYczIAQ1hCkpecVhfgMsY1TFPReggepj58y6Az2cn2EF1MQmcbr02bqZVRn677yKwPWR-kMlnjd502OntfLBdX4NzKNprr3z0Cb9On5WSWz1-fXybjea4I5n3OqJKVtIwYJsuKMsm1pgQjS1WJG2kRJlBjqxmHCnHEGqmY1Q2uVYMkrUk5Anen3pVsxTa4jQwH4aUTs_FcHG8QlZgzivYoeW9P3m3wXzsTe7FxUZm2lZ3xuygQwxWhdV3jZEUnqwo-xmDsXzeC4shUrEViKo5MBSQiMU2Zx1PGpH_3zgQRlTOdMtoFo3qhvfsn_QMcnX8k |
Cites_doi | 10.1016/j.ic.2015.03.007 10.1016/S0304-3975(02)00646-1 10.1007/s00236-007-0050-3 10.1016/0304-3975(78)90036-1 10.1016/S0304-3975(97)00219-3 10.1006/inco.1995.1010 10.1016/j.jcss.2005.09.001 10.1007/BF01967649 10.1109/TCOM.1980.1094685 10.1016/S0304-3975(99)00033-X 10.1051/ita:2003001 10.1023/B:FORM.0000033962.51898.1a 10.1006/inco.1996.0083 10.2168/LMCS-8(3:28)2012 10.1016/S0304-3975(00)00102-X 10.1023/A:1026228213080 10.1142/S0129054110007441 10.1007/s10009-008-0064-3 10.1016/S0022-0000(69)80011-5 10.1023/A:1008719024240 10.1145/2858784 10.3166/jancl.20.313-344 10.1006/inco.1999.2843 10.1007/s10703-011-0136-y 10.1007/s10703-012-0168-y 10.1090/S0002-9939-1969-0239891-9 10.1145/2160910.2160915 10.1142/S0129054111008428 10.1145/322374.322380 10.1007/s002360050074 10.1006/inco.1996.0053 10.1016/j.ic.2004.01.005 10.1016/0890-5401(90)90009-7 |
ContentType | Journal Article |
Copyright | 2016 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License |
Copyright_xml | – notice: 2016 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License |
DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 1XC |
DOI | 10.1016/j.tcs.2016.04.020 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
DatabaseTitleList | Computer and Information Systems Abstracts |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Mathematics Computer Science |
EISSN | 1879-2294 |
EndPage | 29 |
ExternalDocumentID | oai_HAL_hal_01329871v1 10_1016_j_tcs_2016_04_020 S0304397516300597 |
GrantInformation_xml | – fundername: ANR grantid: ANR-06-SETIN-001; ANR-05-RNTL-02; ANR-11-BS02-001 funderid: http://dx.doi.org/10.13039/501100001665 |
GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 0SF 29Q AAEDT AAQXK AAXKI AAYXX ABEFU ABFNM ABTAH ABXDB ACNNM ADMUD ADVLN AFJKZ AGHFR AKRWK ASPBG AVWKF AZFZN CITATION FGOYB G-2 G8K HZ~ NCXOZ R2- SEW TAE WUQ XJT ZY4 7SC 8FD JQ2 L7M L~C L~D 1XC |
ID | FETCH-LOGICAL-c429t-87ca5af84e8a3578a9dd7421f7c32baf1240d2fd890c1918bac8fdb26cb1a7643 |
IEDL.DBID | AIKHN |
ISSN | 0304-3975 |
IngestDate | Tue Oct 15 16:04:16 EDT 2024 Fri Aug 16 22:19:47 EDT 2024 Thu Sep 26 19:02:13 EDT 2024 Fri Feb 23 02:30:25 EST 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Keywords | Model checking Complete WSTS Flattable system Bounded language Acceleration bounded language acceleration model-checking complete WSTS flattable system |
Language | English |
License | Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c429t-87ca5af84e8a3578a9dd7421f7c32baf1240d2fd890c1918bac8fdb26cb1a7643 |
Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ORCID | 0000-0003-2482-6141 0000-0003-0702-3232 0000-0002-4101-4308 |
OpenAccessLink | https://doi.org/10.1016/j.tcs.2016.04.020 |
PQID | 1825476662 |
PQPubID | 23500 |
PageCount | 29 |
ParticipantIDs | hal_primary_oai_HAL_hal_01329871v1 proquest_miscellaneous_1825476662 crossref_primary_10_1016_j_tcs_2016_04_020 elsevier_sciencedirect_doi_10_1016_j_tcs_2016_04_020 |
PublicationCentury | 2000 |
PublicationDate | 2016-07-18 |
PublicationDateYYYYMMDD | 2016-07-18 |
PublicationDate_xml | – month: 07 year: 2016 text: 2016-07-18 day: 18 |
PublicationDecade | 2010 |
PublicationTitle | Theoretical computer science |
PublicationYear | 2016 |
Publisher | Elsevier B.V Elsevier |
Publisher_xml | – name: Elsevier B.V – name: Elsevier |
References | Peled, Wilke, Wolper (br0600) 1998; 195 Blondin, Finkel, Göller, Haase, McKenzie (br0130) 2015 Bochmann, Sunshine (br0620) 1980; 28 Karp, Miller (br0160) 1969; 3 Pachl (br0640) 1982 Finkel (br0170) 1990; 89 Diekert, Gastin, Petit (br0590) 1995; 116 Finkel, Choquet (br0650) 1987 Abdulla, Jonsson (br0100) 1996; 127 Schnoebelen (br0370) 2010; vol. 6227 Löb, Wainer (br0430) 1970; 13 Cortier (br0290) 2002; 36 Habermehl, Mayr (br0510) 2000 Atig, Habermehl (br0410) 2011; 22 Esparza, Finkel, Mayr (br0390) 1999 Demri, Kumar Dhar, Sangnier (br0190) 2015; 242 Figueira, Figueira, Schmitz, Schnoebelen (br0520) 2011 Gastin, Petit (br0610) 1995 Bertrand, Schnoebelen (br0570) 2013; 43 Bouajjani, Habermehl (br0670) 1999; 221 Goubault-Larrecq (br0580) 2007 Ganty, Majumdar, Monmege (br0690) 2012; 40 . Annichini, Bouajjani, Sighireanu (br0050) 2001; vol. 2102 Geeraerts, Raskin, Van Begin (br0150) 2006; 72 Brand, Zafiropulo (br0630) 1983; 30 V. Kahlon, Tractable dataflow analysis for concurrent programs via bounded languages, Patent Application Publication US 2009/0193417 A1, 2009. Leroux, Sutre (br0120) 2005; vol. 3707 Abdulla, Collomb-Annichini, Bouajjani, Jonsson (br0270) 2004; 25 Dufourd, Finkel, Schnoebelen (br0400) 1998; vol. 1443 Finkel, Schnoebelen (br0330) 2001; 256 Esparza (br0480) 1998; vol. 1491 Finkel, Leroux (br0380) 2002; vol. 2556 Esparza (br0280) 1997; 34 Ganty, Iosif (br0200) 2015; vol. 9210 Comon, Cortier (br0560) 2000; vol. 1862 Demri, Finkel, Goranko, van Drimmelen (br0180) 2011; 20 Abdulla, Čerāns, Jonsson, Tsay (br0080) 2000; 160 Finkel, McKenzie, Picaronny (br0360) 2004; 195 Mayr (br0250) 2003; 297 Schmitz (br0420) 2016; 8 A. Finkel, J. Goubault-Larrecq, Forward analysis for WSTS, Part II: Complete WSTS, Logical Methods in Computer Science 8 (3) Henzinger, Kupferman, Qadeer (br0090) 2003; 23 Dufourd, Jančar, Schnoebelen (br0300) 1999; vol. 1644 Krohn, Kohler, Kaashoek (br0310) 2007 Geeraerts, Raskin, Begin (br0340) 2007; 44 Rackoff (br0470) 1978; 6 Schnoebelen (br0450) 2010; vol. 6281 Abdulla, Jonsson (br0240) 1996; 130 Finkel, Goubault-Larrecq (br0140) 2009; vol. 3 Schmitz, Schnoebelen (br0530) 2011; vol. 6756 Lipton (br0440) 1976 Jantzen (br0490) 1987; vol. 254 Blockelet, Schmitz (br0230) 2011; vol. 6907 Cardoza, Lipton, Meyer (br0460) 1976 Ginsburg, Spanier (br0010) 1964; 113 Gawrychowski, Krieger, Rampersad, Shallit (br0500) 2010; 21 Minsky (br0350) 1967 Lash (br0060) 2001 Bardin, Finkel, Leroux, Schnoebelen (br0040) 2005; vol. 3707 Emerson, Namjoshi (br0260) 1998 Siromoney (br0210) 1969; 21 Vardi, Wolper (br0540) 1986 Boigelot, Wolper (br0030) 1994; vol. 818 Ganty, Majumdar (br0320) 2012; 34 Boigelot, Godefroid (br0660) 1999; 14 Leroux, Sutre (br0110) 2004; vol. 3170 Chambart, Schnoebelen (br0220) 2008 Bardin, Finkel, Leroux, Petrucci (br0070) 2008; 10 Safra (br0550) 1988 Figueira (10.1016/j.tcs.2016.04.020_br0520) 2011 Finkel (10.1016/j.tcs.2016.04.020_br0380) 2002; vol. 2556 Esparza (10.1016/j.tcs.2016.04.020_br0280) 1997; 34 10.1016/j.tcs.2016.04.020_br0020 Blockelet (10.1016/j.tcs.2016.04.020_br0230) 2011; vol. 6907 Karp (10.1016/j.tcs.2016.04.020_br0160) 1969; 3 Finkel (10.1016/j.tcs.2016.04.020_br0650) 1987 Peled (10.1016/j.tcs.2016.04.020_br0600) 1998; 195 Bardin (10.1016/j.tcs.2016.04.020_br0040) 2005; vol. 3707 Abdulla (10.1016/j.tcs.2016.04.020_br0100) 1996; 127 Demri (10.1016/j.tcs.2016.04.020_br0180) 2011; 20 Goubault-Larrecq (10.1016/j.tcs.2016.04.020_br0580) 2007 Henzinger (10.1016/j.tcs.2016.04.020_br0090) 2003; 23 Chambart (10.1016/j.tcs.2016.04.020_br0220) 2008 Leroux (10.1016/j.tcs.2016.04.020_br0120) 2005; vol. 3707 Emerson (10.1016/j.tcs.2016.04.020_br0260) 1998 Brand (10.1016/j.tcs.2016.04.020_br0630) 1983; 30 Dufourd (10.1016/j.tcs.2016.04.020_br0400) 1998; vol. 1443 Boigelot (10.1016/j.tcs.2016.04.020_br0660) 1999; 14 Finkel (10.1016/j.tcs.2016.04.020_br0170) 1990; 89 Esparza (10.1016/j.tcs.2016.04.020_br0390) 1999 Atig (10.1016/j.tcs.2016.04.020_br0410) 2011; 22 Schmitz (10.1016/j.tcs.2016.04.020_br0420) 2016; 8 Habermehl (10.1016/j.tcs.2016.04.020_br0510) Minsky (10.1016/j.tcs.2016.04.020_br0350) 1967 Annichini (10.1016/j.tcs.2016.04.020_br0050) 2001; vol. 2102 Dufourd (10.1016/j.tcs.2016.04.020_br0300) 1999; vol. 1644 Diekert (10.1016/j.tcs.2016.04.020_br0590) 1995; 116 Boigelot (10.1016/j.tcs.2016.04.020_br0030) 1994; vol. 818 Geeraerts (10.1016/j.tcs.2016.04.020_br0150) 2006; 72 Schnoebelen (10.1016/j.tcs.2016.04.020_br0370) 2010; vol. 6227 Abdulla (10.1016/j.tcs.2016.04.020_br0240) 1996; 130 Abdulla (10.1016/j.tcs.2016.04.020_br0270) 2004; 25 Siromoney (10.1016/j.tcs.2016.04.020_br0210) 1969; 21 Gastin (10.1016/j.tcs.2016.04.020_br0610) 1995 Esparza (10.1016/j.tcs.2016.04.020_br0480) 1998; vol. 1491 10.1016/j.tcs.2016.04.020_br0680 Mayr (10.1016/j.tcs.2016.04.020_br0250) 2003; 297 Schnoebelen (10.1016/j.tcs.2016.04.020_br0450) 2010; vol. 6281 Finkel (10.1016/j.tcs.2016.04.020_br0360) 2004; 195 Abdulla (10.1016/j.tcs.2016.04.020_br0080) 2000; 160 Löb (10.1016/j.tcs.2016.04.020_br0430) 1970; 13 Pachl (10.1016/j.tcs.2016.04.020_br0640) Lash (10.1016/j.tcs.2016.04.020_br0060) Gawrychowski (10.1016/j.tcs.2016.04.020_br0500) 2010; 21 Comon (10.1016/j.tcs.2016.04.020_br0560) 2000; vol. 1862 Lipton (10.1016/j.tcs.2016.04.020_br0440) 1976 Finkel (10.1016/j.tcs.2016.04.020_br0330) 2001; 256 Bardin (10.1016/j.tcs.2016.04.020_br0070) 2008; 10 Krohn (10.1016/j.tcs.2016.04.020_br0310) 2007 Cardoza (10.1016/j.tcs.2016.04.020_br0460) 1976 Ganty (10.1016/j.tcs.2016.04.020_br0690) 2012; 40 Cortier (10.1016/j.tcs.2016.04.020_br0290) 2002; 36 Finkel (10.1016/j.tcs.2016.04.020_br0140) 2009; vol. 3 Jantzen (10.1016/j.tcs.2016.04.020_br0490) 1987; vol. 254 Bertrand (10.1016/j.tcs.2016.04.020_br0570) 2013; 43 Blondin (10.1016/j.tcs.2016.04.020_br0130) 2015 Rackoff (10.1016/j.tcs.2016.04.020_br0470) 1978; 6 Ginsburg (10.1016/j.tcs.2016.04.020_br0010) 1964; 113 Vardi (10.1016/j.tcs.2016.04.020_br0540) 1986 Ganty (10.1016/j.tcs.2016.04.020_br0320) 2012; 34 Schmitz (10.1016/j.tcs.2016.04.020_br0530) 2011; vol. 6756 Leroux (10.1016/j.tcs.2016.04.020_br0110) 2004; vol. 3170 Demri (10.1016/j.tcs.2016.04.020_br0190) 2015; 242 Geeraerts (10.1016/j.tcs.2016.04.020_br0340) 2007; 44 Bochmann (10.1016/j.tcs.2016.04.020_br0620) 1980; 28 Bouajjani (10.1016/j.tcs.2016.04.020_br0670) 1999; 221 Safra (10.1016/j.tcs.2016.04.020_br0550) 1988 Ganty (10.1016/j.tcs.2016.04.020_br0200) 2015; vol. 9210 |
References_xml | – volume: 34 start-page: 85 year: 1997 end-page: 107 ident: br0280 article-title: Decidability of model checking for infinite-state concurrent systems publication-title: Acta Inform. contributor: fullname: Esparza – volume: 23 start-page: 303 year: 2003 end-page: 327 ident: br0090 article-title: From publication-title: Form. Methods Syst. Des. contributor: fullname: Qadeer – volume: vol. 3707 start-page: 489 year: 2005 end-page: 503 ident: br0120 article-title: Flat counter automata almost everywhere! publication-title: ATVA 2005 contributor: fullname: Sutre – volume: 28 start-page: 624 year: 1980 end-page: 631 ident: br0620 article-title: Formal methods in system design publication-title: IEEE Trans. Commun. contributor: fullname: Sunshine – volume: 113 start-page: 333 year: 1964 end-page: 368 ident: br0010 article-title: Bounded Algol-like languages publication-title: Trans. Amer. Math. Soc. contributor: fullname: Spanier – start-page: 205 year: 2008 end-page: 216 ident: br0220 article-title: The ordinal recursive complexity of lossy channel systems publication-title: LICS 2008 contributor: fullname: Schnoebelen – volume: 20 start-page: 313 year: 2011 end-page: 344 ident: br0180 article-title: Model-checking CTL publication-title: J. Appl. Non-Classical Logics contributor: fullname: van Drimmelen – volume: vol. 9210 start-page: 133 year: 2015 end-page: 145 ident: br0200 article-title: Interprocedural reachability for flat integer programs publication-title: FCT 2015 contributor: fullname: Iosif – volume: 36 start-page: 341 year: 2002 end-page: 358 ident: br0290 article-title: About the decision of reachability for register machines publication-title: RAIRO Theor. Inform. Appl. contributor: fullname: Cortier – volume: 40 start-page: 206 year: 2012 end-page: 231 ident: br0690 article-title: Bounded underapproximations publication-title: Form. Methods Syst. Des. contributor: fullname: Monmege – volume: 43 start-page: 233 year: 2013 end-page: 267 ident: br0570 article-title: Computable fixpoints in well-structured symbolic model checking publication-title: Form. Methods Syst. Des. contributor: fullname: Schnoebelen – volume: 25 start-page: 39 year: 2004 end-page: 65 ident: br0270 article-title: Using forward reachability analysis for verification of lossy channel systems publication-title: Form. Methods Syst. Des. contributor: fullname: Jonsson – volume: vol. 1644 start-page: 301 year: 1999 end-page: 310 ident: br0300 article-title: Boundedness of reset P/T nets publication-title: ICALP'99 contributor: fullname: Schnoebelen – volume: 21 start-page: 597 year: 2010 end-page: 618 ident: br0500 article-title: Finding the growth rate of a regular or context-free language in polynomial time publication-title: Internat. J. Found. Comput. Sci. contributor: fullname: Shallit – volume: vol. 2556 start-page: 145 year: 2002 end-page: 156 ident: br0380 article-title: How to compose Presburger-accelerations: applications to broadcast protocols publication-title: FSTTCS 2002 contributor: fullname: Leroux – year: 1982 ident: br0640 article-title: Reachability problems for communicating finite state machines contributor: fullname: Pachl – volume: 130 start-page: 71 year: 1996 end-page: 90 ident: br0240 article-title: Undecidable verification problems for programs with unreliable channels publication-title: Inform. and Comput. contributor: fullname: Jonsson – start-page: 352 year: 1999 end-page: 359 ident: br0390 article-title: On the verification of broadcast protocols publication-title: LICS'99 contributor: fullname: Mayr – start-page: 32 year: 2015 end-page: 43 ident: br0130 article-title: Reachability in two-dimensional vector addition systems with states is PSPACE-complete publication-title: LICS 2015 contributor: fullname: McKenzie – volume: 160 start-page: 109 year: 2000 end-page: 127 ident: br0080 article-title: Algorithmic analysis of programs with well quasi-ordered domains publication-title: Inform. and Comput. contributor: fullname: Tsay – start-page: 50 year: 1976 end-page: 54 ident: br0460 article-title: Exponential space complete problems for Petri nets and commutative semigroups publication-title: STOC'76 contributor: fullname: Meyer – volume: vol. 818 start-page: 55 year: 1994 end-page: 67 ident: br0030 article-title: Symbolic verification with periodic sets publication-title: CAV'94 contributor: fullname: Wolper – volume: vol. 1443 start-page: 103 year: 1998 end-page: 115 ident: br0400 article-title: Reset nets between decidability and undecidability publication-title: ICALP'98 contributor: fullname: Schnoebelen – start-page: 269 year: 2011 end-page: 278 ident: br0520 article-title: Ackermannian and primitive-recursive bounds with Dickson's Lemma publication-title: LICS 2011 contributor: fullname: Schnoebelen – volume: 10 start-page: 401 year: 2008 end-page: 424 ident: br0070 article-title: : acceleration from theory to practice publication-title: Int. J. Softw. Tools Technol. Transf. contributor: fullname: Petrucci – volume: 13 start-page: 39 year: 1970 end-page: 51 ident: br0430 article-title: Hierarchies of number theoretic functions, I publication-title: Arch. Math. Logic contributor: fullname: Wainer – volume: 242 start-page: 306 year: 2015 end-page: 339 ident: br0190 article-title: Taming past LTL and flat counter systems publication-title: Inform. and Comput. contributor: fullname: Sangnier – volume: 256 start-page: 63 year: 2001 end-page: 92 ident: br0330 article-title: Well-structured transition systems everywhere! publication-title: Theoret. Comput. Sci. contributor: fullname: Schnoebelen – year: 1967 ident: br0350 article-title: Computation: Finite and Infinite Machines contributor: fullname: Minsky – start-page: 332 year: 1986 end-page: 344 ident: br0540 article-title: An automata-theoretic approach to automatic program verification publication-title: LICS'86 contributor: fullname: Wolper – volume: vol. 2102 start-page: 368 year: 2001 end-page: 372 ident: br0050 article-title: : a tool for reachability analysis of complex systems publication-title: CAV 2001 contributor: fullname: Sighireanu – volume: 3 start-page: 147 year: 1969 end-page: 195 ident: br0160 article-title: Parallel program schemata publication-title: J. Comput. System Sci. contributor: fullname: Miller – volume: vol. 6907 start-page: 108 year: 2011 end-page: 119 ident: br0230 article-title: Model-checking coverability graphs of vector addition systems publication-title: MFCS 2011 contributor: fullname: Schmitz – volume: 14 start-page: 237 year: 1999 end-page: 255 ident: br0660 article-title: Symbolic verification of communication protocols with infinite state spaces using QDDs publication-title: Form. Methods Syst. Des. contributor: fullname: Godefroid – start-page: 70 year: 1998 end-page: 80 ident: br0260 article-title: On model checking for non-deterministic infinite-state systems publication-title: LICS'98 contributor: fullname: Namjoshi – volume: 89 start-page: 144 year: 1990 end-page: 179 ident: br0170 article-title: Reduction and covering of infinite reachability trees publication-title: Inform. and Comput. contributor: fullname: Finkel – volume: vol. 6756 start-page: 441 year: 2011 end-page: 452 ident: br0530 article-title: Multiply-recursive upper bounds with Higman's Lemma publication-title: ICALP 2011 contributor: fullname: Schnoebelen – start-page: 393 year: 1995 end-page: 486 ident: br0610 article-title: Infinite traces publication-title: The Book of Traces contributor: fullname: Petit – year: 2001 ident: br0060 article-title: The Liège automata-based symbolic handler contributor: fullname: Lash – volume: 195 start-page: 1 year: 2004 end-page: 29 ident: br0360 article-title: A well-structured framework for analysing Petri net extensions publication-title: Inform. and Comput. contributor: fullname: Picaronny – volume: vol. 1491 start-page: 374 year: 1998 end-page: 428 ident: br0480 article-title: Decidability and complexity of Petri net problems – an introduction publication-title: Lectures on Petri Nets I: Basic Models contributor: fullname: Esparza – volume: vol. 1862 start-page: 262 year: 2000 end-page: 276 ident: br0560 article-title: Flatness is not a weakness publication-title: CSL 2000 contributor: fullname: Cortier – volume: vol. 3 start-page: 433 year: 2009 end-page: 444 ident: br0140 article-title: Forward analysis for WSTS, Part I: completions publication-title: STACS 2009 contributor: fullname: Goubault-Larrecq – volume: vol. 254 start-page: 413 year: 1987 end-page: 434 ident: br0490 article-title: Complexity of Place/Transition nets publication-title: Petri Nets: Central Models and Their Properties contributor: fullname: Jantzen – year: 1987 ident: br0650 article-title: Simulation of linear fifo nets by Petri nets having a structured set of terminal markings publication-title: APN'87 contributor: fullname: Choquet – volume: 127 start-page: 91 year: 1996 end-page: 101 ident: br0100 article-title: Verifying programs with unreliable channels publication-title: Inform. and Comput. contributor: fullname: Jonsson – volume: vol. 6281 start-page: 616 year: 2010 end-page: 628 ident: br0450 article-title: Revisiting Ackermann-hardness for lossy counter systems and reset Petri nets publication-title: MFCS 2010 contributor: fullname: Schnoebelen – start-page: 453 year: 2007 end-page: 462 ident: br0580 article-title: On Noetherian spaces publication-title: LICS 2007 contributor: fullname: Goubault-Larrecq – volume: 221 start-page: 211 year: 1999 end-page: 250 ident: br0670 article-title: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations publication-title: Theoret. Comput. Sci. contributor: fullname: Habermehl – volume: 6 start-page: 223 year: 1978 end-page: 231 ident: br0470 article-title: The covering and boundedness problems for vector addition systems publication-title: Theoret. Comput. Sci. contributor: fullname: Rackoff – year: 2000 ident: br0510 article-title: A note on SLRE contributor: fullname: Mayr – volume: vol. 3170 start-page: 402 year: 2004 end-page: 416 ident: br0110 article-title: On flatness for 2-dimensional vector addition systems with states publication-title: CONCUR 2004 contributor: fullname: Sutre – volume: 22 start-page: 783 year: 2011 end-page: 799 ident: br0410 article-title: On Yen's path logic for Petri nets publication-title: Internat. J. Found. Comput. Sci. contributor: fullname: Habermehl – volume: vol. 3707 start-page: 474 year: 2005 end-page: 488 ident: br0040 article-title: Flat acceleration in symbolic model checking publication-title: ATVA 2005 contributor: fullname: Schnoebelen – volume: 195 start-page: 183 year: 1998 end-page: 203 ident: br0600 article-title: An algorithmic approach for checking closure properties of temporal logic specifications and publication-title: Theoret. Comput. Sci. contributor: fullname: Wolper – volume: vol. 6227 start-page: 51 year: 2010 end-page: 75 ident: br0370 article-title: Lossy counter machines decidability cheat sheet publication-title: RP 2010 contributor: fullname: Schnoebelen – start-page: 87 year: 2007 end-page: 100 ident: br0310 article-title: Events can make sense publication-title: USENIX 2007 contributor: fullname: Kaashoek – volume: 30 start-page: 323 year: 1983 end-page: 342 ident: br0630 article-title: On communicating finite-state machines publication-title: J. ACM contributor: fullname: Zafiropulo – volume: 72 start-page: 180 year: 2006 end-page: 203 ident: br0150 article-title: Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS publication-title: J. Comput. System Sci. contributor: fullname: Van Begin – volume: 44 start-page: 249 year: 2007 end-page: 288 ident: br0340 article-title: Well-structured languages publication-title: Acta Inform. contributor: fullname: Begin – start-page: 319 year: 1988 end-page: 327 ident: br0550 article-title: On the complexity of publication-title: FOCS'88 contributor: fullname: Safra – volume: 8 start-page: 1 year: 2016 end-page: 36 ident: br0420 article-title: Complexity hierarchies beyond Elementary publication-title: ACM Trans. Comput. Theory contributor: fullname: Schmitz – year: 1976 ident: br0440 article-title: The reachability problem requires exponential space contributor: fullname: Lipton – volume: 116 start-page: 134 year: 1995 end-page: 153 ident: br0590 article-title: Rational and recognizable complex trace languages publication-title: Inform. and Comput. contributor: fullname: Petit – volume: 297 start-page: 337 year: 2003 end-page: 354 ident: br0250 article-title: Undecidable problems in unreliable computations publication-title: Theoret. Comput. Sci. contributor: fullname: Mayr – volume: 34 start-page: 6:1 year: 2012 end-page: 6:48 ident: br0320 article-title: Algorithmic verification of asynchronous programs publication-title: ACM Trans. Program. Lang. Syst. contributor: fullname: Majumdar – volume: 21 start-page: 689 year: 1969 end-page: 694 ident: br0210 article-title: A characterization of semilinear sets publication-title: Proc. Amer. Math. Soc. contributor: fullname: Siromoney – volume: 242 start-page: 306 year: 2015 ident: 10.1016/j.tcs.2016.04.020_br0190 article-title: Taming past LTL and flat counter systems publication-title: Inform. and Comput. doi: 10.1016/j.ic.2015.03.007 contributor: fullname: Demri – volume: vol. 3 start-page: 433 year: 2009 ident: 10.1016/j.tcs.2016.04.020_br0140 article-title: Forward analysis for WSTS, Part I: completions contributor: fullname: Finkel – volume: 297 start-page: 337 issue: 1–3 year: 2003 ident: 10.1016/j.tcs.2016.04.020_br0250 article-title: Undecidable problems in unreliable computations publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(02)00646-1 contributor: fullname: Mayr – volume: 44 start-page: 249 issue: 3–4 year: 2007 ident: 10.1016/j.tcs.2016.04.020_br0340 article-title: Well-structured languages publication-title: Acta Inform. doi: 10.1007/s00236-007-0050-3 contributor: fullname: Geeraerts – year: 1967 ident: 10.1016/j.tcs.2016.04.020_br0350 contributor: fullname: Minsky – volume: 6 start-page: 223 issue: 2 year: 1978 ident: 10.1016/j.tcs.2016.04.020_br0470 article-title: The covering and boundedness problems for vector addition systems publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(78)90036-1 contributor: fullname: Rackoff – volume: vol. 254 start-page: 413 year: 1987 ident: 10.1016/j.tcs.2016.04.020_br0490 article-title: Complexity of Place/Transition nets contributor: fullname: Jantzen – start-page: 32 year: 2015 ident: 10.1016/j.tcs.2016.04.020_br0130 article-title: Reachability in two-dimensional vector addition systems with states is PSPACE-complete contributor: fullname: Blondin – volume: 195 start-page: 183 issue: 2 year: 1998 ident: 10.1016/j.tcs.2016.04.020_br0600 article-title: An algorithmic approach for checking closure properties of temporal logic specifications and ω-regular languages publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(97)00219-3 contributor: fullname: Peled – volume: 116 start-page: 134 issue: 1 year: 1995 ident: 10.1016/j.tcs.2016.04.020_br0590 article-title: Rational and recognizable complex trace languages publication-title: Inform. and Comput. doi: 10.1006/inco.1995.1010 contributor: fullname: Diekert – volume: 72 start-page: 180 issue: 1 year: 2006 ident: 10.1016/j.tcs.2016.04.020_br0150 article-title: Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2005.09.001 contributor: fullname: Geeraerts – volume: vol. 818 start-page: 55 year: 1994 ident: 10.1016/j.tcs.2016.04.020_br0030 article-title: Symbolic verification with periodic sets contributor: fullname: Boigelot – volume: vol. 3707 start-page: 474 year: 2005 ident: 10.1016/j.tcs.2016.04.020_br0040 article-title: Flat acceleration in symbolic model checking contributor: fullname: Bardin – start-page: 70 year: 1998 ident: 10.1016/j.tcs.2016.04.020_br0260 article-title: On model checking for non-deterministic infinite-state systems contributor: fullname: Emerson – volume: 13 start-page: 39 year: 1970 ident: 10.1016/j.tcs.2016.04.020_br0430 article-title: Hierarchies of number theoretic functions, I publication-title: Arch. Math. Logic doi: 10.1007/BF01967649 contributor: fullname: Löb – volume: 28 start-page: 624 issue: 4 year: 1980 ident: 10.1016/j.tcs.2016.04.020_br0620 article-title: Formal methods in system design publication-title: IEEE Trans. Commun. doi: 10.1109/TCOM.1980.1094685 contributor: fullname: Bochmann – volume: 221 start-page: 211 issue: 1–2 year: 1999 ident: 10.1016/j.tcs.2016.04.020_br0670 article-title: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(99)00033-X contributor: fullname: Bouajjani – volume: 36 start-page: 341 issue: 4 year: 2002 ident: 10.1016/j.tcs.2016.04.020_br0290 article-title: About the decision of reachability for register machines publication-title: RAIRO Theor. Inform. Appl. doi: 10.1051/ita:2003001 contributor: fullname: Cortier – volume: vol. 1862 start-page: 262 year: 2000 ident: 10.1016/j.tcs.2016.04.020_br0560 article-title: Flatness is not a weakness contributor: fullname: Comon – volume: 25 start-page: 39 issue: 1 year: 2004 ident: 10.1016/j.tcs.2016.04.020_br0270 article-title: Using forward reachability analysis for verification of lossy channel systems publication-title: Form. Methods Syst. Des. doi: 10.1023/B:FORM.0000033962.51898.1a contributor: fullname: Abdulla – start-page: 269 year: 2011 ident: 10.1016/j.tcs.2016.04.020_br0520 article-title: Ackermannian and primitive-recursive bounds with Dickson's Lemma contributor: fullname: Figueira – ident: 10.1016/j.tcs.2016.04.020_br0680 – volume: 130 start-page: 71 issue: 1 year: 1996 ident: 10.1016/j.tcs.2016.04.020_br0240 article-title: Undecidable verification problems for programs with unreliable channels publication-title: Inform. and Comput. doi: 10.1006/inco.1996.0083 contributor: fullname: Abdulla – ident: 10.1016/j.tcs.2016.04.020_br0510 contributor: fullname: Habermehl – ident: 10.1016/j.tcs.2016.04.020_br0020 doi: 10.2168/LMCS-8(3:28)2012 – start-page: 205 year: 2008 ident: 10.1016/j.tcs.2016.04.020_br0220 article-title: The ordinal recursive complexity of lossy channel systems contributor: fullname: Chambart – volume: 256 start-page: 63 issue: 1–2 year: 2001 ident: 10.1016/j.tcs.2016.04.020_br0330 article-title: Well-structured transition systems everywhere! publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(00)00102-X contributor: fullname: Finkel – volume: vol. 6907 start-page: 108 year: 2011 ident: 10.1016/j.tcs.2016.04.020_br0230 article-title: Model-checking coverability graphs of vector addition systems contributor: fullname: Blockelet – volume: 23 start-page: 303 issue: 3 year: 2003 ident: 10.1016/j.tcs.2016.04.020_br0090 article-title: From Pre-historic to Post-modern symbolic model checking publication-title: Form. Methods Syst. Des. doi: 10.1023/A:1026228213080 contributor: fullname: Henzinger – volume: 21 start-page: 597 issue: 4 year: 2010 ident: 10.1016/j.tcs.2016.04.020_br0500 article-title: Finding the growth rate of a regular or context-free language in polynomial time publication-title: Internat. J. Found. Comput. Sci. doi: 10.1142/S0129054110007441 contributor: fullname: Gawrychowski – volume: vol. 3170 start-page: 402 year: 2004 ident: 10.1016/j.tcs.2016.04.020_br0110 article-title: On flatness for 2-dimensional vector addition systems with states contributor: fullname: Leroux – start-page: 87 year: 2007 ident: 10.1016/j.tcs.2016.04.020_br0310 article-title: Events can make sense contributor: fullname: Krohn – volume: 10 start-page: 401 issue: 5 year: 2008 ident: 10.1016/j.tcs.2016.04.020_br0070 article-title: Fast: acceleration from theory to practice publication-title: Int. J. Softw. Tools Technol. Transf. doi: 10.1007/s10009-008-0064-3 contributor: fullname: Bardin – ident: 10.1016/j.tcs.2016.04.020_br0640 contributor: fullname: Pachl – start-page: 393 year: 1995 ident: 10.1016/j.tcs.2016.04.020_br0610 article-title: Infinite traces contributor: fullname: Gastin – year: 1987 ident: 10.1016/j.tcs.2016.04.020_br0650 article-title: Simulation of linear fifo nets by Petri nets having a structured set of terminal markings contributor: fullname: Finkel – start-page: 352 year: 1999 ident: 10.1016/j.tcs.2016.04.020_br0390 article-title: On the verification of broadcast protocols contributor: fullname: Esparza – volume: 3 start-page: 147 issue: 2 year: 1969 ident: 10.1016/j.tcs.2016.04.020_br0160 article-title: Parallel program schemata publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(69)80011-5 contributor: fullname: Karp – volume: vol. 3707 start-page: 489 year: 2005 ident: 10.1016/j.tcs.2016.04.020_br0120 article-title: Flat counter automata almost everywhere! contributor: fullname: Leroux – volume: 14 start-page: 237 issue: 3 year: 1999 ident: 10.1016/j.tcs.2016.04.020_br0660 article-title: Symbolic verification of communication protocols with infinite state spaces using QDDs publication-title: Form. Methods Syst. Des. doi: 10.1023/A:1008719024240 contributor: fullname: Boigelot – volume: 8 start-page: 1 issue: 1 year: 2016 ident: 10.1016/j.tcs.2016.04.020_br0420 article-title: Complexity hierarchies beyond Elementary publication-title: ACM Trans. Comput. Theory doi: 10.1145/2858784 contributor: fullname: Schmitz – start-page: 453 year: 2007 ident: 10.1016/j.tcs.2016.04.020_br0580 article-title: On Noetherian spaces contributor: fullname: Goubault-Larrecq – volume: vol. 1644 start-page: 301 year: 1999 ident: 10.1016/j.tcs.2016.04.020_br0300 article-title: Boundedness of reset P/T nets contributor: fullname: Dufourd – volume: 20 start-page: 313 issue: 4 year: 2011 ident: 10.1016/j.tcs.2016.04.020_br0180 article-title: Model-checking CTL⁎ over flat Presburger counter systems publication-title: J. Appl. Non-Classical Logics doi: 10.3166/jancl.20.313-344 contributor: fullname: Demri – volume: vol. 2556 start-page: 145 year: 2002 ident: 10.1016/j.tcs.2016.04.020_br0380 article-title: How to compose Presburger-accelerations: applications to broadcast protocols contributor: fullname: Finkel – volume: 160 start-page: 109 issue: 1–2 year: 2000 ident: 10.1016/j.tcs.2016.04.020_br0080 article-title: Algorithmic analysis of programs with well quasi-ordered domains publication-title: Inform. and Comput. doi: 10.1006/inco.1999.2843 contributor: fullname: Abdulla – start-page: 50 year: 1976 ident: 10.1016/j.tcs.2016.04.020_br0460 article-title: Exponential space complete problems for Petri nets and commutative semigroups contributor: fullname: Cardoza – volume: 40 start-page: 206 issue: 2 year: 2012 ident: 10.1016/j.tcs.2016.04.020_br0690 article-title: Bounded underapproximations publication-title: Form. Methods Syst. Des. doi: 10.1007/s10703-011-0136-y contributor: fullname: Ganty – year: 1976 ident: 10.1016/j.tcs.2016.04.020_br0440 contributor: fullname: Lipton – volume: vol. 6756 start-page: 441 year: 2011 ident: 10.1016/j.tcs.2016.04.020_br0530 article-title: Multiply-recursive upper bounds with Higman's Lemma contributor: fullname: Schmitz – volume: 43 start-page: 233 issue: 2 year: 2013 ident: 10.1016/j.tcs.2016.04.020_br0570 article-title: Computable fixpoints in well-structured symbolic model checking publication-title: Form. Methods Syst. Des. doi: 10.1007/s10703-012-0168-y contributor: fullname: Bertrand – volume: 113 start-page: 333 issue: 2 year: 1964 ident: 10.1016/j.tcs.2016.04.020_br0010 article-title: Bounded Algol-like languages publication-title: Trans. Amer. Math. Soc. contributor: fullname: Ginsburg – start-page: 332 year: 1986 ident: 10.1016/j.tcs.2016.04.020_br0540 article-title: An automata-theoretic approach to automatic program verification contributor: fullname: Vardi – volume: vol. 6227 start-page: 51 year: 2010 ident: 10.1016/j.tcs.2016.04.020_br0370 article-title: Lossy counter machines decidability cheat sheet contributor: fullname: Schnoebelen – volume: vol. 2102 start-page: 368 year: 2001 ident: 10.1016/j.tcs.2016.04.020_br0050 article-title: TReX: a tool for reachability analysis of complex systems contributor: fullname: Annichini – volume: vol. 9210 start-page: 133 year: 2015 ident: 10.1016/j.tcs.2016.04.020_br0200 article-title: Interprocedural reachability for flat integer programs contributor: fullname: Ganty – volume: 21 start-page: 689 issue: 3 year: 1969 ident: 10.1016/j.tcs.2016.04.020_br0210 article-title: A characterization of semilinear sets publication-title: Proc. Amer. Math. Soc. doi: 10.1090/S0002-9939-1969-0239891-9 contributor: fullname: Siromoney – volume: 34 start-page: 6:1 issue: 1 year: 2012 ident: 10.1016/j.tcs.2016.04.020_br0320 article-title: Algorithmic verification of asynchronous programs publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/2160910.2160915 contributor: fullname: Ganty – volume: vol. 1491 start-page: 374 year: 1998 ident: 10.1016/j.tcs.2016.04.020_br0480 article-title: Decidability and complexity of Petri net problems – an introduction contributor: fullname: Esparza – volume: 22 start-page: 783 issue: 4 year: 2011 ident: 10.1016/j.tcs.2016.04.020_br0410 article-title: On Yen's path logic for Petri nets publication-title: Internat. J. Found. Comput. Sci. doi: 10.1142/S0129054111008428 contributor: fullname: Atig – start-page: 319 year: 1988 ident: 10.1016/j.tcs.2016.04.020_br0550 article-title: On the complexity of ω-automata contributor: fullname: Safra – volume: 30 start-page: 323 issue: 2 year: 1983 ident: 10.1016/j.tcs.2016.04.020_br0630 article-title: On communicating finite-state machines publication-title: J. ACM doi: 10.1145/322374.322380 contributor: fullname: Brand – volume: 34 start-page: 85 issue: 2 year: 1997 ident: 10.1016/j.tcs.2016.04.020_br0280 article-title: Decidability of model checking for infinite-state concurrent systems publication-title: Acta Inform. doi: 10.1007/s002360050074 contributor: fullname: Esparza – ident: 10.1016/j.tcs.2016.04.020_br0060 contributor: fullname: Lash – volume: 127 start-page: 91 issue: 2 year: 1996 ident: 10.1016/j.tcs.2016.04.020_br0100 article-title: Verifying programs with unreliable channels publication-title: Inform. and Comput. doi: 10.1006/inco.1996.0053 contributor: fullname: Abdulla – volume: 195 start-page: 1 issue: 1–2 year: 2004 ident: 10.1016/j.tcs.2016.04.020_br0360 article-title: A well-structured framework for analysing Petri net extensions publication-title: Inform. and Comput. doi: 10.1016/j.ic.2004.01.005 contributor: fullname: Finkel – volume: vol. 1443 start-page: 103 year: 1998 ident: 10.1016/j.tcs.2016.04.020_br0400 article-title: Reset nets between decidability and undecidability contributor: fullname: Dufourd – volume: vol. 6281 start-page: 616 year: 2010 ident: 10.1016/j.tcs.2016.04.020_br0450 article-title: Revisiting Ackermann-hardness for lossy counter systems and reset Petri nets contributor: fullname: Schnoebelen – volume: 89 start-page: 144 issue: 2 year: 1990 ident: 10.1016/j.tcs.2016.04.020_br0170 article-title: Reduction and covering of infinite reachability trees publication-title: Inform. and Comput. doi: 10.1016/0890-5401(90)90009-7 contributor: fullname: Finkel |
SSID | ssj0000576 |
Score | 2.2552655 |
Snippet | We investigate a subclass of well-structured transition systems (WSTS), the trace bounded—in the sense of Ginsburg and Spanier (1964), [1]—complete... We investigate a subclass of well-structured transition systems (WSTS), the trace bounded-in the sense of Ginsburg and Spanier (1964), [1]-complete... We investigate a subclass of well-structured transition systems (WSTS), the trace bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete... |
SourceID | hal proquest crossref elsevier |
SourceType | Open Access Repository Aggregation Database Publisher |
StartPage | 1 |
SubjectTerms | Acceleration Bounded language Complete WSTS Computer Science Computer simulation Constrictions Flattable system Logic in Computer Science Mathematical models Model checking |
Title | Forward analysis and model checking for trace bounded WSTS |
URI | https://dx.doi.org/10.1016/j.tcs.2016.04.020 https://search.proquest.com/docview/1825476662 https://hal.science/hal-01329871 |
Volume | 637 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9tAEB6RcKEHWkIrAm20VD0hufE6a2fdW4IaheclPHJb7VPAIYmC4chvZ8axqUCoB272SmtbM7sz8-2MvwH4lflceidFhFDDRCKxPpIi9KI4djYL2me-pC8-O8_Gl-J4mk7X4LD-F4bKKivbv7LppbWuRrqVNLuL29vuhJJ66E1TTqxRGBc3YB3dkRBNWB8cnYzP_xnktL9KWVISACfUyc2yzKuwRNrNs5LwlLp-v--eGjdUJ_nGXJc-aPQFNqvgkQ1W37cFa37Wgs91YwZW7dMWfDp7IWO934Y_o_mSamOZrghI8MKxsgUOQ5VZOixnGLuyYqmtZ4YaLXnHricXk69wOfp7cTiOqpYJkUXHUqBtszrVQQovNfHY6Nw5BL889G0vMTqgN49dEpzMY4tITRptZXAmyazhuo_RyTdozuYzvwPMZ86g_nhmQi5SIvpD9Ii3uMFDGoe4DQe1pNRixYyh6pKxO4ViVSRWFQuFYm2DqGWpXqlXoeX-37SfKPeXxxMV9nhwqmiMckQ5or1H3ob9Wi0K9wYlPPTMzx_uFSf420eAlux-7P17sEF3dJbL5XdoFssH_wODkMJ0oPH7iXdwqQ2vTk471ZLD0aPp8BnNqdtf |
link.rule.ids | 230,315,786,790,891,3525,4521,24144,27600,27955,27956,45618,45696,45712,45907 |
linkProvider | Elsevier |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8NADLZ4DMDAG1GeB2JCipqES3phA0RVoGVpEd1O9xRlaFGb8vux0wQEQgxseSeyc7a_s-8zwFnqMuGs4AFCDR3w2LhAcH8RhKE1qVcudQV9cecxbT3x-37Sn4Obai0MlVWWtn9m0wtrXR6pl9Ksvw0G9S4l9dCbJhGxRmFcPA-LPEGsR6v4-tdf5jhpzBKWlALAy6vUZlHklRui7I7Sgu6Uen7_7pzmX6hK8oexLjxQcx1Wy9CRXc2-bgPm3HAT1qq2DKwcpZuw0vmkYp1swWVzNKbKWKZK-hHcsKxogMNQYYamyhlGriwfK-OYpjZLzrLnbq-7DU_N295NKygbJgQG3UqOls2oRHnBnVDEYqMyaxH6Rr5hLmKtPPry0Mbeiiw0iNOEVkZ4q-PU6Eg1MDbZgYXhaOh2gbnUatRelGqf8YRo_hA74i4Ob5-EPqzBeSUp-TbjxZBVwdirRLFKEqsMuUSx1oBXspTflCvRbv912ynK_fPxRITdumpLOkYZogyx3ntUg5NKLRJHBqU71NCNphMZEfhtIDyL9_73_mNYavU6bdm-e3zYh2U6Q7O6kTiAhXw8dYcYjuT6qPjdPgDWddmq |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Forward+Analysis+and+Model+Checking+for+Trace+Bounded+WSTS&rft.jtitle=Theoretical+computer+science&rft.au=Chambart%2C+Pierre&rft.au=Finkel%2C+Alain&rft.au=Schmitz%2C+Sylvain&rft.date=2016-07-18&rft.pub=Elsevier&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=637&rft.spage=1&rft.epage=29&rft_id=info:doi/10.1016%2Fj.tcs.2016.04.020&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai_HAL_hal_01329871v1 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |