Counting Fluents - LTSA

Counting Fluents Labelled Transition System Analyser

Brought to you by: gregis

Downloads: 0 This Week

Last Update: 2017-06-06

Get an email when there's a new version of Counting Fluents - LTSA

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

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

Report inappropriate content

Recommended Projects

Temporal Inference Engine
A real time inference engine for temporal logical specifications, which is able to acquire, process and generate any binary or real signal through POSIX IPC, files or UNIX sockets. Specifications of signals and dynamic systems are represented as special graphs and executed in real time, with a...
Kluent
Kluent is a "Fluent Assertions" library written specifically for Kotlin. It uses the Infix-Notations and Extension Functions of Kotlin to provide a fluent wrapper around the JUnit-Assertions.
AWS for Fluent Bit Docker Image
The source of the amazon/aws-for-fluent-bit container image. The version of the AWS for Fluent Bit image is not linked to the version of Fluent Bit which it contains. We use the standard major.minor.patch versioning scheme for our image, AKA Semantic Versioning. The initial release with this...
Fluent.js
Fluent.js is a JavaScript implementation of Project Fluent, a localization framework designed to unleash the expressive power of the natural language. Project Fluent keeps simple things simple and makes complex things possible. The syntax used for describing translations is easy to read and...
Yampa
Yampa is a Functional Reactive Programming (FRP) library for Haskell, specifically designed for modeling hybrid systems that involve both continuous and discrete time behaviors, such as games, simulations, robotics, and reactive systems. Based on the concept of signal functions, Yampa offers a...