1099 search results - page 10 / 220 » Petri net ontology |
APN
2008
Springer
13 years 11 months ago
2008
Springer
This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
ACTA
2007
13 years 10 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
AIME
2009
Springer
13 years 11 months ago
2009
Springer
: Clinical Pathways can be viewed as workflows, comprising an ordering of activities with associated execution constraints. Workflow models allow formal representation, analysis an...
ACTA
2007
13 years 10 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
FOSSACS
2001
Springer
14 years 2 months ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...