Sciweavers

526 search results - page 7 / 106
» Type Abstractions of Name-Passing Processes
Sort
View
ACSD
2004
IEEE
124views Hardware» more  ACSD 2004»
14 years 9 days ago
A Behavioral Type Inference System for Compositional System-on-Chip Design
The design productivity gap has been recognized by the semiconductor industry as one of the major threats to the continued growth of system-on-chips and embedded systems. Ad-hoc s...
Jean-Pierre Talpin, David Berner, Sandeep K. Shukl...
IFIPTCS
2000
14 years 4 days ago
Ambient Groups and Mobility Types
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...
Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
FOSSACS
2001
Springer
14 years 1 months ago
High-Level Petri Nets as Type Theories in the Join Calculus
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 ...
Maria Grazia Buscemi, Vladimiro Sassone
CAISE
2006
Springer
14 years 9 days ago
Using Process Mining to Analyze and Improve Process Flexibility
Abstract. Contemporary information systems struggle with the requirement to provide flexibility and process support while still enforcing some degree of control. Workflow managemen...
Wil M. P. van der Aalst, Christian W. Günther...
ICALP
2010
Springer
14 years 1 months ago
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...