Petri net models for algebraic theories of concurrency
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Concurrent bisimulations in Petri nets
Acta Informatica
Selected papers of the Second Workshop on Concurrency and compositionality
Petri nets and automata with concurrency relations—an adjunction
Semantics of programming languages and model theory
Handbook of logic in computer science (vol. 4)
Timed testing of concurrent systems
Information and Computation
Designing Control Logic for Counterflow Pipeline Processor Using Petri Nets
Formal Methods in System Design
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
A Trace Semantics for Petri Nets (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Polynomial Algorithms for the Synthesis of Bounded Nets
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Deriving Unbounded Petri Nets from Formal Languages
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
On Concurrent Realization of Reactive Systems and Their Morphisms
Unifying Petri Nets, Advances in Petri Nets
Translations between Textual Transition Systems and Petri Nets
IFM '02 Proceedings of the Third International Conference on Integrated Formal Methods
| Hi-index | 0.00 |
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 independence relation to an asynchronous transition system. For an arbitrary asynchronous transition system, we construct an ST-bisimilar net. We show how to decide effectively whether there exists a bisimilar net without internal transitions, in which case we can also find a history-preserving bisimilar net without internal transitions. Finally, we present a construction that inserts a new internal event into an asynchronous transition system such that the result is history-preserving bisimilar; this construction can help to find a history-preserving bisimilar net (with internal transitions).