Along the years, Abstract State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of domains, and for analyzing their computationally interesting properties. However, unlike other well-known and established formalisms, such as Petri nets, they lack of a framework aimed at better supporting their applicability to the formal verification of systems. The goal of my PhD research is to reinforce the ASM formalism as a conceptual tool that developers can find useful and practical in order to analyze properties.
Reasoning about Properties with Abstract State Machines
VESSIO, GENNARO
2015-01-01
Abstract
Along the years, Abstract State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of domains, and for analyzing their computationally interesting properties. However, unlike other well-known and established formalisms, such as Petri nets, they lack of a framework aimed at better supporting their applicability to the formal verification of systems. The goal of my PhD research is to reinforce the ASM formalism as a conceptual tool that developers can find useful and practical in order to analyze properties.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
