Propositional description of finite cause-effect structures. (English) Zbl 0658.68032
Cause-effect structures introduced by L. Czaja [Inf. Process. Lett. 26, 313-319 (1988; Zbl 0642.68108)] can be regarded as a model (similar to condition-event Petri nets) of discrete dynamic systems. This paper provides a semantics for cause effect structures in terms of classical propositional calculus, and investigates a possibility of using propositional temporal logic.
Reviewer: R.Janicki
MSC:
68Q65 | Abstract data types; algebraic specification |
68Q85 | Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) |
Citations:
Zbl 0642.68108References:
[1] | Czaja, L., Cause-effect structures, Inform. Process. Lett., 26, 6, 313-319 (1987/88) · Zbl 0642.68108 |
[2] | Muldner, T.; Salwicki, A., On algorithmic properties of concurrent programs, Lecture Notes in Computer Science, Vol. 125 (1979), Springer: Springer Berlin, Proc. Seminar on Algorithmic Logic · Zbl 0361.68021 |
[3] | Salwicki, A., Critical remarks on MAX model of concurrency, (Logics of Programs, Vol. 131 (1981), Springer: Springer Berlin), 397-405, Lecture Notes in Computer Science · Zbl 0481.68013 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.