A generalized event structure for the Muller unfolding of a safe net

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 715 LNCS, Issue , 1993, Pages 278-292

  Gunawardena, Jeremy ^a,b  

^a STANFORD UNIVERSITY   (United States)

^b Hewlett Packard’s Stanford Science Centre ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS;

ASYNCHRONOUS CIRCUITS; CAUSAL LOGIC; EVENT STRUCTURES; LOGICAL APPROACHES; NIELSEN; NOVEL TECHNIQUES;

COMPUTER CIRCUITS;

EID: 26844509207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57208-2_20     Document Type: Conference Paper

References (16)

1. J. A. Brzozowski and C.-J. H. Seger. Advances in Asynchronous Circuit Theory Part I: gate and unbounded inertial delay models. Bulletin of the EATCS, 42:198-249, 1990.
2. M. Droste. Event structures and domains. Theoretical Computer Science, 68:37-47, 1989.
3. J. Gunawardena. Events, Causality and Logic. In preparation.
4. J. Gunawardena. Geometric logic, causality and event structures. In J. C. M. Baeten and J. F. Groote, editors, CONCUR’91 — 2nd International Conference on Concurrency Theory, pages 266-280. Springer LNCS 527, 1991.
5. J. Gunawardena. Causal Automata. Theoretical Computer Science, 101:265-288, 1992.
6. J. Gunawardena. On the causal structure of the Muller unfolding. Technical Report STAN-CS-93-1466, Department of Computer Science, Stanford University, March 1993.
7. P. T. Johnstone. Stone Spaces, volume 3 of Studies in Advanced Mathematics. Cambridge University Press, 1982
8. L. H. Landweber and E. L. Robertson. Properties of Conflict-Free and Persistent Petri Nets. Journal ACM, 25(3):352-364, 1978.
9. D. E. Muller and W. S. Bartky. A theory of asynchronous circuits. In Proceedings of an International Symposium on the Theory of Switching. Harvard University Press, 1959.
10. M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, event structures and domains. Theoretical Computer Science, 13:85-108, 1981.
11. R. J. Parikh. On context-free languages. Journal ACM, 13(4):570-581, 1966.
12. W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.
13. S. Vickers. Topology via Logic, volume 5 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.
14. G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets. Springer LNCS 255, 1987.
15. A. Yakovlev. Analysing Concurrent Systems through Lattices. Draft, 1991.
16. A. Yakovlev, L. Lavagno, and A. Sangiovanni-Vincentelli. A Unified Signal Transition Graph Model for Asynchronous Control Circuit Synthesis. In Proceedings ICCAD’92, 1992.