Pages that link to "Item:Q6044122"
From MaRDI portal
The following pages link to On the complexity of verifying concurrent transition systems (Q6044122):
Displaying 14 items.
- Proceedings of the workshop on graph transformation for concurrency and verification (GT-VC 2006), Bonn, Germany, August 31, 2006 (Q375703) (← links)
- Hardness of preorder checking for basic formalisms (Q650916) (← links)
- A consistency analysis of a class of concurrent transient implicit/explicit algorithms (Q802933) (← links)
- Checking simple properties of transition systems defined by Thue specifications (Q1610675) (← links)
- Alternation and bounded concurrency are reverse equivalent. (Q1854297) (← links)
- On the complexity of verifying concurrent transition systems (Q1854510) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Formalization and correctness of a concurrent linear hash structure algorithm using nested transactions and I/O automata (Q2734633) (← links)
- The Complexity of Reliable Concurrency Control (Q3801060) (← links)
- On the Complexity of Bounded Context Switching. (Q5111714) (← links)
- (Q5216076) (← links)
- On the Complexity of Verifying Regular Properties on Flat Counter Systems, (Q5327431) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703782) (← links)
