Concurrent bisimulations in Petri nets
Acta Informatica
Information and Computation
Partial order and contextual net semantics for atomic and locally atomic CC programs
Science of Computer Programming - Special issue on concurrent constraint programming
Processes of contextual nets and their characteristics
Fundamenta Informaticae
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Partial Order Semantics and Read Arcs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Efficiency of Asynchronous Systems and Read Arcs in Petri Nets
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Petri Net Semantics for pi-Calculus
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Modelling Concurrent Accesses to Shared Data via Petri Nets
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Partial orderings descriptions and observations of nondeterministic concurrent processes
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Causality for Mobile Processes
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
PETRI NET LANGUAGE
Complete Process Semantics of Petri Nets
Fundamenta Informaticae
| Hi-index | 0.00 |
The paper is centered around the study and comparison of truly concurrent semantics for P/T nets with inhibitor and read arcs (called henceforth contextual P/T nets). We start proposing a causal semantics for P/T nets, that we prove to be equivalent to history preserving bisimulation defined on nonsequential processes. Then we develop a conservative extension of the causal semantics to contextual P/T nets and we prove this one to be finer than step semantics. Finally, a comparison of causal semantics with the process based semantics for contextual P/T systems proposed in \cite{buspin99} is carried out.