Pages that link to "Item:Q3719811"
From MaRDI portal
The following pages link to Automatic verification of finite-state concurrent systems using temporal logic specifications (Q3719811):
Displaying 50 items.
- Verification of concurrent programs: The automata-theoretic framework (Q2277249) (← links)
- Automatic and hierarchical verification for concurrent systems (Q2277847) (← links)
- Model checking Petri nets with MSVL (Q2279737) (← links)
- Model-checking graded computation-tree logic with finite path semantics (Q2285155) (← links)
- Translating Xd-C programs to MSVL programs (Q2290648) (← links)
- A novel approach to verifying context free properties of programs (Q2290651) (← links)
- Two AGM-style characterizations of model repair (Q2294584) (← links)
- The model checking fingerprints of CTL operators (Q2317834) (← links)
- Unified mathematical framework for slicing and symmetry reduction over event structures (Q2336364) (← links)
- Reasoning about memoryless strategies under partial observability and unconditional fairness constraints (Q2346410) (← links)
- Model-checking for resource-bounded ATL with production and consumption of resources (Q2361350) (← links)
- Model checking mobile ad hoc networks (Q2363813) (← links)
- On the universal and existential fragments of the \(\mu\)-calculus (Q2368950) (← links)
- Compositional analysis for verification of parameterized systems (Q2368952) (← links)
- Resources in process algebra (Q2373652) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Symbolic model checking for channel-based component connectors (Q2389338) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- Assembling a consistent set of sentences in relational probabilistic logic with stochastic independence (Q2390651) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Verifying a scheduling protocol of safety-critical systems (Q2424721) (← links)
- Temporal property verification as a program analysis task (Q2441713) (← links)
- Deadlock-freedom in component systems with architectural constraints (Q2441719) (← links)
- Cancer hybrid automata: model, beliefs and therapy (Q2453217) (← links)
- Strong planning under partial observability (Q2457630) (← links)
- Planning temporal events using point-interval logic (Q2473196) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- Model checking abilities of agents: a closer look (Q2481560) (← links)
- Observations in using parallel and sequential evolutionary algorithms for automatic software testing (Q2482366) (← links)
- Analysis of dynamic policies (Q2482441) (← links)
- Model checking expected time and expected reward formulae with random time bounds (Q2494794) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Quantification over sets of possible worlds in branching-time semantics (Q2500778) (← links)
- An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps (Q2505621) (← links)
- Statistical probabilistic model checking with a focus on time-bounded properties (Q2509358) (← links)
- A contribution to the validation of grafcet controlled systems (Q2512110) (← links)
- Verifying untimed and timed aspects of the experimental batch plant (Q2512162) (← links)
- Probabilistic temporal logics via the modal mu-calculus (Q2566296) (← links)
- A semantic framework for the abstract model checking of tccp programs (Q2576949) (← links)
- Dynamic input/output automata: a formal and compositional model for dynamic systems (Q2629850) (← links)
- Unified temporal logic (Q2661764) (← links)
- A proof system for unified temporal logic (Q2686105) (← links)
- On the unusual effectiveness of logic in computer science (Q2736585) (← links)
- Compositional model checking of product-form CTMCs (Q2810967) (← links)
- Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations (Q2830042) (← links)
- Specifying and verifying reactive systems in a multi-language environment (Q2841282) (← links)
- Model checking for performability (Q2843861) (← links)
- Validating for liveness in hidden adversary systems (Q2864511) (← links)
