On model checking multiple hybrid views

  title={On model checking multiple hybrid views},
  author={Michael Huth and Altaf Hussain},
We study consistency, satisfiability, and validity problems for collectively model checking a set of views endowed with labelled transitions, hybrid constraints on states, and atomic propositions. A PTIME algorithm for deciding whether a set of views has a common refinement (consistency) is given. We prove that deciding whether a common refinement satisfies a formula of the hybrid mu-calculus (satisfiability), and its dual (validity), are EXPTIME-complete. We determine two generically generated… CONTINUE READING
Highly Cited
This paper has 37 citations. REVIEW CITATIONS


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 33 references

The Hybrid µ-Calculus

View 6 Excerpts
Highly Influenced

Modal Specifications

K. G. Larsen
Proc . of the ACM SIGSOFT Conference on the Foundations of Software Engineering / European Software Engineering Conference , September • 1989
View 4 Excerpts
Highly Influenced

Merging partial behavioural models

View 3 Excerpts
Highly Influenced

Temporal Logic Query Checking

View 5 Excerpts
Highly Influenced

A modal process logic

[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science • 1988
View 4 Excerpts
Highly Influenced

Abstraction and Probabilities for Hybrid Logics

Electr. Notes Theor. Comput. Sci. • 2005
View 3 Excerpts

Refinement is complete for implementations

Formal Aspects of Computing • 2005
View 2 Excerpts

A domain equation for refinement of partial systems

Mathematical Structures in Computer Science • 2004
View 1 Excerpt

Beyond image-finiteness: labelled transition systems as a Stone space

Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004. • 2004
View 2 Excerpts

Similar Papers

Loading similar papers…