543 Hits in 3.3 sec

A uniform approach to true-concurrency and interleaving semantics for Petri nets

Lutz Priese, Harro Wimmel
1998 Theoretical Computer Science  
This paper continues a research on universal contexts and semantics for Petri nets started by Nielsen, Priese and Sassone (1995) .  ...  We consider generalized, labelled Petri nets N where some transitions and places are distinguished as public. They form the interface of N that may communicate with a Petri net context.  ...  In fact, they have led to a complete rearrangement of the paper.  ... 
doi:10.1016/s0304-3975(97)00169-2 fatcat:4rlo2axnlnbarku3mi3vmg2z2u

Author index volume 206 (1998)

1998 Theoretical Computer Science  
Wimmel, A uniform approach to true-concurrency and interleaving semantics for Petri nets Sac& D.. see T. Eiter Walker, D., see X. Liu Wimmel, H., see L. Priese Yamasaki, S. and Y.  ...  ., A semantics for modular general logic programs (Fundamenral Study) (l-2) 51p 80 Fredholm, D., see L. Colson , X. and D.  ... 
doi:10.1016/s0304-3975(98)00196-0 fatcat:g33se4mfqrevbehyqgl4nfu6jy

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra [chapter]

Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel
2008 Lecture Notes in Computer Science  
The project was initiated and effectively animated by Ugo Montanari, a passionate and long-time advocate of both these approaches to the semantics of concurrency.  ...  We recall some memories of the Esprit Basic Research Action CEDISYS, a small, well-focussed and fruitful project which brought together researchers at the meeting point of true concurrency and process  ...  Acknowledgements We would like to thank Luca Aceto, Rocco De Nicola and the anonymous reviewer for helpful comments.  ... 
doi:10.1007/978-3-540-68679-8_47 fatcat:4f2okdimfnfbfk2j6mdrq5lk3m

Model-checking games for fixpoint logics with partial order models

