scientific article; zbMATH DE number 3870578
From MaRDI portal
Publication:3336675
Recommendations
Cited in
(only showing first 100 items - show all)- Automatic symmetry detection for Promela
- A multiprocess network logic with temporal and spatial modalities
- Synthesis of communicating process skeletons from temporal-spatial logic specifications
- Characterizing finite Kripke structures in propositional temporal logic
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- TABLEAUX: A general theorem prover for modal logics
- Synthesizing synchronous systems by static scheduling in space-time
- CTL^* and ECTL^* as fragments of the modal -calculus
- A logical query language for hypermedia systems
- A technique of state space search based on unfolding
- Determinization and memoryless winning strategies
- A theoretical foundation of the DSSSL location model
- Synchronization of logics
- A temporal logic for real-time partial ordering with named transactions
- An improved algorithm for the evaluation of fixpoint expressions
- Counting on CTL^*: On the expressive power of monadic path logic
- Undecidable problems in unreliable computations.
- On feasible cases of checking multi-agent systems behavior.
- Mathematical modal logic: A view of its evolution
- Verification of reactive systems using temporal logic with clocks
- Quantified computation tree logic
- Clausal resolution in a logic of rational agency
- Model-checking iterated games
- A theory of formal synthesis via inductive learning
- Reasoning about graded strategy quantifiers
- Backdoors for linear temporal logic
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics
- Inconsistency-tolerant temporal reasoning with hierarchical information
- A hierarchy of failures-based models: theory and application
- Weak Muller acceptance conditions for tree automata
- Cycle detection in computation tree logic
- An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
- Module checking
- An infinite hierarchy of temporal logics over branching time
- Is your model checker on time? On the complexity of model checking for timed modal logics
- Symbolic model checking of timed guarded commands using difference decision diagrams
- The guarded fragment with transitive guards
- Model checking and abstraction to the aid of parameterized systems (a survey)
- A transformation-based synthesis of temporal specification
- A planner agent that tries its best in presence of nondeterminism
- GR(1)*: GR(1) specifications extended with existential guarantees
- Dependences in strategy logic
- Alternating-time temporal logics with linear past
- Vacuity in practice: temporal antecedent failure
- Producing explanations for rich logics
- One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
- Improving parity games in practice
- Context-free timed formalisms: robust automata and linear temporal logics
- Language and communication problems in formalization: a natural language approach
- Greening R. Thomas' framework with environment variables: a divide and conquer approach
- Deadlock in packet switching networks
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation
- Why there is no general solution to the problem of software verification
- Is my attack tree correct?
- A complete axiomatization of weighted branching bisimulation
- Generalized abstraction-refinement for game-based CTL lifted model checking
- Hierarchical cost-parity games
- Model-checking precision agriculture logistics: the case of the differential harvest
- Toward model selection by formal methods
- Algebra-based synthesis of loops and their invariants (invited paper)
- Generative program analysis and beyond: the power of domain-specific languages (invited paper)
- Strategies, model checking and branching-time properties in Maude
- Code aware resource management
- Model checking for probabilistic timed automata
- Beyond vacuity: towards the strongest passing formula
- On the order of test goals in specification-based testing
- Synthesizing adaptive test strategies from temporal logic specifications
- Model-checking graded computation-tree logic with finite path semantics
- Natural strategic ability
- A novel approach to verifying context free properties of programs
- Determinizing monitors for HML with recursion
- Two AGM-style characterizations of model repair
- Logical vs. behavioural specifications
- Index set expressions can represent temporal logic formulas
- The model checking fingerprints of CTL operators
- A goal-directed decision procedure for hybrid PDL
- Next-preserving branching bisimulation
- Model checking mobile ad hoc networks
- On the universal and existential fragments of the \(\mu\)-calculus
- Complexity results on branching-time pushdown model checking
- Maintenance goals of agents in a dynamic environment: formulation and policy construction
- From model checking to equilibrium checking: reactive modules for rational verification
- A survey on temporal logics for specifying and verifying real-time systems
- Parameter space abstraction and unfolding semantics of discrete regulatory networks
- Model checking and synthesis for branching multi-weighted logics
- Model checking open systems with alternating projection temporal logic
- Model checking of pushdown systems for projection temporal logic
- A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
- Cancer hybrid automata: model, beliefs and therapy
- Observations in using parallel and sequential evolutionary algorithms for automatic software testing
- Analysis of dynamic policies
- A clausal resolution method for extended computation tree logic ECTL
- A parametric analysis of the state-explosion problem in model checking
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
- Model checking restricted sets of timed paths
- Statistical probabilistic model checking with a focus on time-bounded properties
- Verifying untimed and timed aspects of the experimental batch plant
- Bounded model checking of traffic light control system
- Structure-based deadlock checking of asynchronous circuits
- Interleaving set temporal logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3336675)
