On Modal Refinement and Consistency

DOI10.1007/978-3-540-74407-8_8zbMath1151.68541OpenAlexW1667182944MaRDI QIDQ3525632

Andrzej Wąsowski, Ulrik Nyman, Kim Guldstrand 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

Mathematics Subject Classification ID

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

Related Items (14)

On the consistency, expressiveness, and precision of partial modeling formalisms ⋮ Simulation relations and applications in formal methods ⋮ Coherent modal transition systems refinement ⋮ Modal event-clock specifications for timed component-based design ⋮ A Modal Interface Theory with Data Constraints ⋮ EXPTIME-completeness of thorough refinement on modal transition systems ⋮ EXPTIME-complete Decision Problems for Modal and Mixed Specifications ⋮ Parametric and Quantitative Extensions of Modal Transition Systems ⋮ Interface theories for concurrency and data ⋮ Safe reasoning with logic LTS ⋮ Constraint Markov chains ⋮ Refinement and Consistency of Timed Modal Specifications ⋮ Complexity of Decision Problems for Mixed and Modal Specifications ⋮ Refinement checking on parametric modal transition systems

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