DocumentCode :
1121381
Title :
Toward Formal-Methods Oecumenism?
Author :
Kordon, Fabrice ; Petrucci, Laure
Author_Institution :
Univ. Paris 13
Volume :
7
Issue :
7
fYear :
2006
fDate :
7/1/2006 12:00:00 AM
Firstpage :
2
Lastpage :
2
Abstract :
Model checking is rather poor when properties deal not with causality of events but with data types or recursive constructs. In that area, algebraic methods, even if they´re more complex to grasp, are much more appropriate and efficient. And it´s true that, with Petri nets, you can do both model checking and a sort of parameterized analysis. But, if model checking remains as efficient as what you can get from a Promela program, the model itself only offers basic constructs to handle parallelism. This is also true with parameterized proofs using Petri net invariants
Keywords :
Petri nets; formal specification; formal verification; Petri nets; Promela program; algebraic method; formal method; model checking; parameterized analysis; Animation; Art; Computer languages; Functional programming; Layout; Mathematical model; Mathematics; Petri nets; State-space methods; Testing; formal methods; software engineering;
fLanguage :
English
Journal_Title :
Distributed Systems Online, IEEE
Publisher :
ieee
ISSN :
1541-4922
Type :
jour
DOI :
10.1109/MDSO.2006.47
Filename :
1673350
Link To Document :
بازگشت