Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Factorisation of transition systems

From MaRDI portal
Publication:1647774
Jump to:navigation, search

DOI10.1007/s00236-017-0300-yzbMath1395.68196OpenAlexW2609291594MaRDI QIDQ1647774

Raymond Devillers

Publication date: 26 June 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-017-0300-y


Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)


Related Items

Articulation of Transition Systems and Its Application to Petri Net Synthesis, Efficient synthesis of weighted marked graphs with circular reachability graph, and beyond, Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis



Cites Work

  • Petri net synthesis
  • Comparing transition systems with independence and asynchronous transition systems
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1647774&oldid=13955044"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 05:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki