Decidability of infinite-state timed CCP processes and first-order LTL

DOI10.1016/j.tcs.2004.10.009zbMath1078.68110OpenAlexW2034282674MaRDI QIDQ1763732

Frank D. Valencia

Publication date: 22 February 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.009

zbMATH Keywords

DecidabilityTemporal logicProcess calculiInfinite-state systemsFirst-order LTLTimed concurrent constraint programming

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (8)

Abstract Diagnosis for tccp using a Linear Temporal Logic ⋮ Decidable cases of first-order temporal logic with functions ⋮ A symbolic model for timed concurrent constraint programming ⋮ TCC, with History ⋮ The serializability problem for a temporal logic of transaction queries ⋮ Timed Concurrent Constraint Programming for Analysing Biological Systems ⋮ A Framework for Timed Concurrent Constraint Programming with External Functions ⋮ Models and emerging trends of concurrent constraint programming

Uses Software

• Oz
• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nondeterminism and infinite computations in constraint programming
• Timed default concurrent constraint programming
• The complementation problem for Büchi automata with applications to temporal logic
• Alternating automata on infinite trees
• The power of temporal proofs
• The Esterel synchronous programming language: Design, semantics, implementation
• Computing with continuous change
• Decidable fragments of first-order temporal logics
• Formal and natural computing. Essays dedicated to Grzegorz Rozenberg
• Truly concurrent constraint programming
• Networks of constraints: Fundamental properties and applications to picture processing
• A timed concurrent constraint language.
• Computer science today. Recent trends and developments
• Decidability and incompleteness results for first-order temporal logics of linear time
• Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
• Logic Programming

This page was built for publication: Decidability of infinite-state timed CCP processes and first-order LTL