Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Stubborn sets for reduced state generation
APN 90 Proceedings on Advances in Petri nets 1990
Handbook of theoretical computer science (vol. B)
Information Processing Letters
Model checking and abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Using partial orders for the efficient verification of deadlock freedom and safety properties
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Approximately satisfied properties of systems and simple language homomorphisms
Information Processing Letters
Relative liveness and behavior abstraction (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Journal of Systems and Software - Special issue on formal methods technology transfer
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Propositional Linear Temporal Logic and Language Homomorphisms
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
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)
Property Preserving Abstractions under Parallel Composition
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Partial-Order Methods for Temporal Verification
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A Practical Technique for Process Abstraction
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On the Relation of Programs and Computations to Models of Temporal Logic
Temporal Logic in Specification
A Stubborn Attack On State Explosion
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Partial Orders to Improve Automatic Verification Methods
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Local Liveness for Compositional Modeling of Fair Reactive Systems
Proceedings of the 7th International Conference on Computer Aided Verification
Property Preserving Homomorphisms of Transition Systems
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
| Hi-index | 0.00 |
Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, i.e. linear-time temporal properties under an abstract notion of fairness. Being defined on the complete behaviour of a distributed system, weakly continuation-closed abstractions require, in principle, an exhaustive state-space construction prior to abstraction. Constructing the state-space of a practically relevant specification exhaustively, however, is usually unfeasible.Based on the notion of traces, i.e. certain equivalence classes of behaviours, we define trace reductions. Trace reductions are a particular partial-order reduction based on the persistent-set selective search technique. We show that a trace reduction can be used on behalf of the complete behaviour of a distributed system in order to compute abstractions as well as to check whether the abstractions are weakly continuation-closed. Thus, trace reductions allow us to overcome the requirement of an exhaustive state-space construction prior to abstraction.