2,566 Hits in 6.6 sec

Compositional semantics for open Petri nets based on deterministic processes

2005 Mathematical Structures in Computer Science  
Besides generalising the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisig process semantics of Petri nets.  ...  The deterministic process semantics is shown to be compositional with respect to such a composition operation.  ...  We are also indebt to Julia Padberg for pointing out that the characterisation of the pushout construction for open nets requires the morphisms in the span to be embeddings, which is on hypothesis that  ... 
doi:10.1017/s0960129504004311 fatcat:vno56r6lifgp3ixl6qbm3idene

Concurrency for Graph Grammars in a Petri net shell

P Baldan
2004 Electronical Notes in Theoretical Computer Science  
Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel's style unfolding construction, and we show that the two  ...  A basic role is played by the study of contextual and inhibitor nets, two extensions of ordinary nets which can be seen as intermediate models between graph grammars and ordinary Petri nets.  ...  The approach that we propose as a paradigm, comprises the semantics based on deterministic processes, whose origin dates back to an early proposal by Petri himself [36] and the semantics based on the  ... 
doi:10.1016/s1571-0661(04)00192-6 fatcat:wrvdeitwenf43ltcatn5oqkp2q

Compositional Modeling of Reactive Systems Using Open Nets [chapter]

P. Baldan, A. Corradini, H. Ehrig, R. Heckel
2001 Lecture Notes in Computer Science  
Besides generalizing the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisig process semantics of Petri nets.  ...  The process semantics is shown to be compositional with respect to such composition operation.  ...  We are grateful to Ugo Montanari for his insightful suggestions and to the anonymous referees for their helpful comments.  ... 
doi:10.1007/3-540-44685-0_34 fatcat:3zowc6cbtbeqtf6uc3y4l6irki

Pre-nets, Read Arcs and Unfolding: A Functorial Presentation [chapter]

Paolo Baldan, Roberto Bruni, Ugo Montanari
2003 Lecture Notes in Computer Science  
Here we develop a functorial semantics for pre-nets following a sibling classical approach based on an unfolding construction.  ...  Pre-nets have been recently proposed as a means of providing a functorial algebraic semantics to Petri nets (possibly with read arcs), overcoming some previously unsolved subtleties of the classical model  ...  The proof relies on the introduction of a concrete notion of process for prenets, and on a characterisation of the algebraic semantics in terms such processes.  ... 
doi:10.1007/978-3-540-40020-2_8 fatcat:rg7lnbd5v5acjdaygfm5cmmy2q

Concurrent Computing: from Petri Nets to Graph Grammars

Andrea Corradini
1995 Electronical Notes in Theoretical Computer Science  
Petri nets are widely accepted as a speci cation formalism for concurrent and distributed systems.  ...  One of the reasons of their success is the fact that they are equipped with a rich theory, including well-understood concurrent semantics they also provide an interesting benchmark for tools and techniques  ...  There are many computation-based semantics for Petri nets. They di er for the amount of information one wants to record in the semantics, and for the way it is recorded.  ... 
doi:10.1016/s1571-0661(05)80181-1 fatcat:dr5n3rqfrfcltoja5eyquch5vu

Encoding Asynchronous Interactions Using Open Petri Nets [chapter]

Paolo Baldan, Filippo Bonchi, Fabio Gadducci
2009 Lecture Notes in Computer Science  
We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open places.  ...  The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment.  ...  We are grateful to Barbara König for enlightening discussions on a preliminary version of this paper and to the anonymous reviewers for their inspiring comments.  ... 
doi:10.1007/978-3-642-04081-8_8 fatcat:d5fbbkhypjaitmjb6bk4os63ty

A Survey on Workflow Verifications of Petri Nets based Service Process Management

Xiaoxian Yang, Tao Yu, Huahu Xu
2012 International Journal of Grid and Distributed Computing  
Therefore, it summarizes Petri Nets based workflow verification techniques to guarantee the quality of services composition.  ...  Then, considering the composite service is an effective way to organize third-party business functions seamlessly, the Petri Nets based service workflow employed to formalizing composition behaviors is  ...  Nets, Stochastic Petri Nets, Deterministic Time Petri Nets and Hierarchical Petri Nets.  ... 
doi:10.14257/ijgdc.2015.8.6.09 fatcat:4oqtgzjla5azxhnerdv6oz7tq4


