A product version of dynamic linear time temporal logic

DOI10.1007/3-540-63141-0_4zbMath1512.68156OpenAlexW1485520530MaRDI QIDQ6044107

Jesper G. Henriksen, P. S. Thiagarajan

Publication date: 17 May 2023

Published in: CONCUR '97: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63141-0_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)

Related Items (3)

Specifying and verifying interaction protocols in a temporal action logic ⋮ Propositional Dynamic Logic for Message-Passing Systems ⋮ Dynamic linear time temporal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propositional dynamic logic of regular programs
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Notes on finite asynchronous automata
• Translating regular expressions into small ε-free nondeterministic finite automata
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: A product version of dynamic linear time temporal logic