This HTML5 document contains 36 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n18https://global.dbpedia.org/id/
n12https://archive.org/details/modaltemporalpro00stir/page/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n17https://archive.org/details/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Hennessy–Milner_logic
rdfs:label
Hennessy–Milner logic
rdfs:comment
In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system (LTS), a structure similar to an automaton. It was introduced in 1980 by Matthew Hennessy and Robin Milner in their paper "On observing nondeterminism and concurrency" (ICALP). Another variant of the HML involves the use of recursion to extend the expressibility of the logic, and is commonly referred to as 'Hennessy-Milner Logic with recursion'. Recursion is enabled with the use of maximum and minimum fixed points.
dcterms:subject
dbc:Logic_in_computer_science dbc:Concurrency_(computer_science) dbc:Formal_specification dbc:Modal_logic
dbo:wikiPageID
12809481
dbo:wikiPageRevisionID
994065891
dbo:wikiPageWikiLink
dbr:Computer_science dbr:Dynamic_logic_(modal_logic) dbr:ICALP dbr:Labeled_transition_system dbr:Logical_disjunction dbr:Robin_Milner dbr:Logical_conjunction dbc:Formal_specification dbr:Matthew_Hennessy dbr:Automaton dbc:Modal_logic dbc:Concurrency_(computer_science) dbc:Logic_in_computer_science dbr:Modal_μ-calculus dbr:Fixed_point_operator dbr:BNF_grammar
dbo:wikiPageExternalLink
n12:n42 n17:modaltemporalpro00stir%7Curl-access=limited%7Cyear=2001%7Cpublisher=Springer%7Cisbn=978-0-387-98717-0%7Cpages=
owl:sameAs
freebase:m.02x5t84 wikidata:Q13989876 n18:QiBu
dbp:wikiPageUsesTemplate
dbt:Comp-sci-stub dbt:Cite_book
dbo:abstract
In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system (LTS), a structure similar to an automaton. It was introduced in 1980 by Matthew Hennessy and Robin Milner in their paper "On observing nondeterminism and concurrency" (ICALP). Another variant of the HML involves the use of recursion to extend the expressibility of the logic, and is commonly referred to as 'Hennessy-Milner Logic with recursion'. Recursion is enabled with the use of maximum and minimum fixed points.
gold:hypernym
dbr:Logic
prov:wasDerivedFrom
wikipedia-en:Hennessy–Milner_logic?oldid=994065891&ns=0
dbo:wikiPageLength
4249
foaf:isPrimaryTopicOf
wikipedia-en:Hennessy–Milner_logic