SPOT

swMATH9473MaRDI QIDQ21456

No author found.

Related Items

Timed hyperproperties ⋮ Decentralized route-planning for multi-vehicle teams to satisfy a subclass of linear temporal logic specifications ⋮ From LTL to deterministic automata. A safraless compositional approach ⋮ Good-for-MDPs Automata for Probabilistic Analysis and Reinforcement Learning ⋮ A Logical Approach to Data-Aware Automated Sequence Generation ⋮ Efficient approach of translating LTL formulae into Büchi automata ⋮ Rabinizer 3: Safraless Translation of LTL to Small Deterministic Automata ⋮ Determinization and limit-determinization of Emerson-Lei automata ⋮ Live synthesis ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Degeneralization algorithm for generation of Büchi automata based on contented situation ⋮ Automata-driven partial order reduction and guided search for LTL model checking ⋮ Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas ⋮ Time window temporal logic ⋮ Safraless LTL synthesis considering maximal realizability ⋮ Path planning for robotic teams based on LTL specifications and Petri net models ⋮ A tableau construction for finite linear-time temporal logic ⋮ Index appearance record with preorders ⋮ A CTL* Model Checker for Petri Nets ⋮ Unnamed Item ⋮ LTL to self-loop alternating automata with generic acceptance and back ⋮ Fairness modulo theory: a new approach to LTL software model checking ⋮ An explicit transition system construction approach to LTL satisfiability checking ⋮ Optimized temporal monitors for SystemcC ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear temporal logic symbolic model checking ⋮ Seminator 2 can complement generalized Büchi automata via improved semi-determinization ⋮ New Optimizations and Heuristics for Determinization of Büchi Automata ⋮ Semantic Labelling and Learning for Parity Game Solving in LTL Synthesis ⋮ Generic Emptiness Check for Fun and Profit ⋮ One Theorem to Rule Them All ⋮ A compositional automata-based semantics and preserving transformation rules for testing property patterns ⋮ From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata ⋮ Index Appearance Record for Transforming Rabin Automata into Parity Automata ⋮ Strategies, model checking and branching-time properties in Maude ⋮ Applications and Theory of Petri Nets 2005 ⋮ Component-wise incremental LTL model checking ⋮ Manipulating LTL Formulas Using Spot 1.0 ⋮ LTL Model Checking with Neco ⋮ From Philosophical to Industrial Logics ⋮ A weakness measure for GR(1) formulae ⋮ Practical synthesis of reactive systems from LTL specifications via parity games ⋮ Reactive synthesis with maximum realizability of linear temporal logic specifications ⋮ On-the-fly Emptiness Check of Transition-Based Streett Automata ⋮ On the Relationship between LTL Normal Forms and Büchi Automata ⋮ SAT-based explicit LTL reasoning and its application to satisfiability checking ⋮ Automata-based controller synthesis for stochastic systems: a game framework via approximate probabilistic relations

This page was built for software: SPOT