default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th Infinity 2004: London, UK
- Julian C. Bradfield, Faron Moller:
Proceedings of the 6th International Workshop on Verification of Infinite-State Systems, INFINITY 2004, London, UK, September 4, 2004. Electronic Notes in Theoretical Computer Science 138(3), Elsevier 2005 - Julian C. Bradfield, Faron Moller
:
Preface. 1 - Ranko Lazic:
Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. 3-19 - Peter Habermehl, Tomás Vojnar:
Regular Model Checking Using Inference of Regular Languages. 21-36 - Jesse D. Bingham:
A New Approach to Upward-Closed Set Backward Reachability Analysis. 37-48 - Martin Kot, Zdenek Sawa:
Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time. 49-60 - Ranko Lazic, Thomas Christopher Newcomb, Bill Roscoe:
Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting. 61-86 - Olga Grinchtein, Bengt Jonsson, Martin Leucker:
Inference of Timed Transition Systems. 87-99 - Ahmed Bouajjani, Axel Legay, Pierre Wolper:
Handling Liveness Properties in (omega-)Regular Model Checking. 101-115 - Parosh Aziz Abdulla, Johann Deneux, Pritha Mahata:
Closed, Open, and Robust Timed Networks. 117-151 - Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
Reachability Analysis of Synchronized PA Systems. 153-178
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.
last updated on 2025-12-25 23:52 CET 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:
