Sciweavers

219 search results - page 23 / 44
» Combinatorial Complexity of Regular Languages
Sort
View
89
Voted
ICTAI
2005
IEEE
15 years 6 months ago
Improving Lotos Simulation Using Constraint Propagation
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
Malek Mouhoub, Samira Sadaoui
CAISE
2008
Springer
15 years 2 months ago
How Much Language Is Enough? Theoretical and Practical Use of the Business Process Modeling Notation
The Business Process Modeling Notation (BPMN) is an increasingly important industry standard for the graphical representation of business processes. BPMN offers a wide range of mod...
Michael zur Muehlen, Jan Recker
95
Voted
CSR
2006
Springer
15 years 4 months ago
Unfolding Synthesis of Asynchronous Automata
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
Nicolas Baudru, Rémi Morin
ICALP
2009
Springer
16 years 19 days ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
IJWGS
2006
125views more  IJWGS 2006»
15 years 10 days ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...