Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Hennessy–Milner_logic> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples per page.
- Hennessy–Milner_logic abstract "In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system, 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.".
- Hennessy–Milner_logic wikiPageID "12809481".
- Hennessy–Milner_logic wikiPageLength "2463".
- Hennessy–Milner_logic wikiPageOutDegree "16".
- Hennessy–Milner_logic wikiPageRevisionID "560003096".
- Hennessy–Milner_logic wikiPageWikiLink BNF_grammar.
- Hennessy–Milner_logic wikiPageWikiLink Backus–Naur_Form.
- Hennessy–Milner_logic wikiPageWikiLink Category:Concurrency_(computer_science).
- Hennessy–Milner_logic wikiPageWikiLink Category:Formal_specification.
- Hennessy–Milner_logic wikiPageWikiLink Category:Logic_in_computer_science.
- Hennessy–Milner_logic wikiPageWikiLink Category:Modal_logic.
- Hennessy–Milner_logic wikiPageWikiLink Computer_science.
- Hennessy–Milner_logic wikiPageWikiLink Dynamic_logic_(modal_logic).
- Hennessy–Milner_logic wikiPageWikiLink Fixed-point_combinator.
- Hennessy–Milner_logic wikiPageWikiLink Fixed_point_operator.
- Hennessy–Milner_logic wikiPageWikiLink ICALP.
- Hennessy–Milner_logic wikiPageWikiLink International_Colloquium_on_Automata,_Languages_and_Programming.
- Hennessy–Milner_logic wikiPageWikiLink Labeled_transition_system.
- Hennessy–Milner_logic wikiPageWikiLink Logical_conjunction.
- Hennessy–Milner_logic wikiPageWikiLink Logical_disjunction.
- Hennessy–Milner_logic wikiPageWikiLink Matthew_Hennessy.
- Hennessy–Milner_logic wikiPageWikiLink Modal_μ-calculus.
- Hennessy–Milner_logic wikiPageWikiLink Robin_Milner.
- Hennessy–Milner_logic wikiPageWikiLink Transition_system.
- Hennessy–Milner_logic wikiPageWikiLinkText "Hennessy–Milner logic".
- Hennessy–Milner_logic hasPhotoCollection Hennessy–Milner_logic.
- Hennessy–Milner_logic wikiPageUsesTemplate Template:Cite_book.
- Hennessy–Milner_logic wikiPageUsesTemplate Template:Comp-sci-stub.
- Hennessy–Milner_logic subject Category:Concurrency_(computer_science).
- Hennessy–Milner_logic subject Category:Formal_specification.
- Hennessy–Milner_logic subject Category:Logic_in_computer_science.
- Hennessy–Milner_logic subject Category:Modal_logic.
- Hennessy–Milner_logic comment "In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system, 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'.".
- Hennessy–Milner_logic label "Hennessy–Milner logic".
- Hennessy–Milner_logic sameAs m.02x5t84.
- Hennessy–Milner_logic sameAs Q13989876.
- Hennessy–Milner_logic sameAs Q13989876.
- Hennessy–Milner_logic wasDerivedFrom Hennessy–Milner_logic?oldid=560003096.
- Hennessy–Milner_logic isPrimaryTopicOf Hennessy–Milner_logic.