Pages that link to "Item:Q1910794"
From MaRDI portal
The following pages link to Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem (Q1910794):
Displaying 50 items.
- A geometric view of partial order reduction (Q265807) (← links)
- Topological abstraction of higher-dimensional automata (Q278749) (← links)
- Projecting transition systems: overcoming state explosion in concurrent system verification (Q300375) (← links)
- Modular discrete time approximations of distributed hybrid automata (Q418807) (← links)
- Transparent partial order reduction (Q453518) (← links)
- Confluence reduction for Markov automata (Q507382) (← links)
- Partial order reduction for checking soundness of time workflow nets (Q507759) (← links)
- Component-wise incremental LTL model checking (Q510894) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Composing model programs for analysis (Q710670) (← links)
- Abstract reduction in directed model checking CCS processes (Q715051) (← links)
- Optimising the ProB model checker for B using partial order reduction (Q736463) (← links)
- Using formal verification to evaluate the execution time of Spark applications (Q782497) (← links)
- Translating Java for multiple model checkers: The Bandera back-end (Q816196) (← links)
- Reduced models for efficient CCS verification (Q816205) (← links)
- Control of safe ordinary Petri nets using unfolding (Q816699) (← links)
- Stubborn set reduction for timed reachability and safety games (Q832029) (← links)
- Stateless model checking under a reads-value-from equivalence (Q832184) (← links)
- Model checking \(\omega \)-regular properties with decoupled search (Q832281) (← links)
- Optimistic synchronization-based state-space reduction (Q853724) (← links)
- \(\text{DELFIN}^+\): an efficient deadlock detection tool for CCS processes (Q856423) (← links)
- Question-guided stubborn set methods for state properties (Q862861) (← links)
- Partial (set) 2-structures. II: State spaces of concurrent systems (Q911308) (← links)
- Ant colony optimization with partial order reduction for discovering safety property violations in concurrent models (Q963372) (← links)
- Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations (Q975398) (← links)
- Full simulation coverage for SystemC transaction-level models of systems-on-a-chip (Q1041294) (← links)
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings (Q1188590) (← links)
- Automatic verification of concurrent systems using a formula-based compositional approach (Q1403320) (← links)
- Verification is experimentation! (Q1606799) (← links)
- Compact and efficiently verifiable models for concurrent systems (Q1620959) (← links)
- Reordering control approaches to state explosion in model checking with memory consistency models (Q1630041) (← links)
- Stubborn versus structural reductions for Petri nets (Q1633343) (← links)
- Delay-dependent partial order reduction technique for real time systems (Q1645216) (← links)
- Stateless model checking for TSO and PSO (Q1683934) (← links)
- From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories (Q1704601) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- Difficult configurations -- on the complexity of LTrL (Q1774566) (← links)
- On stubborn sets in the verification of linear time temporal properties (Q1774568) (← links)
- Using partial orders for the efficient verification of deadlock freedom and safety properties (Q1801499) (← links)
- TASS: the toolkit for accurate scientific software (Q1949767) (← links)
- Techniques and applications of computation slicing (Q1953245) (← links)
- Approximate partial order reduction (Q2024376) (← links)
- Quasi-optimal partial order reduction (Q2050101) (← links)
- Pomset bisimulation and unfolding for reset Petri nets (Q2113378) (← links)
- POR for security protocol equivalences. Beyond action-determinism (Q2167736) (← links)
- Exponential automatic amortized resource analysis (Q2200835) (← links)
- The inconsistent labelling problem of stutter-preserving partial-order reduction (Q2200842) (← links)
- Analysis of correct synchronization of operating system components (Q2226972) (← links)
- Event clock message passing automata: a logical characterization and an emptiness checking algorithm (Q2248059) (← links)
