A symbolic model for timed concurrent constraint programming

DOI10.1016/j.entcs.2015.04.010zbMath1342.68222OpenAlexW2066746166WikidataQ113317803 ScholiaQ113317803MaRDI QIDQ530859

Carlos Olarte, Jaime Arias, Michell Guzman

Publication date: 1 August 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.04.010

zbMATH Keywords

model checkingtemporal logicconcurrent 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) Temporal logic (03B44) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

A Declarative View of Signaling Pathways

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear temporal logic symbolic model checking
• Symbolic model checking: \(10^{20}\) states and beyond
• Decidability of infinite-state timed CCP processes and first-order LTL
• A timed concurrent constraint language.
• Linear concurrent constraint programming: Operational and phase semantics
• Decision procedures and expressiveness in the temporal logic of branching time
• Models and emerging trends of concurrent constraint programming
• Abstract diagnosis for timed concurrent constraint programs
• Graph-Based Algorithms for Boolean Function Manipulation
• Automatic verification of timed concurrent constraint programs

This page was built for publication: A symbolic model for timed concurrent constraint programming