Computing Simulations on Finite and Infinite Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/HenzingerHK95
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/HenzingerHK95
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Monika_Rauch_Henzinger
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Peter_W._Kopke
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Thomas_A._Henzinger
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492576
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1995.492576
>
dc:
identifier
DBLP conf/focs/HenzingerHK95
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1995.492576
(xsd:string)
dcterms:
issued
1995
(xsd:gYear)
rdfs:
label
Computing Simulations on Finite and Infinite Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Monika_Rauch_Henzinger
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Peter_W._Kopke
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Thomas_A._Henzinger
>
swrc:
pages
453-462
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/BunemanDFS97
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/MiloS99
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/HenzingerHK95/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/HenzingerHK95
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs95.html#HenzingerHK95
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1995.492576
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
graph theory; decidability; automata theory; simulations computing; infinite graphs; finite graphs; similarity relations; labeled graphs; reactive systems verification; O(mn) algorithm; symbolic similarity-checking procedure; 2D rectangular automata; continuous environments; model-checking problem; decidability
(xsd:string)
dc:
title
Computing Simulations on Finite and Infinite Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document