On Modal Refinement and Consistency

DOI10.1007/978-3-540-74407-8_8zbMATH Open1151.68541OpenAlexW1667182944MaRDI QIDQ3525632FDOQ3525632

Authors: Ulrik Nyman, Andrzej Wąsowski, Kim G. Larsen 

Publication date: 18 September 2008

Published in: CONCUR 2007 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74407-8_8

Recommendations

• Refinement is complete for implementations
• Complexity of Decision Problems for Mixed and Modal Specifications
• Topological analysis of refinement
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
• On refinements of Boolean and parametric modal transition systems

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (30)

• Modal and mixed specifications: key decision problems and their complexities
• Minimal refinements of specifications in modal and temporal logics
• EXPTIME-completeness of thorough refinement on modal transition systems
• Constraint Markov chains
• Interface theories for concurrency and data
• On refinements of Boolean and parametric modal transition systems
• An improvement on the discrepancy in the implementation of modus ponens
• A domain equation for refinement of partial systems
• Modal event-clock specifications for timed component-based design
• Refinement checking on parametric modal transition systems
• On the expressiveness of refinement settings
• A modal interface theory with data constraints
• Complexity of Decision Problems for Mixed and Modal Specifications
• On the consistency, expressiveness, and precision of partial modeling formalisms
• The complexity of one-agent refinement modal logic
• Coherent modal transition systems refinement
• Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
• Refinement is complete for implementations
• 20 years of modal and mixed specifications.
• Taming Modal Impredicativity: Superlazy Reduction
• Parametric and quantitative extensions of modal transition systems
• The complexity of one-agent refinement modal logic
• Topological analysis of refinement
• Refinement and Consistency of Timed Modal Specifications
• EXPTIME-complete decision problems for modal and mixed specifications
• Simulation relations and applications in formal methods
• Safe reasoning with logic LTS
• Rough and Near: Modal History of Two Theories
• Modal Aggregation and the Theory of Paraconsistent Filters
• Modal process rewrite systems

This page was built for publication: On Modal Refinement and Consistency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525632)