We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e. in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets. Abstract We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e. in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets. Abstract. We consider a class of Petri nets suitable for the modelling and behavioural analysis of globally asynchronous locally synchronous (GALS) systems. The proposed model of PTL-nets is basically that of Place/Transition-nets (PT-nets) equipped with an explicit notion of locality. Each locality identifies a distinct set of transitions which may only be executed synchronously, i.e., in a maximally concurrent manner. We investigate how to capture the non-sequential semantics of PTL-nets using techniques similar to those used in the standard treatment of PT-nets. As a result, we postulate that processes based on occurrence nets augmented with additional information about localities and enabledness of non-fired transitions can provide a satisfactory basis for a causality semantics of PTL-nets.
[1]
Jirí Srba,et al.
Properties of Distributed Timed-Arc Petri Nets
,
2001,
FSTTCS.
[2]
Wolfgang Reisig,et al.
The Non-sequential Behavior of Petri Nets
,
1983,
Inf. Control..
[3]
Maciej Koutny,et al.
Using Optimal Simulations to Reduce Reachability Graphs
,
1990,
CAV.
[4]
Maciej Koutny,et al.
Concurrent and Maximally Concurrent Evolution of Nonsequential Systems
,
1986,
Theor. Comput. Sci..
[5]
Eike Best,et al.
Nonsequential Processes
,
1988,
EATCS Monographs on Theoretical Computer Science.
[6]
Maciej Koutny,et al.
Towards a Petri Net Semantics for Membrane Systems
,
2005,
Workshop on Membrane Computing.
[7]
Maciej Koutny,et al.
Process semantics of general inhibitor nets
,
2004,
Inf. Comput..
[8]
Wolfgang Reisig,et al.
Lectures on Petri Nets I: Basic Models
,
1996,
Lecture Notes in Computer Science.
[9]
Wolfgang Reisig,et al.
Hazard detection in a GALS wrapper: a case study
,
2005,
Fifth International Conference on Application of Concurrency to System Design (ACSD'05).
[10]
Gheorghe Paun,et al.
A guide to membrane computing
,
2002,
Theor. Comput. Sci..
[11]
Joost Engelfriet,et al.
Elementary Net Systems
,
1996,
Applications and Theory of Petri Nets.
[12]
Raymond R. Devillers,et al.
Sequential and Concurrent Behaviour in Petri Net Theory
,
1987,
Theor. Comput. Sci..
[13]
Walter Vogler,et al.
An Improvement of McMillan's Unfolding Algorithm
,
1996,
Formal Methods Syst. Des..
[14]
Eike Best,et al.
Nonsequential Processes: A Petri Net View
,
1988
.
[15]
Maciej Koutny,et al.
Infinite Process Semantics of Inhibitor Nets
,
2006,
ICATPN.
[16]
Gheorghe Paun,et al.
Membrane Computing
,
2002,
Natural Computing Series.