=========IMPORTANT==========
A new version can be found at:
http://countingfluents.weebly.com

This page will be updated soon
=============================

Counting Fluent Linear-Time Temporal Logic (CFLTL) is an extension of Fluent Linear-Time Temporal Logic, which complements the notion of fluent by the related concept of counting fluent. As opposed to the binary nature of fluents (which are logical propositions), counting fluents are numerical values, that enumerate event occurrences, and allow one to specify naturally some properties of reactive systems, such as bounded liveness and other properties in which the number of occurrences of certain events is relevant. CFLTL is an undecidable, strictly more expressive, extension of fluent linear temporal logic. Although a sound (but incomplete) model checking approach for the logic can be used.

Project Samples

Project Activity

See All Activity >

Follow Counting Fluents - LTSA

Counting Fluents - LTSA Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Counting Fluents - LTSA!

Additional Project Details

Registered

2015-01-30