default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd Infinity 1997: Bologna, Italy
- Faron Moller:
Second International Workshop on Verification of Infinite State Systems, Infinity 1997, Bologna, Italy, July 11-12, 1997. Electronic Notes in Theoretical Computer Science 9, Elsevier 1997 - Faron Moller
:
Preface. 1 - Felice Balarin:
Verifying invariants by approximate image computation. 2-14 - Zakaria Bouziane, Alain Finkel:
Cyclic Petri net reachability sets are semi-linear effectively constructible. 15-24 - Olaf Burkart:
Model checking rationally restricted right closures of recognizable graphs. 25 - Dennis Dams, Rob Gerth:
The bounded retransmission protocol revisited. 26 - Alain Finkel, Bernard Willems, Pierre Wolper:
A direct symbolic approach to model checking pushdown systems. 27-37 - Laurent Fribourg, Hans Olsén:
Reachability sets of parameterized rings as regular languages. 40 - Petr Jancar, Antonín Kucera:
Bisimilarity of processes with finite-state systems. 41 - David Lesens, Hassen Saïdi:
Abstraction of parameterized networks. 42 - Géraud Sénizergues:
L(A) = L(B)? 43 - Jitka Stríbrná:
Decidability of strong bisimulation of basic parallel processes using Hilbert's basis theorem. 44
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 2024-12-30 19:31 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:
