Relative liveness and behavior abstraction (extended abstract)

Authors:
Ulrich Nitsche;Pierre Wolper
Affiliations:
University of Zürich, Department of Computer Science, Winterthurerstr. 190, CH-8057 Zürich, Switzerland;University of Liège, Institute Montefiore, B28, B-4000 Liège Sart Tilman, Belgium
Venue:
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Year:
1997

Citing 17
Cited 6

Fairness

Fairness
Infinitary languages: basic theory and applications to concurrent systems

Current trends in concurrency. Overviews and tutorials
Handbook of theoretical computer science (vol. B): formal models and semantics

Handbook of theoretical computer science (vol. B): formal models and semantics
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Sooner is safer than later

Information Processing Letters
Reasoning about infinite computations

Information and Computation
A verification method based on homomorphic model abstractions (abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Verification and behavior abstraction towards a tractable verification technique for large distributed systems

Journal of Systems and Software - Special issue on software engineering for distributed computing
Approximately satisfied properties of systems and simple language homomorphisms

Information Processing Letters
Automata, Languages, and Machines

Automata, Languages, and Machines
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Formal Language Theory

Introduction to Formal Language Theory
Propositional Linear Temporal Logic and Language Homomorphisms

LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Local Liveness for Compositional Modeling of Fair Reactive Systems

Proceedings of the 7th International Conference on Computer Aided Verification
Verification by Behaviour Abstraction - A Case Study of Service Interaction Detection in Intelligent Telephone Networks

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification

Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A Persistent-Set Approach to Abstract Stat-Space Construction in Verification

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Do We Need Liveness? - Approximation of Liveness Properties by Safety Properties

SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A power-set construction for reducing Büchi automata to non-determinism degree two

Information Processing Letters
Fair Model Checking with Process Counter Abstraction

FM '09 Proceedings of the 2nd World Congress on Formal Methods
On combining state space reductions with global fairness assumptions

FM'11 Proceedings of the 17th international conference on Formal methods

Quantified Score

Hi-index	0.00

Relative liveness and behavior abstraction (extended abstract)

Quantified Score

Visualization

Abstract