Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Contextual nets

Published: 01 June 1995 Publication History

Abstract

We propose a new kind of nets, called contextual nets, where events may have both preconditions and postconditions, as in the classical case, and also positive or negative context conditions. Positive context conditions are to be interpreted as elements which are needed for the event to occur, but which are not affected by the occurring of the event. Instead, negative context conditions are elements which must not be present for the event to take place.
The importance of an explicit representation of positive context elements is twofold. Firstly, it allows a faithful representation of systems where the notion of "reading without consuming" is commonly used, like database systems, concurrent constraint programming, or any computation framework based on shared memory. Secondly, it allows to specify directly and naturally a level of concurrency greater than in classical nets. In fact, two events with different preconditions but with the same positive context may occur both in any order and also simultaneously. It is important to note that no other formalism for specifying distributed systems has such feature, not even Petri nets, where the "read" operation does not exists and it is instead modelled through a "rewrite" operation (i.e., a loop), which however does not allow the simultaneous execution of two tasks which read the same resource. Of course a context situation may be simulated in classical nets by creating as many copies of the context as are the users, but this would lead to a very unrealistic (and also more costly) description of the real situation. Negative context conditions are instead very natural to use in systems or languages where negation is present.
In this paper we provide contextual nets with two process-based semantics which both are able to represent all and only the computations of a net and express the correct level of true-concurrency. Moreover, we show that contact situations, as well as negative context conditions, do not add any additional power, and we investigate the relationship between contextual nets and classical nets in terms of their processes.

References

[1]
H. Ehrig: Tutorial introduction to the algebraic theory of graph grammars. In Proc. 3rd International Workshop on Graph Grammars. Springer Verlag, LNCS 291, 1987.
[2]
N. De Francesco, U. Montanari, G. Ristori: Modelling serializability via process equivalence in Petri nets. Technical Report HPL-92-89, HP Laboratories, 1992.
[3]
N. De Francesco, U. Montanari, G. Ristori: Modelling concurrent accesses to shared data via petri nets. In Proc. of the IFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET'94), 1994.
[4]
R. Janicki, M. Koutny: Invariant semantics of nets with inhibitor arcs. In Proc. CONCUR. Springer-Verlag, LNCS 527, 1991.
[5]
R. Janicki, M. Koutny: Structure of concurrency. Theoretical Computer Science, 112:5-52, 1993.
[6]
J. W. Lloyd: Foundations of Logic Programming. Springer Verlag, 1987.
[7]
T. Agerwala, M. Flynn: Comments on capabilities, limitations and "correctness" of petri nets. Computer Architecture News, 2(4), 1973.
[8]
U. Montanari, F. Rossi: True concurrency in concurrent constraint programming. In Proc. ILPS91. MIT Press, 1991.
[9]
U. Montanari, F. Rossi: Graph grammars as context-dependent rewriting systems. In Proc. CAAP92. Springer-Verlag, LNCS, 1992.
[10]
U. Montanari, F. Rossi: Graph rewriting for a partial ordering semantics of concurrent constraint programming. Theoretical Computer Science, 1992. special issue on graph grammars, Courcelle B. and Rozenberg eds.
[11]
U. Montanari, F. Rossi: Contextual occurrence nets and concurrent constraint programming. In Proc. Dagstuhl Seminar on Graph Transformations in Computer Science. Springer-Verlag, LNCS, 1993.
[12]
J.L. Peterson: Petri Nets and the Modelling of Systems. Prentice Hall, 1981.
[13]
W. Reisig: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer Verlag, 1985.
[14]
G. Ristori: Modelling Systems with Shared Resources via Petri Nets. PhD thesis, University of Pisa, TD-5/94, 1994.
[15]
V.A. Saraswat: Concurrent Constraint Programming. MIT Press, 1993.
[16]
G. Winskel: Event structures. In Petri nets: applications and relationships to other models of concurrency. Springer-Verlag, LNCS 255, 1986.

Cited By

View all
  • (2024)A Reversible Perspective on Petri Nets and Event StructuresACM Transactions on Computational Logic10.1145/368615425:4(1-38)Online publication date: 23-Oct-2024
  • (2023)Relating Reversible Petri Nets and Reversible Event Structures, CategoricallyFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-35355-0_13(206-223)Online publication date: 19-Jun-2023
  • (2023)Interval Traces with Mutex RelationApplication and Theory of Petri Nets and Concurrency10.1007/978-3-031-33620-1_8(145-166)Online publication date: 25-Jun-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Acta Informatica
Acta Informatica  Volume 32, Issue 6
June 1995
100 pages

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 June 1995

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A Reversible Perspective on Petri Nets and Event StructuresACM Transactions on Computational Logic10.1145/368615425:4(1-38)Online publication date: 23-Oct-2024
  • (2023)Relating Reversible Petri Nets and Reversible Event Structures, CategoricallyFormal Techniques for Distributed Objects, Components, and Systems10.1007/978-3-031-35355-0_13(206-223)Online publication date: 19-Jun-2023
  • (2023)Interval Traces with Mutex RelationApplication and Theory of Petri Nets and Concurrency10.1007/978-3-031-33620-1_8(145-166)Online publication date: 25-Jun-2023
  • (2022)A Petri net view of covalent bondsTheoretical Computer Science10.1016/j.tcs.2022.01.013908:C(89-119)Online publication date: 24-Mar-2022
  • (2022)Pomset bisimulation and unfolding for reset Petri netsInformation and Computation10.1016/j.ic.2020.104674283:COnline publication date: 1-Feb-2022
  • (2021)A distributed operational view of reversible prime event structuresProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470623(1-13)Online publication date: 29-Jun-2021
  • (2021)On the parameterized complexity of the synthesis of Boolean nets with restricted place environmentsTheoretical Computer Science10.1016/j.tcs.2021.08.014890:C(36-69)Online publication date: 12-Oct-2021
  • (2020)Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter AlgorithmTheoretical Aspects of Computing – ICTAC 202010.1007/978-3-030-64276-1_8(143-160)Online publication date: 30-Nov-2020
  • (2020)The Complexity of Boolean State SeparationTheoretical Aspects of Computing – ICTAC 202010.1007/978-3-030-64276-1_7(123-142)Online publication date: 30-Nov-2020
  • (2020)Efficient Restrictions of Immediate Observation Petri NetsReachability Problems10.1007/978-3-030-61739-4_7(99-114)Online publication date: 19-Oct-2020
  • Show More Cited By

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media