Testing Distributed Systems Through Symbolic Model Checking
From MaRDI portal
Publication:3612360
DOI10.1007/978-3-540-73196-2_17zbMath1215.68042MaRDI QIDQ3612360
Gabriel Kalyon, Thierry Massart, Laurent Van Begin, Cédric Meuter
Publication date: 10 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73196-2_17
global property; testing; asynchronous distributed systems; trace checking; model checking of traces
68Q60: Specification and verification (program logics, model checking, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
On the complexity of partial order trace model checking, Testing Distributed Systems Through Symbolic Model Checking
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Petri nets, event structures and domains. I
- LTL is expressively complete for Mazurkiewicz traces
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- The formal design of distributed controllers with \(_{\text d}\text{SL}\) and spin
- Testing Distributed Systems Through Symbolic Model Checking
- Time, clocks, and the ordering of events in a distributed system
- Tools and Algorithms for the Construction and Analysis of Systems
- Principles of Distributed Systems
- Principles of Distributed Systems
- Tools and Algorithms for the Construction and Analysis of Systems
