Counting Fluents - LTSA download

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

Running model simulation (fluent values view).

Project Activity

See All Activity >

Follow Counting Fluents - LTSA

Counting Fluents - LTSA Web Site

Other Useful Business Software

Passwordless Authentication and Passwordless Security

Identity is everything. Protect it with Duo.

It’s no secret — passwords can be a real headache, both for the people who use them and the people who manage them. Over time, we’ve created hundreds of passwords, it’s easy to lose track of them and they’re easily compromised. Fortunately, passwordless authentication is becoming a feasible reality for many businesses. Duo can help you get there.

Get a Free Trial

Rate This Project