Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
TCSP: theory of communicating sequential processes
Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Three partition refinement algorithms
SIAM Journal on Computing
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
On the development of reactive systems
Logics and models of concurrent systems
Verifying temporal properties of systems
Verifying temporal properties of systems
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Local model checking for infinite state spaces
Selected papers of the Second Workshop on Concurrency and compositionality
Handbook of logic in computer science (vol. 2)
CTL and ECTL as fragments of the modal &mgr;-calculus
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing syntactic and semantic action refinement
Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
Extension of synthesis algorithm of recursive processes to &mgr;-calculus
Information Processing Letters
ACM Computing Surveys (CSUR)
Modal and temporal logics for processes
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Abstraction and Model Checking to Detect Safety Violations in Requirements Specifications
IEEE Transactions on Software Engineering
Model checking the full modal mu-calculus for infinite sequential processes
Theoretical Computer Science
Communication and Concurrency
Information and Computation
Sometimes "Tomorrow" is "Sometime" - Action Refinement in a Temporal Logic of Objects
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Correctness by Construction: Towards Verification in Hierarchical System Development
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
A Priori Verification of Reactive Systems
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Adding Action Refinement to a Finite Process Algebra
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Symbolic Exploration of transition Hierarchies
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Local Model Checking for Parallel Compositions of Context-Free Processes
CONCUR '94 Proceedings of the Concurrency Theory
Action Refinement and Property Inheritance in Systems of Sequential Agents
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Ten Years of Partial Order Reduction
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Computing Abstractions of Infinite State Systems Compositionally and Automatically
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Property Preserving Simulations
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Exploiting Symmetry In Temporal Logic Model Checking
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of a Distributed Cache Memory by Using Abstractions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
An Improved Algorithm for the Evaluation of Fixpoint Expressions
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Efficient model checking via the equational /spl mu/-calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Action Refinement for Real-Time Concurrent Processes with Urgency
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Properties of Sequential Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
On hierarchically developing reactive systems
Information and Computation
Connection between logical and algebraic approaches to concurrent systems†
Mathematical Structures in Computer Science
| Hi-index | 0.00 |
The hierarchical design approach for action based systems that is known as action refinement has been studied in the literature extensively. In a paper of M. Huhn published in CONCUR 1996 a refinement operator on a linear time logic is presented that mimics precisely a semantic action refinement on synchronisation structures. We present here an alternative approach where our starting point is a process algebraic setting with a syntactic action refinement. We present a refinement operator on the Modal Mu-calculus that conforms with the process algebraic refinement in the following sense: Provided some reasonable conditions are met, the transition system induced by a process term P satisfies a Modal Mu-Calculus-specification ϕ if and only if the system which is induced by a refinement of P satisfies a particular refinement of ϕ. Alleviating these conditions, we show that each of the two implications in the equivalence assertion above can be separately proven valid for a particular fragment of the Modal Mu-calculus. We demonstrate that the obtained results can indeed be used as a hierarchical verification technique. As a further application of our results, we explain how they can be employed as an abstraction technique in order to enhance model checking techniques.