An algebraic and algorithmic method for analysing transition systems (Q1822237)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algebraic and algorithmic method for analysing transition systems |
scientific article; zbMATH DE number 4001472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algebraic and algorithmic method for analysing transition systems |
scientific article; zbMATH DE number 4001472 |
Statements
An algebraic and algorithmic method for analysing transition systems (English)
0 references
1986
0 references
To describe significant properties of concurrent processes a formal algebra is defined whose terms are interpreted, in transition systems, as effectively computable functions of power algebras of sets of states and transitions. We study the expressive power of this formal system and compare it with temporal logics.
0 references
mu-calculus
0 references
concurrent processes
0 references
transition systems
0 references
effectively computable functions
0 references
power algebras
0 references
expressive power
0 references
temporal logics
0 references
0.808103621006012
0 references
0.7917739152908325
0 references
0.7683210372924805
0 references
