Refinement checking on parametric modal transition systems

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Acta Informatica

• Publication date

  2015-04-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00236-015-0215-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

  2013influential reference
• MoTraS: A Tool for Modal Transition Systems and Their Extensions

  2013cited by this paper
• On Refinements of Boolean and Parametric Modal Transition Systems

  2013cited by this paper
• Modal transition systems with weight intervals

  2012cited by this paper
• Dual-Priced Modal Transition Systems with Time Durations

  2012cited by this paper
• EXPTIME-completeness of thorough refinement on modal transition systems

  2012influential reference
• Modal event-clock specifications for timed component-based design

  2012cited by this paper
• Modal Interface Automata

  2012cited by this paper
• Modal Transition Systems: Composition and LTL Model Checking

  2011cited by this paper
• Graphical representation of covariant-contravariant modal formulae

  2011cited by this paper
• A Modal Interface Theory for Component-based Design

  2011cited by this paper
• Parametric Modal Transition Systems

  2011influential reference
• Quantitative Refinement for Weighted Modal Transition Systems

  2011cited by this paper
• ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems

  2010cited by this paper
• Compositional Design Methodology with Constraint Markov Chains

  2010cited by this paper
• Disjunctive Modal Transition Systems and Generalized LTL Model Checking

  2010cited by this paper
• Process Algebra for Modal Transition Systemses

  2010influential reference
• Compositional may-must program analysis: unleashing the power of alternation

  2010cited by this paper
• Why Are Modalities Good for Interface Theories?

  2009cited by this paper
• Don't Know for Multi-valued Systems

  2009cited by this paper
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete

  2009cited by this paper
• On determinism in modal transition systems

  2009influential reference
• Comparing disjunctive modal transition systems with an one-selecting variant

  2008cited by this paper
• 20 Years of Modal and Mixed Specifications

  2008cited by this paper
• Modal Abstractions of Concurrent Behaviour

  2008cited by this paper
• Complexity of Decision Problems for Mixed and Modal Specifications

  2008influential reference
• Modeling and Model Checking Software Product Lines

  2008cited by this paper
• On Modal Refinement and Consistency

  2007cited by this paper
• Quotient de spécifications pour la réutilisation de composants

  2007cited by this paper
• Modal I/O Automata for Interface and Product Line Theories

  2007cited by this paper
• Characteristic mu-Calculus Formulas for Underspecified Transition Systems

  2005cited by this paper
• Behavioural Equivalences on Finite-State Systems are PTIME-hard

  2005cited by this paper
• The existence of finite abstractions for branching time model checking

  2004cited by this paper
• Merging partial behavioural models

  2004cited by this paper
• Abstraction for Branching Time Properties

  2003cited by this paper
• Modal Transition Systems: A Foundation for Three-Valued Program Analysis

  2001cited by this paper
• A Logic for the Java Modeling Language JML

  2001cited by this paper
• Abstraction-Based Model Checking Using Modal Transition Systems

  2001cited by this paper
• Interface automata

  2001cited by this paper
• Alternating Refinement Relations

  1998cited by this paper
• Timed Modal Specification —Theory and Tools

  1997cited by this paper
• Abstract interpretation of reactive systems

  1997cited by this paper
• A behavioral notion of subtyping

  1994cited by this paper
• Deciding bisimilarity isP-complete

  1992cited by this paper
• Deciding Bisimilarity is P-Complete

  1992influential reference
• Graphical Versus Logical Specifications

  1990cited by this paper
• Equation solving using modal transition systems

  1990cited by this paper
• I/o automata: a model for discrete event systems

  1988cited by this paper
• A modal process logic

  1988cited by this paper

• Coherent modal transition systems refinement

  2024cites this paper
• Non-reducible Modal Transition Systems

  2023cites this paper
• Counterexample-guided inductive synthesis for probabilistic systems

  2021cites this paper
• Counterexample-Driven Synthesis for Probabilistic Program Sketches

  2019cites this paper
• Modal Interface Theories for Specifying Component-based Systems

  2017cites this paper
• 30 Years of Modal Transition Systems: Survey of Extensions and Analysis

  2017cites this paper
• Project Description — Follow-Up Project Proposal

  2016cites this paper
• Nondeterministic Modal Interfaces

  2015cites this paper