The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Elements of distributed algorithms: modeling and analysis with Petri nets
Elements of distributed algorithms: modeling and analysis with Petri nets
Modularization and Abstraction: The Keys to Practical Formal Verification
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Model Checking and Modular Verification
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Analysis of Discrete Event Coordination
Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, REX Workshop
Algorithmic Verification of Linear Temporal Logic Specifications
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
| Hi-index | 0.00 |
W e present a simulation preorder for reactive systems modeled by fair Kripke structures whose transition relation is divided into two parts, internal and external. The first one models the internal behaviour of the system, while the second one is used to model the interaction with an environment. We show that our simulation preorder preserves a substantial subset of 驴CTL*. Then, we present an abstraction technique for systems composed by multiple modules and we show that each such system is smaller in the simulation preorder than its "augmented" components. We illustrate our abstraction methodology by applying it to Petri net reactive systems.