Model checking with fairness assumptions using PAT
From MaRDI portal
Publication:2418662
DOI10.1007/s11704-013-3091-5zbMath1425.68269OpenAlexW1996474245MaRDI QIDQ2418662
Yuanjie Si, Xiaohu Yang, Yang Liu, Jun Pang, Shaojie Zhang, Jun Sun, Jin-Song Dong
Publication date: 28 May 2019
Published in: Frontiers of Computer Science (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/14957
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Event fairness and non-interleaving concurrency
- Appraising fairness in languages for distributed programming
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- Fairness and hyperfairness in multi-party interactions
- Modalities for model checking: Branching time logic strikes back
- Model checking with strong fairness
- More efficient on-the-fly LTL verification with Tarjan's algorithm
- Proving the Correctness of Multiprocess Programs
- Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
- Fairness and hyperfairness
- All You Need Is Compassion
- Depth-First Search and Linear Graph Algorithms
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- CONCUR 2005 – Concurrency Theory
- Integrated Formal Methods
- A new heuristic for bad cycle detection using BDDs
This page was built for publication: Model checking with fairness assumptions using PAT