Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hennessy–Milner_logic> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items 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 wikiPageRevisionID "560003096".
- 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 Hennessy%E2%80%93Milner_logic.
- Hennessy–Milner_logic sameAs Q13989876.
- Hennessy–Milner_logic sameAs Q13989876.
- Hennessy–Milner_logic wasDerivedFrom Hennessy–Milner_logic?oldid=560003096.