Infinite Process Semantics of Inhibitor Nets
暂无分享,去创建一个
[1] Maciej Koutny,et al. Fundamentals of modelling concurrency using discrete relational structures , 1997, Acta Informatica.
[2] Jonathan Billington,et al. Protocol Specification Using P-Graphs, a Technique Based on Coloured Petri Nets , 1996, Petri Nets.
[3] Maciej Koutny,et al. Order Structures and Generalisations of Szpilrajn's Theorem , 1993, FSTTCS.
[4] Victor Khomenko,et al. Parallel LTL-X Model Checking of High-Level Petri Nets Based on Unfoldings , 2004, CAV.
[5] Maciej Koutny,et al. Process semantics of general inhibitor nets , 2004, Inf. Comput..
[6] G. Michele Pinna,et al. Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs , 1999, Fundam. Informaticae.
[7] Joost Engelfriet,et al. Elementary Net Systems , 1996, Applications and Theory of Petri Nets.
[8] Raymond R. Devillers,et al. Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..
[9] Joost Engelfriet,et al. Branching processes of Petri nets , 1991, Acta Informatica.
[10] Hartmut Ehrig,et al. Unifying Petri Nets , 2001, Lecture Notes in Computer Science.
[11] Wolfgang Reisig,et al. Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.
[12] Kenneth L. McMillan,et al. A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..
[13] Maciej Koutny,et al. Semantics of Inhibitor Nets , 1995, Inf. Comput..
[14] Giuliana Franceschinis,et al. Modelling and Analysis of Distributed Software Using GSPNs , 1996, Petri Nets.
[15] Walter Vogler,et al. Partial order semantics and read arcs , 1997, Theor. Comput. Sci..