Julian Gutierrez, Julian Bradfield
2011 Information and Computation  
Since the interleaving semantics of such models is not considered, some problems that may arise when using interleaving representations are avoided and new decidability results for partial order models  ...  The games are shown to be sound and complete, and therefore determined.  ...  Acknowledgments The author thank the reviewers of the Information and Computation journal and of CONCUR 2009 for their comments, respectively, on this article and on a preliminary conference version [  ... 
doi:10.1016/j.ic.2010.12.002 fatcat:6ohjhbv23jds7m6jeuulgl2qre

Page 4873 of Mathematical Reviews Vol. , Issue 2004f [page]

2004 Mathematical Reviews  
As an illustration, the paper gives an application to the modelling of a multi-tasking system in a parallel programming language, which is provided with a concurrent semantics based on Petri nets and for  ...  (F-PARIS12-LC; Créteil) A class of composable and preemptible high-level Petri nets with an application to multi-tasking systems.  ... 

Strategic directions in concurrency research

Rance Cleaveland, Scott A. Smolka
1996 ACM Computing Surveys  
ACKNOWLEDGMENTS This report has benefited from helpful comments from Chris Hankin, Michael Loui, Jack Stankovic, and Peter Wegner.  ...  For example, an approach to design and verification based on a true concurrency model may yield greater computational efficacy than one based on interleaving, since the former admits the application of  ...  Similar to concerns raised in Section 3.2 regarding a uniform semantic framework for concurrency, we should also seek ways to combine methodologies to better suit the demands of a given application, and  ... 
doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq

Logics and Games for True Concurrency [article]

Julian Gutierrez
2010 arXiv   pre-print
groundwork for the design of a logic-based, game-theoretic framework for studying, in a uniform way, several concurrent systems regardless of whether they have an interleaving or a partial order semantics  ...  Such dualities are used to define new mu-calculi and logic games for the analysis of concurrent systems with partial order semantics.  ...  Partial Order Models of Concurrency In concurrency there are two main semantic approaches to modelling concurrent behaviour, either using interleaving or partial order models for concurrency.  ... 
arXiv:1011.1172v1 fatcat:jmahyvyacffzheloesvuwy25xq

Page 394 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
93a:68037 operational and denotational semantics for a simple concurrent language with recursion, and prove that 7 = J.”  ...  We introduce an observation algebra for CCS and we show that the standard interleaving semantics can be obtained by axiomatizing the operations to yield actions.  ... 

Non-interference by Unfolding [chapter]

Paolo Baldan, Alberto Carraro
2014 Lecture Notes in Computer Science  
We show that BNDC admits natural characterisations based on the unfolding semantics -a classical true concurrent semantics for Petri nets -in terms of causalities and conflicts between high and low level  ...  This leads to an algorithm for checking BNDC for safe Petri nets which relies on the construction of suitable complete prefixes of the unfolding. A prototype tool provides very promising results.  ...  We are grateful to César Rodríguez for developing the tool CUNF and for his suggestions on its use for producing UBIC.  ... 
doi:10.1007/978-3-319-07734-5_11 fatcat:pxxh4wxdxfghjik32kumpgudku

On fixpoint logics and equivalences for processes with restricted nondeterminism

Julian Gutierrez
2015 Journal of Logic and Computation  
, the so-called 'true concurrency' approach, independence or concurrency is a primitive notion (as in, e.g., Petri nets or event structures) rather than a derived concept, as in the interleaving framework  ...  From a partial order point of view, a process with an interleaving semantics has no concurrency, trivial causality, and no confusion.  ...  I thank the support of the ERC Advance Grant RACE and Michael Wooldridge for useful comments on an initial version of the paper.  ... 
doi:10.1093/logcom/exv032 fatcat:lnpbai3nvzcgxgbvauammc2yge

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.  ...  In this tutorial paper I will review some basic de nitions and constructions concerning the concurrent semantics of nets, and I will show to what extent corresponding notions have been developed for graph  ...  Orthogonally, t h e concurrency aspects of a net can be represented using a true concurrency approach, where the fact that two e v ents are \not causally related" is represented directly in the semantics  ... 
doi:10.1016/s1571-0661(05)80181-1 fatcat:dr5n3rqfrfcltoja5eyquch5vu

Page 6383 of Mathematical Reviews Vol. , Issue 99i [page]

1999 Mathematical Reviews  
{For the entire collection see MR 99h:68010.} 991:68036 68Q10 68Q90 Priese, Lutz; Wimmel, Harro A uniform approach to true-concurrency and interleaving semantics for Petri nets.  ...  Labeled Petri nets are adequate to model essential aspects of concurrent systems and to study various versions of (concurrent) behavior and composition.  ... 

Page 5366 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
A notion of independence of rules and runs enables us to introduce a notion of (and notation for) con- current runs, on which a logical theory of (‘true’) concurrency may be based.  ...  The creation of an algebraic framework to deal with realistic applications consists in construct- ing modules of operators and axioms, each module describing a feature of concurrency in a certain semantical  ... 

Equivalence notions for concurrent systems and refinement of actions [chapter]

Rob Glabbeek, Ursula Goltz
1989 Lecture Notes in Computer Science  
We investigate equivalence notions for concurrent systems.  ...  We show that the usual interleaving equivalences, and also the equivalences based on steps (multisets of concurrently executed actions) are not preserved by refinement of atomic actions.  ...  Many thanks also to Ilaria Castellani, Rocco De Nicola and Frits Vaandrager for helpful discussions and comments, and to Gertrud Jacobs for her patience and careful preparation of the manuscript.  ... 
doi:10.1007/3-540-51486-4_71 fatcat:efz3skw3mndffewjjfunznf5zu

Bisimulation and action refinement

Walter Vogler
1993 Theoretical Computer Science  
For event structures with silent moves, we consider several types of bisimulation that incorporate "true" concurrency to a varying degree, and show how each can be lifted in a uniform way to a congruence  ...  We prove that we have constructed the coarsest congruences that respect interleaving, pomset and history-preserving bisimulation.  ...  Acknowledgment I thank the four referees for their numerous and valuable hints.  ... 
doi:10.1016/0304-3975(93)90157-o fatcat:cisvpag6lna5ffhjmpfkwmpb7u
« Previous Showing results 1 — 15 out of 543 results