default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID1st Infinity 1996: Pisa, Italy
- Bernhard Steffen, Didier Caucal:
First International Workshop on Verification of Infinite State Systems, Infinity 1996, Università di Pisa, Pisa, Italy, August 30-31, 1996. Electronic Notes in Theoretical Computer Science 5, Elsevier 1997 - Bernhard Steffen:
Preface. 1 - Yoram Hirshfeld:
Bisimulation trees and the decidability of weak bisimulations. 2-13 - Ivana Cerná, Mojmír Kretínský, Antonín Kucera:
Bisimilarity is decidable in the union of normed BPA and normed BPP processes. 14 - Pawel Paczkowski:
Characterizing bisimilarity of value-passing parametrised processes. 15 - Olaf Burkart, Yves-Marie Quemener:
Model-checking of infinite graphs defined by graph grammars. 16 - Régis Cridlig:
Semantic analysis of concurrent ML by abstract model-checking. 17 - Richard Mayr:
Semantic reachability. 18-28 - Olaf Burkart, Javier Esparza:
More infinite results. 29 - Olga Kouchnarenko
, Philippe Schnoebelen:
A model for recursive-parallel programs. 30 - Monica Nesi:
Mechanising a modal logic for value-passing agents in HOL. 31-46 - Dilian Gurov, Sergey Berezin, Bruce M. Kapron:
A modal mu-calculus and a proof system for value passing processes. 47
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-26 00:56 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:
