Information and Computation 171, 1–49 (2001)īaldan, P., Busi, N., Corradini, A., Pinna, G.M.: Domain and event structure semantics for Petri nets with read and inhibitor arcs. ![]() Information and Computation 114, 247–314 (1994)īaldan, P., Corradini, A., Montanari, U.: Contextual Petri nets, asymmetric event structures and processes. Springer, Heidelberg (1990)īoudol, G., Castellani, I.: Flow models of distributed computations: Three equivalent semantics for CCS. Theoretical Computer Science 138, 425–454 (1995)īoudol, G.: Flow Event Structures and Flow Nets. ![]() Pinna, G.M., Poigné, A.: On the nature of events: another perspective in concurrency. Van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets. Khomenko, V., Kondratyev, A., Koutny, M., Vogler, W.: Merged Processes: a new condensed representation of Petri net behaviour. Formal Methods in System Design 6, 45–65 (1995)įabre, E.: Trellis processes: A compact representation for runs of concurrent systems. McMillan, K.: A Technique of State Space Search Based on Unfolding. Springer, Heidelberg (1987)Įngelfriet, J.: Branching processes of Petri nets. In: Brauer, W., Reisig, W., Rozenberg, G. Discrete Event Dynamic Systems 15, 33–84 (2005) PhD thesis, School of Computing Science, University of Newcastle upon Tyne (2003)įabre, E., Benveniste, A., Haar, S., Jard, C.: Distributed Monitoring of Concurrent and Asynchronous Systems. Khomenko, V.: Model Checking based on Prefixes of Petri Net Unfoldings. This process is experimental and the keywords may be updated as the learning algorithm improves. These keywords were added by machine and not by the authors. Furthermore, this unfolding gives also a more compact representation of the executions of a multi-clock net, similarly to what approaches like trellises or merged processes do. In this paper we introduce an unfolding, called flow unfolding, that turns out to be related to flow event structures, hence dependencies and conflict are still represented. in trellises or merged processes of multi-clock nets. This relation is somehow lost if more compact representations of the executions of nets are considered, e.g. ![]() This allows for a clear characterization of dependencies and the conflicts between occurrences of transitions in the net. Unfoldings of nets are often related to event structures: each execution of a net can be viewed as a configuration in the associated event structure.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |