A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Specification-oriented semantics for communicating processes
Acta Informatica
Theoretical Computer Science
Ready-trace semantics for concrete process algebra with the priority operator
The Computer Journal
Bisimulation through probabilistic testing
Information and Computation
Graphical versus logical specifications
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Journal of the ACM (JACM)
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing refinements for failure and bisimulation semantics
Fundamenta Informaticae
Automata for the Modal mu-Calculus and related Results
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
On the Expressiveness of 3-Valued Models
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Possible Worlds for Process Algebras
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
The Existence of Finite Abstractions for Branching Time Model Checking
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
3-Valued Abstraction: More Precision at Less Cost
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata Games for Multiple-model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Ranked predicate abstraction for branching time: complete, incremental, and precise
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
On modal refinement and consistency
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Relating modal refinements, covariant-contravariant simulations and partial bisimulations
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Ensuring reachability by design
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
Embedded-systems designers often use transition system-based notations for specifying, with respect to some refinement preorder, sets of deterministic implementations. This paper compares popular such refinement settings — ranging from transition systems equipped with failure-pair inclusion to disjunctive modal transition systems — regarding the sets of implementations they are able to express. The paper’s main result is an expressiveness hierarchy, as well as language-preserving transformations between various settings. In addition to system designers, the main beneficiaries of this work are tool builders who wish to reuse refinement checkers or model checkers across different settings.