Automata and temporal logic over arbitrary linear time
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 139828
- scientific article; zbMATH DE number 3972842
- Linear Temporal Logic of Constraint Automata
- Axiomatising timed automata
- A theory of timed automata
- Lectures on Concurrency and Petri Nets
- Temporalized logics and automata for time granularity
- From real-time logic to timed automata
- Automata over continuous time
- scientific article; zbMATH DE number 2080209
Cited in
(20)- Vectorial languages and linear temporal logic
- Synthesis for continuous time
- Automata for a decidable subset of duration calculus.
- Size-change termination and satisfiability for linear-time temporal logics
- Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
- Linear Temporal Logic of Constraint Automata
- Temporal logics over linear time domains are in PSPACE
- scientific article; zbMATH DE number 2016845 (Why is no real title available?)
- scientific article; zbMATH DE number 1543044 (Why is no real title available?)
- Parity Automata for Quantitative Linear Time Logics
- scientific article; zbMATH DE number 6423748 (Why is no real title available?)
- Revisiting separation: algorithms and complexity
- Algebraic and logical characterizations of deterministic linear time classes
- scientific article; zbMATH DE number 7561320 (Why is no real title available?)
- Unambiguity in automata theory
- Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates
- Non-emptiness test for automata over words indexed by the reals and rationals
- Epsilon automata on linear orderings
- Automata with a time-variant structure and supply-demand theorems
- Deciding reachability in automata on words indexed by the reals and rationals
This page was built for publication: Automata and temporal logic over arbitrary linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920121)
