Pages that link to "Item:Q1854510"
From MaRDI portal
The following pages link to On the complexity of verifying concurrent transition systems (Q1854510):
Displaying 24 items.
- Under-approximation of reachability in multivalued asynchronous networks (Q276000) (← links)
- Proceedings of the workshop on graph transformation for concurrency and verification (GT-VC 2006), Bonn, Germany, August 31, 2006 (Q375703) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- A consistency analysis of a class of concurrent transient implicit/explicit algorithms (Q802933) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Sufficient conditions for reachability in automata networks with priorities (Q896709) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- Checking simple properties of transition systems defined by Thue specifications (Q1610675) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- PSPACE-completeness of modular supervisory control problems (Q1773103) (← links)
- The computational complexity of scenario-based agent verification and design (Q2372186) (← links)
- Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← 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)
- A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← 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)
- Distributed Computing (Q5897405) (← links)
- On the complexity of verifying concurrent transition systems (Q6044122) (← links)