Walter Vogler  Home/Search
Context Related
| informatik.uniaugsburg....19985.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.uniaugsburg.de/tec... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to find such a net (which must have the arc-labels of the transition system as transitions). In this paper, we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additional internal transitions. To speak of concurrency, the transition system is enriched by an... (Update)
Context of citations to this paper: More
...to the notion of strong bisimulation. We have grounds to believe that by allowing partial relabellings, and thereby silent actions in the implementing systems, one can achieve more concurrent behaviour. A similar line of research has been recently initiated by Vogler, cf....
Cited by: More
Complexity Results for Checking Distributed Implementability - Heljanko, Stefanescu (2004) (Correct)
On Concurrent Realization of Reactive Systems - And Their Morphisms (Correct)
Concurrent Realizations of Reactive Systems - Bednarczyk, Borzyszkowski (1999) (Correct)
Active bibliography (related documents): More All
0.5: A description of the non-sequential execution of Petri-nets in.. - Retore (2000) (Correct)
0.2: On the synthesis of general Petri nets - Badouel, Darondeau (1996) (Correct)
0.2: Refinement of Actions and Equivalence Notions for Concurrent .. - van Glabbeek, Goltz (1998) (Correct)
Similar documents based on text: More All
1.0: Partial S-Invariants for the Verification of Infinite Systems.. - Vogler (2001) (Correct)
0.6: Measuring the Performance of Asynchronous Systems with PAFAS - Corradini, Vogler (2002) (Correct)
0.5: Axiomatizing a Fragment of PAFAS - Vogler, Jenner (2000) (Correct)
Related documents from co-citation: More All
4: Elementary transition systems (context) - Nielsen, Rozenberg et al. - 1992
4: Decompositions of asynchronous systems (context) - Morin - 1998
3: Formal Aspects of Computing (context) - Shields, hipertraces et al. - 1992
BibTeX entry: (Update)
W. Vogler. Concurrent implementations of asynchronous transition systems, 1999. Submitted. 18 http://citeseer.ist.psu.edu/vogler98concurrent.html More
@inproceedings{ vogler99concurrent,
author = "Walter Vogler",
title = "Concurrent Implementation of Asynchronous Transition Systems",
booktitle = "{ICATPN}",
pages = "284-303",
year = "1999",
url = "citeseer.ist.psu.edu/vogler98concurrent.html" }
Citations (may not include all citations):146 EATCS Monographs on Theoretical Computer Science (context) - Reisig - 1985
144 Models for concurrency - Nielsen, Winskel - 1995
104 Branching time and abstraction in bisimulation semantics (context) - Glabbeek, Weijland - 1989
57 Petri net models for algebraic theories of concurrency (context) - Glabbeek, Vaandrager - 1987
53 Elementary transition systems (context) - Nielsen, Rozenberg et al. - 1992
49 Modular Construction and Partial Order Semantics of Petri Ne.. (context) - Vogler - 1992
21 Polynomial algorithms for the synthesis of bounded nets - Badouel, Bernardinello et al. - 1995
17 Concurrent bisimulations in Petri nets (context) - Best, Devillers et al. - 1991
15 Timed testing of concurrent systems (context) - Vogler - 1995
12 Designing control logic for counterflow pipeline processor u.. - Yakovlev - 1998
11 Petri Net Theory (context) - Peterson - 1981
11 A trace semantics for Petri nets (context) - Hoogers, Kleijn et al. - 1992
9 Deriving Petri nets from finite transition systems - Cortadella, Kishinevsky et al. - 1998
9 Petri nets and automata with concurrency relations -- an adj.. (context) - Droste, Shortt - 1993
9 The difference between splitting in n and n (context) - Glabbeek, Vaandrager - 1997
2 Deriving unbounded Petri nets from formal languages (context) - Darondeau - 1998
1 Reasoning about Reactive Systems - Sunesen - 1998
1 Non-pure nets and their transition systems (context) - Pietkiewicz-Koutny, Yakovlev - 1995
Documents on the same site (http://www.informatik.uni-augsburg.de/techreport/): More
The HERON Project - Multimedia Database Support.. - Kießling, Erber.. (1998) (Correct)
Layered Graph Traversals and Hamiltonian Path Problems -.. - Brunn, Möller, Russling (1997) (Correct)
ReGTime - Rent Gigaflops someTimes - Dreier, Huber, Zahn, Karl, Ungerer (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC