A branching time logic with past operators

DOI10.1016/S0022-0000(05)80048-0zbMath0821.68055MaRDI QIDQ1337463

Michael Kaminski

Publication date: 6 November 1994

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

finite automatagraph automatabranching time logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (1)

A formal model for service-oriented interactions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata on infinite objects and their applications to logic and programming
• A classification of \(\omega\)-regular languages
• Finite automata on directed graphs
• Tree acceptors and some of their applications
• Temporal logic can be more expressive
• Propositional dynamic logic of looping and converse is elementarily decidable
• Deciding full branching time logic
• “Sometimes” and “not never” revisited
• The complexity of propositional linear temporal logics
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decision problems forω-automata
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Finite and Circular Path Models for Branching Time Logics

This page was built for publication: A branching time logic with past operators