Using flat concurrent Prolog in system modeling

The flat concurrent Prolog (FCP) language, which enables the implementation of synchronization through data flow, communication through shared variables, parallelism through the reduction of the AND components in the clause's body, and indeterminacy through guarded commands, is discussed. It is...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on software engineering Ročník 17; číslo 6; s. 493 - 512
Hlavní autoři: Dotan, Y., Arazi, B.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.06.1991
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Témata:
Applied sciences
Communication
Computer programming
Computer science; control theory; systems
Concurrent computing
Data structures
Dynamic programming
Exact sciences and technology
Flexible manufacturing systems
Implementations
Logic programming
Modeling
Parallel processing
Petri nets
Phase detection
Programming languages
Software
Software engineering
Techniques
Timing
Variables
PROLOG
Hierarchical system
Software development
Parallel system
Modeling
Petri net
ISSN:0098-5589, 1939-3520
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The flat concurrent Prolog (FCP) language, which enables the implementation of synchronization through data flow, communication through shared variables, parallelism through the reduction of the AND components in the clause's body, and indeterminacy through guarded commands, is discussed. It is shown that FCP, used in conjunction with Petri net methods, forms a powerful tool in the modeling of parallel systems that involve concurrency. The simulation of systems represented by various types of Petri nets is achieved using the reduction process of FCP. AND parallelism supports free competition among conflicting enabled transitions. A structural analysis of systems is provided using the metaprogramming technique.< >
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.87277