Modal Abstractions in μCRL

Pol, Jaco van de; Espada, Miguel Valero

doi:10.1007/978-3-540-27815-3_32

Cited by 12 publications

(11 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, abstract interpretation technology for equation systems was added, allowing one to reduce complex, potentially infinite data types to simpler, finite data types. A recent theoretical analysis of the underlying theory [15] revealed that this technique is more powerful than model checking based on abstractions using modal transition systems, such as [38] and their generalisations using hypertransitions, see e.g. [42].…”

Section: The Mcrl2 Toolsetmentioning

confidence: 99%

An Overview of the mCRL2 Toolset and Its Recent Advances

Cranen

Groote

Keiren

et al. 2013

Lecture Notes in Computer Science

111

View full text Add to dashboard Cite

Abstract. The analysis of complex distributed systems requires dedicated software tools. The mCRL2 language and toolset have been developed to support such analysis. We highlight changes and improvements made to the toolset in recent years. On the one hand, these affect the scope of application, which has been broadened with extended support for data structures like infinite sets and functions. On the other hand, considerable progress has been made regarding the performance of our tools for state space generation and model checking, due to improvements in symbolic reduction techniques and due to a shift towards parity gamebased solving. We also discuss the software architecture of the toolset, which was well suited to accommodate the above changes, and we address a number of case studies to illustrate the approach.

show abstract

Section: The Mcrl2 Toolsetmentioning

confidence: 99%

An Overview of the mCRL2 Toolset and Its Recent Advances

Cranen

Groote

Keiren

et al. 2013

Lecture Notes in Computer Science

111

View full text Add to dashboard Cite

show abstract

“…[19] is that they cannot naturally express logical and structural composition in the same formalism. A comparison between modal specifications and other theories such as interface automata [20] and process algebra [2] can be found in [3].…”

Section: Related Workmentioning

confidence: 99%

A Modal Specification Theory for Components with Data

Bauer

Larsen

Legay

et al. 2012

Formal Aspects of Component Software

View full text Add to dashboard Cite

Abstract. Modal specification is a well-known and widely used formalism used as an abstraction theory for transition systems. Modal specifications are transition systems equipped with two types of transitions: must-transitions that are mandatory to any implementation, and may-transitions that are optional. The duality of transitions allows to develop a unique approach for both logical and structural compositions, and eases the step-wise refinement process for building implementations. We propose Modal Specifications with Data (MSD), the first modal specification theory with explicit representation of data. Our new theory includes all the essential ingredients of a specification theory. As MSD are potentially infinite-state systems, we propose symbolic representations based on effective predicates. Our theory serves as a new abstraction-based formalism for transition systems with data.

show abstract

“…As observed in [20], to do model checking on infinitely-labelled systems, one needs abstraction to obtain a model with a reduced number of labels. We aim for an abstraction method to reduce the labels also in the finite case, by lumping similar transitions with different labels together into a unified one.…”

Section: Refinement and Abstractionmentioning

confidence: 99%

“…One way to deal with this, is to import the refinement and abstraction techniques developed for labelled transition systems (LTS), e.g. [16,15,20]. The refinement method intuitively relates a detailed model (refined model) with a coarser one (abstract model) in which some information may be lost, but the information kept is faithful to the detailed model.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Refinement of Kripke Models for Dynamics

Dechesne

Orzan

Wang

Theoretical Aspects of Computing - ICTAC 2008

View full text Add to dashboard Cite

Abstract. We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have a compact but informative abstraction. We develop a 3-valued version of Public Announcement Logic (PAL) which has a dynamic operator that changes the model in the spirit of public broadcasting. We prove that the refinement relation on static models assures us to safely reason about any dynamic properties in terms of PAL-formulas on the abstraction of a model. The theory is in particular interesting and applicable for an epistemic setting as the example of the Muddy Children puzzle shows, especially in the view of the growing interest for epistemic modelling and (automatic) verification of communication protocols.

show abstract

Modal Abstractions in μCRL

Cited by 12 publications

References 16 publications

An Overview of the mCRL2 Toolset and Its Recent Advances

An Overview of the mCRL2 Toolset and Its Recent Advances

A Modal Specification Theory for Components with Data

Refinement of Kripke Models for Dynamics

Contact Info

Product

Resources

About