Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. Kiehn (1988)
On the Interrelation Between Synchronized and Non-Synchronized Behaviour of Petri NetsJ. Inf. Process. Cybern., 24
R. Glabbeek, U. Goltz (1989)
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
M. Nielsen, G. Plotkin, G. Winskel (1981)
Petri Nets, Event Structures and Domains, Part ITheor. Comput. Sci., 13
R Glabbeek, U Goltz (1989)
MFCS 89
Proc REX School / Workshop on Stepwise Refinement of Distributed Systems , 1989
J. Grabowski (1981)
On partial languagesFundam. Informaticae, 4
P. Degano, R. Nicola, U. Montanari (1986)
CCS is an (Augmented) Contact Free C/E System
S. Brookes, C. Hoare, A. Roscoe (1984)
A Theory of Communicating Sequential ProcessesJ. ACM, 31
W Brauer, W Reisig, G Rozenberg (1987)
Petri nets: central models and their properties. Advances in Petri nets 1986, part I
U Goltz (1988)
Proc MFCS 1988, Carlsbad
(1985)
Formal models in programming
(1987)
Concurrency vs
Proc REX School / Workshop on Linear Time , Branching Time and Partial Orders in Logics and Models of Concurrency , Nordwijkerhout , 1988
Raymond Devillers (1992)
Maximality Preserving BisimulationTheor. Comput. Sci., 102
R. Glabbeek (1990)
The Refinement Theorem for ST-bisimulation Semantics
W. Brauer, W. Reisig, G. Rozenberg (1987)
Petri Nets : central models and their properties : proceedings of an advanced course, Bad Honnef, 8.-19. September 1986
W Vogler (1987)
Behaviour preserving refinements of Petri nets
V. Pratt (1982)
On the composition of processes
E. Best, Raymond Devillers (1987)
Sequential and Concurrent Behaviour in Petri Net TheoryTheor. Comput. Sci., 55
R Milner (1980)
A calculus of communicating sequential systems
K. Müller (1985)
Constructable Petri NetsJ. Inf. Process. Cybern., 21
(1990)
Failures semantics based on interval semiwords is a congruence for refinement
(1983)
The behaviour of a Petri net on a subset of transitions
W. Vogler (1991)
Bisimulation and Action RefinementTheor. Comput. Sci., 114
R. Glabbeek, U. Goltz (1990)
Refinement of Actions in Causality Based Models
P. Fishburn (1970)
Intransitive indifference with unequal indifference intervalsJournal of Mathematical Psychology, 7
U. Goltz (1988)
On Representing CCS Programs by Finite Petri Nets
L. Pomello (1985)
Some equivalence notions for concurrent systems. An overview
M. Nielsen, Uffe Engberg, Kim Larsen (1988)
Fully abstract models for a process language with refinement
Raymond Devillers (1988)
On the Definition of a Bisimulation Notion Based on Partial Words, 29
Grzegorz Bancerek, Mitsuru Aoki
Processes in Petri Nets
V. Pratt (1986)
Modeling concurrency with partial ordersInternational Journal of Parallel Programming, 15
P Degano, R Nicola, U Montanari (1987)
Mathematical models for the semantics of parallelism
(1990)
Failures semantics based on interval semiwords is a convergence for refinement
R Glabbeek, F Vaandrager (1987)
PARLE vol II
L Pomello (1986)
Advances in Petri nets 1985
J. Bergstra, J. Klop (1984)
Process Algebra for Synchronous CommunicationInf. Control., 60
(1988)
Partial order semantics for concurrency
I. Suzuki, T. Murata (1983)
A Method for Stepwise Refinement and Abstraction of Petri NetsJ. Comput. Syst. Sci., 27
(1990)
Failures semantics of Petri nets and the refinement of places and transitions
A. Mazurkiewicz (1986)
Trace Theory
U Goltz, W Reisig (1983)
The non-sequential behaviour of Petri netsInf Control, 57
Luca Castellano, G. Michelis, L. Pomello (1987)
Concurrency versus interleaving: an instructuve exampleBull. EATCS, 31
J Grabowski (1981)
On partial languagesAnn Soc Math Pol. Ser IV, Fundam Inf, 2
L. Aceto (1991)
Full Abstraction for Series-Parallel Pomsets
R. Glabbeek, F. Vaandrager (1987)
Petri Net Models for Algebraic Theories of Concurrency
W. Vogler (1988)
Failures semantics and deadlocking of modular Petri netsActa Informatica, 26
L Castellano, G Michelis, L Pomello (1987)
Concurrency vs. interleaving: an instructive exampleBull EATCS, 31
W Vogler (1990)
STACS 90
L. Aceto, M. Hennessy (1989)
Towards action-refinement in process algebras[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
D. Taubner (1989)
Finite Representations of CCS and TCSP Programs by Automata and Petri Nets, 369
R. Valette (1979)
Analysis of Petri Nets by Stepwise RefinementsJ. Comput. Syst. Sci., 18
W. Brauer, W. Reisig, G. Rozenberg (1986)
Petri Nets: Applications and Relationships to Other Models of Concurrency, 255
W. Brauer, W. Reisig, G. Rozenberg (1986)
Petri Nets: Central Models and Their Properties, 254
J. Meseguer, U. Montanari, V. Sassone (1992)
On the Semantics of Petri Nets
In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with respect to refinement. It is shown that in this context partial orders are necessary for the description of system runs: what is needed here are so-called interval orders.
Distributed Computing – Springer Journals
Published: May 11, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.