A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A generalized event structure for the Muller unfolding of a safe net
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
Our main result is that the domain of configurations of this generalized event structure is isomorphic to the Muller unfolding of the net. ...
We find, however, that this "Muller unfolding" cannot be generated as the domain of configurations of any known event structure, not even a General Event structure. ...
We find, however, that this "Muller unfolding" cannot be generated as the domain of configurations of any known event structure, not even a General Event structure. ...
doi:10.1007/3-540-57208-2_20
fatcat:c2sv3rol6ff4pnnc56fzlgklbe
Page 5995 of Mathematical Reviews Vol. , Issue 94j
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
{For the entire collection see MR 94f:68004.}
94j:68227 68Q90 68Q10 Gunawardena, Jeremy (1-STF-C; Stanford, CA) A generalized event structure for the Muller unfolding of a safe net. ...
We find, however, that this ‘Muller unfolding’ cannot be generated as the domain of configurations of any known event structure, not even a general event structure. ...
Model checking using net unfoldings
1994
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The new algorithm is shown to be polynomial in the size of the net for i-safe conflict-free Petri nets, while the algorithms of the literature require exponential time. ' A shortened version of this paper ...
McMillan ( 1992) described a technique for deadlock detection based on net unfoldings. We extend its applicability to the properties of a temporal logic with a possibility operator. ...
Acknowledgments Very special thanks to Thomas Thielke, who read the paper very carefully and corrected many mistakes. ...
doi:10.1016/0167-6423(94)00019-0
fatcat:jj2c5mn2erekpnmbqdkzsx6avq
Page 4093 of Mathematical Reviews Vol. , Issue 94g
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(262-277); Jeremy Gunawar- dena, A generalized event structure for the Muller unfolding of a safe net (278-292); Eric Goubault, Domains of higher-dimensional automata (293-307); J. ...
Thiagarajan, Local event structures and Petri nets (462-476); J. C. M. Baeten and C. ...
1-Safe Petri nets and special cube complexes: equivalence and applications
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the current paper, we prove the converse: to any finite 1-safe Petri net N one can associate a finite special cube complex X_N such that the domain of the event structure E_N (obtained as the unfolding ...
Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net N unfolds into an event structure E_N. ...
ACKNOWLEDGMENTS The authors would also like to thank the anonymous referees for their valuable comments and helpful suggestions for improving readability. ...
arXiv:1810.03395v2
fatcat:xpydd3ir4jc23pn2qicojuildu
A Synthesisable Quasi-Delay Insensitive Result Forwarding Unit for an Asynchronous Processor
2009
2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents the description of a synthesisable result forwarding unit for an asynchronous microprocessor, using the syntax-directed synthesis approach and targeting a robust quasi-delay-insensitive ...
The implementation of an efficient result forwarding unit for asynchronous processors faces the problem of the inherent lack of synchronisation between result producer and consumer units. ...
Balsa does not provide a way to describe a CAM and generate an efficient circuit structure. ...
doi:10.1109/dsd.2009.163
dblp:conf/dsd/TarazonaEP09
fatcat:oskuicnsi5ctfexsdq7q64oqry
Processes and unfoldings: concurrent computations in adhesive categories
2014
Mathematical Structures in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
As a consequence more abstract definitions of processes and unfoldings are called for, which, unlike the previous proposals, do not assume any knowledge about the internal structure of the objects that ...
We generalise both the notion of non-sequential process and the unfolding construction (previously developed for concrete formalisms such as Petri nets and graph grammars) to the abstract setting of (single ...
-An analogue of occurrence nets: The processes and the unfolding of a Petri net are a special kind of nets, called occurrence nets; similarly, the processes and the structure produced by the unfolding ...
doi:10.1017/s096012951200031x
fatcat:umx7pscecfep7aozlehi72dsny
Synergies among Testing, Verification, and Repair for Concurrent Programs (Dagstuhl Seminar 16201)
2016
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of Dagstuhl Seminar 16201 "Synergies among Testing, Verification, and Repair for Concurrent Programs". ...
Actor services can specify how parts of a program respond to messages, both in terms of guaranteed future messages, and relations between the program states in which messages are received and responses ...
We present actor services [1] : a novel program logic for defining and verifying response and functional properties of programs which communicate via asynchronous messaging. ...
doi:10.4230/dagrep.6.5.56
dblp:journals/dagstuhl-reports/DolbyGMT16
fatcat:3ou6mdvytrfnfhjf542sbpn6lm
The Use of the Clinical Ethnographic Narrative Interview to Understand and Support Help Seeking After Gender-Based Violence
2017
TPM - Testing, Psychometrics, Methodology in Applied Psychology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Then we provide support for the use of the CENI for an understanding of the help seeking process and facilitating a health-promoting narrative interview for survivors. ...
Based on theories about benefits and challenges of the narrative after GBV and trauma, we propose that the Clinical Ethnographic Narrative Interview (CENI) allows researchers and practitioners a safe container ...
of the brain for storage and conscious processing (Koch, Fuchs, Summa, & Müller, 2012) . ...
doi:10.4473/tpm24.3.8
pmid:29098071
pmcid:PMC5663235
fatcat:6pjmqssbrvevfaoapqvpvplhee
Protein folding and quality control in the endoplasmic reticulum: Recent lessons from yeast and mammalian cell systems
2011
Current Opinion in Cell Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The evolution of eukaryotes was accompanied by an increased need for intracellular communication and cellular specialization. ...
A means to modify ER function to accommodate and destroy misfolded proteins also evolved. Not surprisingly, a growing number of human diseases are linked to various facets of ER function. ...
Acknowledgments The authors acknowledge support from grants from the National Institutes of Health (GM75061 and DK79307, "The Pittsburgh Center for Kidney Research", to J.L.B, and GM53457 and DK51818 to ...
doi:10.1016/j.ceb.2011.05.004
pmid:21664808
pmcid:PMC3154734
fatcat:bd4eck36ofhljkgutxbkp57444
Structure-Based Deadlock Checking of Asynchronous Circuits
2011
Journal of Computer Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Much previous work relies on a reachability analysis of the circuits' states, with the use of binary decision diagrams (BDDs) or Petri nets to model the behaviors of circuits. ...
The sufficient and necessary conditions for a component network consisting of Steer, Merge, Fork and Join are given. The slack elasticity of the channels is analyzed in order to introduce pipelining. ...
However, a complete characterization of structural liveness for a general Petri net is unknown [9] . In this paper, we focus on the structural aspects of asynchronous circuits. ...
doi:10.1007/s11390-011-1199-3
fatcat:x2qz7daamnbkfdnxh72vofuria
Designing an asynchronous processor using Petri nets
1997
IEEE Micro
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We describe a technique for the design and analysis of a simple asynchronous microprocessor from a Labelled Petri Net speci cation. ...
The Petri net based approach allows an interplay of di erent formal tasks, such as synthesis, veri cation and performance evaluation, to be carried out within the single modelling framework. ...
A 1-bounded PN is called a safe PN. The following properties are useful for checking the behavioural correctness of nets specifying asynchronous circuits. ...
doi:10.1109/40.592316
fatcat:v3pgz6ensnhx7hvnbrobflauj4
Verification of asynchronous circuits by BDD-based model checking of Petri nets
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper presents a methodology for the veri cation of speed-independent asynchronous circuits against a Petri net speci cation. ...
Algorithms for verifying the correctness of designs, as well as several circuit properties are proposed. ...
The same formalism (Petri nets) used for several automatic synthesis tools, is also used for veri cation, thus allowing to check the correctness of synthesis techniques. ...
doi:10.1007/3-540-60029-9_50
fatcat:yfh2tnovrzhcviy3ubcpgbrtoy
Hierarchical Optimization of Asynchronous Circuits
1995
Proceedings - Design Automation Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the complete set can be captured by a single trace structure using the notion of a "maximal trace structure". ...
Specifically, we consider how one can find the set of implementations that can be "correctly substituted" for a component in the system while preserving the behavior of the total system. ...
Semantically, for a canonical trace structure representing a circuit, F captures the input events under which the behavior of the circuit is not defined. ...
doi:10.1109/dac.1995.250057
fatcat:pcelllaekrgjtiamki4iic35dm
Hierarchical optimization of asynchronous circuits
1995
Proceedings of the 32nd ACM/IEEE conference on Design automation conference - DAC '95
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the complete set can be captured by a single trace structure using the notion of a "maximal trace structure". ...
Specifically, we consider how one can find the set of implementations that can be "correctly substituted" for a component in the system while preserving the behavior of the total system. ...
Semantically, for a canonical trace structure representing a circuit, F captures the input events under which the behavior of the circuit is not defined. ...
doi:10.1145/217474.217616
dblp:conf/dac/LinJK95
fatcat:3nwrmymcdvaydf6wuex4afrcxm
« Previous
Showing results 1 — 15 out of 1,888 results