2004 Current Trends in Theoretical Computer Science  
In particular, we shall focus on Petri net concatenable processes [24, 86], on strongly concatenable processes [87, 16] , and on their representation in terms of symmetric monoidal categories.  ...  This paper retraces, collects, and summarises the contributions of the author -both individually and in collaboration with others -on the theme of algebraic, compositional approaches to the semantics of  ...  Priese on many parts of this work.  ... 
doi:10.1142/9789812562494_0057 fatcat:3mrgfeyyineyzawqflupd5lwnm

From OWL-S Descriptions to Petri Nets [chapter]

Antonio Brogi, Sara Corfini, Stefano Iardella
2009 Lecture Notes in Computer Science  
In this paper we present a translator from OWL-S descriptions to Petri nets which makes such analyses possible thanks to the many tools available for Petri nets. ⋆  ...  The Petri Net Mark-up Language (PNML, [7] ) is an XML-based interchange format for describing Petri nets.  ...  OWL-S: Semantic Markup for Web Services OWL-S [3] is an ontology-based language for semantically describing services.  ... 
doi:10.1007/978-3-540-93851-4_41 fatcat:db7qdk34y5bcxdlbehhug2wc3m

Semantic Web: A Study on Web Service Composition Approaches

Michael Raj, TF, Siva Prakasam. P
2017 International Journal of Trend in Scientific Research and Development  
This study reveals the existing approaches used for web service composition in both syntactic and semantic environments.  ...  A Web service is a collection of open protocols and standards used for exchanging data between applications and systems.  ...  Petri Net based approach, which focuses on the reliability calculation method.  ... 
doi:10.31142/ijtsrd115 fatcat:357roz3n7bd6nikieush6glbsy

Modular encoding of synchronous and asynchronous interactions using open Petri nets

Paolo Baldan, Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
2015 Science of Computer Programming  
A framework for the modular encoding of process calculi into Petri nets is proposed, which is based on a reactive variant of Petri nets.  ...  The paper investigates the relationships between two well-known approaches to the modelling of concurrent and distributed systems, process calculi and Petri nets.  ...  In particular, we are indebted to the referee that pointed out the relevance of control state reachability in process calculi.  ... 
doi:10.1016/j.scico.2014.11.019 fatcat:nsilavtlhncfnaa4whzsg2qnmm

Compositional Workflow Modeling with Priority Constraints

Behnaz Changizi, Natallia Kokash, Farhad Arbab, Leonid Makhnist
2020 Science of Computer Programming  
Best and Koutny [14] introduced Petri-net based semantics to priority systems defined by a bounded Petri-net and priority relation pair.  ...  However, while Petri net-based models enable automated process analysis, they lack a few desirable characteristics: 1.  ... 
doi:10.1016/j.scico.2020.102578 fatcat:6ptheuwqwzgwxlrmaddqfh2pqe

Page 3472 of Mathematical Reviews Vol. , Issue 94f [page]

1994 Mathematical Reviews  
, Comparability orders and measurement (371-405); Younes Souissi, Deterministic systems of sequential processes: a class of structured Petri nets (406-426); 68 COMPUTER SCIENCE 3472 Antti Valmari, Compositional  ...  Simone, A survey of equivalence notions for net based systems (410-472).  ... 

Extending IOPT Nets with a Module Construct [chapter]

José Ribeiro, Fernando Melício, Luis Gomes
2016 IFIP Advances in Information and Communication Technology  
Input-output place-transition nets (IOPT nets) are a Petri net based formalism targeted for the development of embedded systems controllers.  ...  It is an extension to common place-transition Petri nets, introducing constructs to model the communication between the controller and the environment and using an execution semantics assuring a deterministic  ...  It was presented a modular extension for IOPT nets, a Petri net based language targeted for the development of embedded systems.  ... 
doi:10.1007/978-3-319-31165-4_9 fatcat:vjzkfhrsfzgp7ou57vqpnvgmte

Open Petri nets

John C. Baez, Jade Master
2020 Mathematical Structures in Computer Science  
The reachability semantics for Petri nets can be studied using open Petri nets. For us, an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets.  ...  The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out.  ...  We thank Christina Vasilakopoulou for spending many hours helping us figure out how to turn Petri nets into commutative monoidal categories.  ... 
doi:10.1017/s0960129520000043 fatcat:prigfueah5f33jf7zfw3bvzqtm
« Previous Showing results 1 — 15 out of 2,566 results