=========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

Declaring and specifying properties with Counting Fluents Selecting System model and property to translate. Counting Fluents translation view. Performing property verification. Running model simulation (fluent values view).

Project Activity

See All Activity >

Follow Counting Fluents - LTSA

Counting Fluents - LTSA Web Site

Other Useful Business Software
99.99% Uptime for MySQL and PostgreSQL Databases Icon
99.99% Uptime for MySQL and PostgreSQL Databases

Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.

Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
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
Report inappropriate content