cpet/freebsd-ports
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix a typo.

Browse Source
This commit is contained in:
Jimmy Olgeni 2003-12-13 11:18:16 +00:00
parent 38e778d4e5
commit 56d4dbd224
Notes: svn2git 2021-03-31 03:12:20 +00:00 
svn path=/head/; revision=95717
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
devel/smv/pkg-descr
View File

@ -4,7 +4,7 @@ in the temporal logic CTL (Computational Tree Logic).
One specifies the finite state system (finite automaton, One specifies the finite state system (finite automaton,
Mealy machine, full adder circuit, ..) as a Kripke Mealy machine, full adder circuit, ..) as a Kripke
structure in the SMV language and provides specificaations structure in the SMV language and provides specifications
in CTL. The model checking algorithm allows to determine in CTL. The model checking algorithm allows to determine
if the Kripke structure fulfills the specifications. if the Kripke structure fulfills the specifications.