Transition systems without transitions (Q557786): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.tcs.2004.09.026 / rank | |||
Property / cites work | |||
Property / cites work: An algebraic model of observable properties in distributed systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial (set) 2-structures. I: Basic notions and the representation problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partial (set) 2-structures. II: State spaces of concurrent systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary transition systems / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.TCS.2004.09.026 / rank | |||
Normal rank |
Latest revision as of 22:27, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transition systems without transitions |
scientific article |
Statements
Transition systems without transitions (English)
0 references
30 June 2005
0 references
The concept of Partial 2-Structures (P2Ss) as an abstract form of directed graph with labeled edges was introduced by A. Ehrenfeucht and G. Rozenberg. The problem of embedding P2Ss into set 2-structures is studied in the paper. An alternative (to Ehrenfeucht and Rozenberg's approach) representation of P2Ss that are complete graphs is proposed. The results are applicable to some types of Petri nets. Reviewer's remark: It is interesting whether temporal components can be added to the studied P2Ss.
0 references
2-Structure
0 references
Transition system
0 references
Elementary net
0 references
Concurrency theory
0 references