A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata

Bauer, Kerstin; Gentilini, Raffaella; Schneider, Klaus

doi:10.1007/s10009-010-0161-y

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2013

2021

Publication Types

Select...

Article1

Book1

Other1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, the tool of abstraction/refinement is also crucial to verify by means of model checking infinite state systems, such as e.g. hybrid automata [25,22,4].…”

Section: Introductionmentioning

confidence: 99%

Rank and simulation: the well-founded case

Gentilini

Piazza

Policriti

2013

Journal of Logic and Computation

Self Cite

View full text Add to dashboard Cite

Abstract. We consider the algorithmic problem of computing the maximal simulation preorder (and quotient) on acyclic labelled graphs. The acyclicity allows to exploit an inner structure on the set of nodes, that can be processed in stages according to a set-theoretic notion of rank. This idea, previously used for bisimulation computation, on the one hand improves on the performances of the ensuing procedure and, on the other hand, gives to the solution an orderly iterative flavour making the algorithmic idea more explicit. The computational complexity achieved is good as we obtain the best performing algorithm for simulation computation on acyclic graphs, in both time and space.

show abstract

“…In this context, the tool of abstraction/refinement is also crucial to verify by means of model checking infinite state systems, such as e.g. hybrid automata [25,22,4].…”

Section: Introductionmentioning

confidence: 99%